Skip to main content

Research on Construction Algorithm of Large Circulant LDPC Codes

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

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

  • 118 Accesses

Abstract

One approach to improve the performance of Low-Density Parity-Check (LDPC) code was to address the presence of short cycles. In this paper, a variable-degree scoring algorithm was presented, designed for both general LDPC codes and Quasi-Cyclic (QC) LDPC codes, with the goal of eliminating short cycles and evaluating the impact on decoding performance. Scores were assigned to the non-zero elements in the LDPC codes based on their involvement in short cycles by the algorithm, and the elements with the highest scores were subsequently modified. Our algorithm effectively eliminated short cycles and improved decoding performance.

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 299.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 379.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. Gholami M, Alinia M (2015) High-performance binary and non-binary low-density parity-check codes based on affine permutation matrices. IET Commun 9:17

    Article  Google Scholar 

  2. Gholami M, Nassaj A (2021) LDPC codes based on rational functions. IETE J Res 2021:1–6

    Google Scholar 

  3. Danish MN, Pasha SA, Hashmi AJ (2021) Quasi-cyclic LDPC codes for short block-lengths. In: Proceedings of the 2021 IEEE aerospace conference (50100). IEEE, pp 1–8

    Google Scholar 

  4. Gholami Z, Gholami M (2018) Anti quasi-cyclic LDPC codes. IEEE Commun Lett 22(6):1116–1119

    Article  Google Scholar 

  5. Amirzade F, Panario D, Sadeghi MR (2022) Trade-based LDPC codes. In: Proceedings of the 2022 IEEE international symposium on information theory (ISIT). IEEE, pp 542–547

    Google Scholar 

  6. Sobhani R (2012) Approach to the construction of regular low-density parity-check codes from group permutation matrices. IET Commun 6(12):1750–1756

    Article  MathSciNet  Google Scholar 

  7. Karimi B, Banihashemi AH (2019) Construction of QC LDPC codes with low error floor by efficient systematic search and elimination of TS. IEEE Trans Commun 68(2):697–712

    Article  Google Scholar 

  8. Naseri S, Banihashemi AH (2019) Spatially coupled LDPC codes with small constraint length and low error floor. IEEE Commun Lett 24(2):254–258

    Article  Google Scholar 

  9. Amirzade F, Sadeghi MR (2018) Lower bounds on the lifting degree of QC-LDPC codes by difference matrices. IEEE Access 6:23688–23700

    Article  Google Scholar 

  10. Hai Z, Liqun P, Hengzhou X et al (2018) Construction of Quasi-Cyclic LDPC codes based on fundamental theorem of arithmetic. Wireless Commun Mobile Comput 2018:66–89

    Google Scholar 

  11. Amirzade F, Sadeghi MR, Panario D (2021) QC-LDPC codes with large column weight and free of small size ETSs. IEEE Commun Lett 26(3):500–504

    Article  Google Scholar 

  12. Fossorier MPC (2004) Quasicyclic low-density parity-check codes from circulant permutation matrices. IEEE Trans Inform Theory 50(8):1788–1793

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work was supported in part by the Natural Science Foundation of China under Grant 61901301.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yupeng Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wu, X., Li, Y., Zhang, Y. (2024). Research on Construction Algorithm of Large Circulant LDPC Codes. In: Wang, W., Liu, X., Na, Z., Zhang, B. (eds) Communications, Signal Processing, and Systems. CSPS 2023. Lecture Notes in Electrical Engineering, vol 1033. Springer, Singapore. https://doi.org/10.1007/978-981-99-7502-0_21

Download citation

  • DOI: https://doi.org/10.1007/978-981-99-7502-0_21

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-99-7555-6

  • Online ISBN: 978-981-99-7502-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics