Advertisement

An LDPC Code Design with Sub-matrix Structure

  • Jianhua Lu
  • Xiaoming Tao
  • Ning Ge
Chapter
Part of the SpringerBriefs in Electrical and Computer Engineering book series (BRIEFSELECTRIC)

Abstract

A low density parity check (LDPC) code may have performance that approaches the Shannon limit in coping with noise and jamming in transmission channels. On the other hand, conventional LDPC codes design is usually based on random search within a huge exploration space for different bit-element combinations in the coding matrix. In this chapter, a structured method based on Galois field sub-matrices is introduced to translate a large scale coding matrix design into a successive sub-matrices design. Examples and simulation results show that the proposed methodology may exhibit excellent performance with low construction complexity, demonstrating that structured coding design is feasible and promising to tackle the challenges of LDPC code design.

Keywords

Channel coding LDPC Structured coding design 

References

  1. 1.
    C. E. Shannon, “A mathematical theory of communication,” Bell Syst. Tech J., vol. 27, pp. 379–423, 623–656, 1948.Google Scholar
  2. 2.
    R. G. Gallager, “Low Density Parity Check Codes,” IEEE Transactions on Information Theory, vol. 8, pp. 21–28, 1962.CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    C. Berrou, A. Glavieux, “Near optimum error correcting coding and decoding: turbo-codes,” IEEE Transactions on Communications, vol. 44, no. 10, pp. 1261–1271, 1996.CrossRefGoogle Scholar
  4. 4.
    D. MacKay, R. Neal, “Near Shannon limit performance of low density parity check codes,” Electronics Letters, vol. 32, no. 18, pp. 1645, 1996.Google Scholar
  5. 5.
    C. Sae-Young, T. J. Richardson, R. L. Urbanke, “Analysis of sum-product decoding of lowdensity parity-check codes using a Gaussian approximation,” IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 657–670, 2001.CrossRefzbMATHGoogle Scholar
  6. 6.
    European Standard, “Digital Video Broadcasting (DVB);Second generation framing structure, channel coding and modulation systems for Broadcasting,Interactive Services, News Gathering and other broadband satellite applications (DVB-S2),” ETSI EN 302 307 V1.2.1, 2009.Google Scholar
  7. 7.
    CCSDS Standard, “Low Density Parity Check Codes for Use in Near-Earth and Deep Space Applications,” Experimental Specification CCSDS 131.1-O-2, 2007.Google Scholar
  8. 8.
    IEEE WIFI standard, “Wireless LAN media access control and physical layer specifications”.Google Scholar
  9. 9.
    C. Sae-Young, J. Forney, T. J. Richardson, et al., “On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit,”, IEEE Communications Letters, vol. 5, no. 2, pp. 58–60, 2001.CrossRefGoogle Scholar
  10. 10.
    J. Lu, N. Ge, B. Du, “Complexity and uncertainty: wireless communications face dual challenges,” Science China: infomation science, vol. 43, pp. 1563–1577, 2013.Google Scholar
  11. 11.
    J. Lu, L. Yin, Y. Pei, “The coding method of short code-length low-density parity-check code,” Chinese Patent, ZL 200910077183.6, 2004.Google Scholar
  12. 12.
    Y. Pei, L. Yin, J. Lu, “Design of irregular LDPC codec on a single chip FPGA,” Proceedings of the IEEE 6th Circuits and Systems Symposium on Emerging Technologies, vol. 1, pp. 221–224, 2004.Google Scholar
  13. 13.
    T. Zhang, K. K. Parhi, “Joint (3,k)-regular LDPC code and decoder/encoder design,” IEEE Transactions on Signal Processing, vol. 52, no. 4, pp. 1065–1079, 2004.CrossRefMathSciNetGoogle Scholar
  14. 14.
    K. Andrews, S. Dolinar, D. Divsalar, J. Thorpe “Design of Low-Density Parity-Check (LDPC) Codes for Deep Space Applications,” IPN Progress Report 42-159, 2004.Google Scholar
  15. 15.
    J. Thorpe, “Low-Density Parity-Check (LDPC) Codes Constructed from Protographs,” Jet Propulsion Laboratory Technical report, 2003.Google Scholar
  16. 16.
    Y. Kou, S. Lin, M. Fossorier, “Low-density parity-check codes based on finite geometries: a rediscovery and new results,” IEEE Transactions on Information Theory, vol. 47, no. 7, pp. 2711–2736, 2001.CrossRefzbMATHMathSciNetGoogle Scholar
  17. 17.
    W. Chen, L. Yin, J. Lu, “Minimum distance lower bounds for girth-constrained RA code ensembles,” IEEE Transactions on Communications, vol. 58, no. 6, pp. 1623–1626, 2010.CrossRefGoogle Scholar

Copyright information

© The Author(s) 2015

Authors and Affiliations

  • Jianhua Lu
    • 1
  • Xiaoming Tao
    • 1
  • Ning Ge
    • 1
  1. 1.Department of Electronic EngineeringTsinghua UniversityBeijingChina

Personalised recommendations