Skip to main content
Log in

The Q-matrix Low-Density Parity-Check codes

  • Published:
Journal of Electronics (China)

Abstract

This paper presents a matrix permuting approach to the construction of Low-Density Parity-Check (LDPC) code. It investigates the structure of the sparse parity-check matrix defined by Gallager. It is discovered that the problem of constructing the sparse parity-check matrix requires an algorithm that is efficient in search environments and also is able to work with constraint satisfaction problem. The definition of Q-matrix is given, and it is found that the queen algorithm enables to search the Q-matrix. With properly permuting Q-matrix as sub-matrix, the sparse parity-check matrix which satisfied constraint condition is created, and the good regular-LDPC code that is called the Q-matrix LDPC code is generated. The result of this paper is significant not only for designing low complexity encoder, improving performance and reducing complexity of iterative decoding arithmetic, but also for building practical system of encodable and decodable LDPC code.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. R. G. Gallager, Low-density parity check codes, Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, 1960.

    MATH  Google Scholar 

  2. Yu Kou, Shu Lin, Marc P. C. Fossorier, Low-density parity-check codes based on finite geometries: A rediscovery and new results, IEEE Trans. on Inform. Theory, 47(2001) 7, 2711–2736.

    Article  MathSciNet  MATH  Google Scholar 

  3. R. Sosic, Jun Gu, Efficient local search with conflict minimization: A case study of the n-queens problem, IEEE Trans. on Knowledge and Data Eng., 6(1994) 5, 661–668.

    Article  Google Scholar 

  4. R. Echard, S. C. Chang, The π-rotation low-density parity check codes, in Proc. GLOBECOM 2001, Texas USA, Nov. 2001, 980–984.

  5. Li Ping, K. Leung, Nam Phamdo, Low density parity check codes with semi-random parity check matrix, Electronics Letters, 35(1999)1, 38–39.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Peng Li.

Additional information

Supported by the National Natural Science Foundation of China (No.60572050) and by the National Science Foundation of Hubei Province (No.2004ABA049).

About this article

Cite this article

Peng, L., Zhu, G. The Q-matrix Low-Density Parity-Check codes. J. of Electron.(China) 23, 35–38 (2006). https://doi.org/10.1007/s11767-004-0052-z

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11767-004-0052-z

Key words

Navigation