Skip to main content
Log in

Design of Quasi-Cyclic LDPC codes based on Euclidean Geometries

  • Published:
Journal of Electronics (China)

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

A new method for constructing Quasi-Cyclic (QC) Low-Density Parity-Check (LDPC) codes based on Euclidean Geometry (EG) is presented. The proposed method results in a class of QC-LDPC codes with girth of at least 6 and the designed codes perform very close to the Shannon limit with iterative decoding. Simulations show that the designed QC-LDPC codes have almost the same performance with the existing EG-LDPC codes.

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. IRE Transactions on Information Theory, 8(1962)1, 21–28.

    Article  MathSciNet  Google Scholar 

  2. D. J. C. MacKay and R. M. Neal. Near Shannon limit performance of low density parity check codes. IEE Electronics Letters, 32(1996) 18, 1645–1646.

    Article  Google Scholar 

  3. S. Lin and D. J. Costello, Jr.. Error Control Coding: Fundamentals and Applications. 2nd ed., Upper Saddle River, NJ, Prentice-Hall, 2004.

    Google Scholar 

  4. Y. Kou, S. Lin, and M. Fossorier. Low-density parity-check codes based on finite geometries: a rediscovery and new results. IEEE Transactions on Information Theory, 47(2001)7, 2711–2736.

    Article  MATH  MathSciNet  Google Scholar 

  5. Y. H. Liu, X. M. Wang, R. W. Chen, and Y. C. He. Generalized combining method for design of quasi-cyclic LDPC codes. IEEE Communications Letters, 12(2008) 5, 392–394.

    Article  Google Scholar 

  6. Y. Y. Tai, L. Lan, L. Q. Zeng, S. Lin, and K. Abdel-Ghaffar. Algebraic construction of quasi-cyclic LDPC codes for the AWGN and erasure channels. IEEE Transactions on Communications, 54(2006)10, 1765–1774.

    Article  Google Scholar 

  7. M. P. C. Fossorier. Quasi-cyclic low density parity check codes from circulant permutation matrices. IEEE Transactions on Information Theory, 50(2004)8, 1788–1794.

    Article  MathSciNet  Google Scholar 

  8. L. Lan, L. Q. Zeng, Y. Y. Tai, L. Chen, S. Lin, and K. Abdel-Ghaffar. Construction of quasi-cyclic LDPC codes for AWGN and binary erasure channels: a finite field approach. IEEE Transactions on Information Theory, 53(2007)7, 2429–2458.

    Article  MathSciNet  Google Scholar 

  9. T. R. Halford and K. M. Chugg. An algorithm for counting short cycles in bipartite graphs. IEEE Transactions on Information Theory, 52(2006)1, 287–292.

    Article  MathSciNet  Google Scholar 

  10. J. L. Fan. Array codes as low-density parity-check codes. Proceedings of the 2nd International Symposium on Turbo Codes and Related Topics, Brest, France, 2000, 543–546.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yuanhua Liu.

Additional information

Supported by the National Key Basic Research Program (973) Project (No. 2010CB328300) and the 111 Project (No. B08038).

Communication author: Liu Yuanhua, born in 1983, female, Ph.D., Instructor.

About this article

Cite this article

Liu, Y., Niu, X., Wang, X. et al. Design of Quasi-Cyclic LDPC codes based on Euclidean Geometries. J. Electron.(China) 27, 340–344 (2010). https://doi.org/10.1007/s11767-010-0348-0

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11767-010-0348-0

Key words

Navigation