Skip to main content

2024 | OriginalPaper | Buchkapitel

Research on Construction Algorithm of Large Circulant LDPC Codes

verfasst von : Xiao Wu, Yupeng Li, Yanyue Zhang

Erschienen in: Communications, Signal Processing, and Systems

Verlag: Springer Nature Singapore

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Gholami M, Alinia M (2015) High-performance binary and non-binary low-density parity-check codes based on affine permutation matrices. IET Commun 9:17CrossRef Gholami M, Alinia M (2015) High-performance binary and non-binary low-density parity-check codes based on affine permutation matrices. IET Commun 9:17CrossRef
2.
Zurück zum Zitat Gholami M, Nassaj A (2021) LDPC codes based on rational functions. IETE J Res 2021:1–6 Gholami M, Nassaj A (2021) LDPC codes based on rational functions. IETE J Res 2021:1–6
3.
Zurück zum Zitat 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 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
4.
Zurück zum Zitat Gholami Z, Gholami M (2018) Anti quasi-cyclic LDPC codes. IEEE Commun Lett 22(6):1116–1119CrossRef Gholami Z, Gholami M (2018) Anti quasi-cyclic LDPC codes. IEEE Commun Lett 22(6):1116–1119CrossRef
5.
Zurück zum Zitat 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 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
6.
Zurück zum Zitat Sobhani R (2012) Approach to the construction of regular low-density parity-check codes from group permutation matrices. IET Commun 6(12):1750–1756MathSciNetCrossRef Sobhani R (2012) Approach to the construction of regular low-density parity-check codes from group permutation matrices. IET Commun 6(12):1750–1756MathSciNetCrossRef
7.
Zurück zum Zitat 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–712CrossRef 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–712CrossRef
8.
Zurück zum Zitat Naseri S, Banihashemi AH (2019) Spatially coupled LDPC codes with small constraint length and low error floor. IEEE Commun Lett 24(2):254–258CrossRef Naseri S, Banihashemi AH (2019) Spatially coupled LDPC codes with small constraint length and low error floor. IEEE Commun Lett 24(2):254–258CrossRef
9.
Zurück zum Zitat Amirzade F, Sadeghi MR (2018) Lower bounds on the lifting degree of QC-LDPC codes by difference matrices. IEEE Access 6:23688–23700CrossRef Amirzade F, Sadeghi MR (2018) Lower bounds on the lifting degree of QC-LDPC codes by difference matrices. IEEE Access 6:23688–23700CrossRef
10.
Zurück zum Zitat 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 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
11.
Zurück zum Zitat 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–504CrossRef 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–504CrossRef
12.
Zurück zum Zitat Fossorier MPC (2004) Quasicyclic low-density parity-check codes from circulant permutation matrices. IEEE Trans Inform Theory 50(8):1788–1793MathSciNetCrossRef Fossorier MPC (2004) Quasicyclic low-density parity-check codes from circulant permutation matrices. IEEE Trans Inform Theory 50(8):1788–1793MathSciNetCrossRef
Metadaten
Titel
Research on Construction Algorithm of Large Circulant LDPC Codes
verfasst von
Xiao Wu
Yupeng Li
Yanyue Zhang
Copyright-Jahr
2024
Verlag
Springer Nature Singapore
DOI
https://doi.org/10.1007/978-981-99-7502-0_21

Neuer Inhalt