Skip to main content

Construction of Check Matrix for B-LDPC and Non-binary LDPC Codes

  • Conference paper
  • First Online:
Communications, Signal Processing, and Systems (CSPS 2017)

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 463))

Abstract

In the high speed data transmission, Low-Density Parity-Check (LDPC) channel coding scheme is widely studied for its near Shannon limit and its good performance in the circumstance of low signal to noise ratio. The LDPC codes have several advantages over the Turbo codes and are one of the hottest topic in today’s coding theory research. Based on the research background, this paper has proposed the method for constructing a Check matrix of Binary LDPC. Secondly, the Tanner graph of B-LDPC is introduced in detail. Finally, The construction of Non-binary LDPC is investigated. Important rules of Non-binary LDPC are put forward. The factors that influence the performance are discussed and it explores the research direction of the next step.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27, 379–423, 623–656 (1948)

    Google Scholar 

  2. Gallager, R.G.: Low-density parity-check codes. IRE Trans. Inf. Theory T-8, 21–28 (1962)

    Google Scholar 

  3. Mackay, D.J.C., Neal, R.M.: Near Shannon limit performance of low-density parity-check codes. Electron. Lett. 32, 1645–1646 (1996)

    Google Scholar 

  4. Berrou, C., Glavieux, A.: Near optimum error correcting coding and decoding: turbo-codes. IEEE Trans. Commun. 44(10), 1261–1271 (1996)

    Google Scholar 

  5. Chen, X., Men, A., Yang, B., et al.: Construction of LDPC codes over GF(q) with modified progressive edge growth. J. China Univ. Posts Telecommun. 16(5), 103–106 (2009)

    Google Scholar 

  6. Kang, J., Huang, Q., Zhang, L., et al.: Quasi-cyclic LDPC codes: an algebraic construction. IEEE Trans. Commun. 58(5), 1383–1396 (2010)

    Google Scholar 

  7. Chen, C.Y., Huang, Q., Chao, C., et al.: Two low-complexity reliability-based message-passing algorithms for decoding non-binary LDPC codes. IEEE Trans. Commun. 52(11), 3140–3147 (2010)

    Google Scholar 

Download references

Acknowledgments

This work was supported by the Heilongjiang Province Natural Science Foundations of China (F2015019, F2015019 and E2016061), the Heilongjiang Province Postdoctoral Science Foundations (LBH-Z16054).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to ZhongZhi Lv .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Lv, Z. (2019). Construction of Check Matrix for B-LDPC and Non-binary LDPC Codes. In: Liang, Q., Mu, J., Jia, M., Wang, W., Feng, X., Zhang, B. (eds) Communications, Signal Processing, and Systems. CSPS 2017. Lecture Notes in Electrical Engineering, vol 463. Springer, Singapore. https://doi.org/10.1007/978-981-10-6571-2_34

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-6571-2_34

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-6570-5

  • Online ISBN: 978-981-10-6571-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics