Tail-Biting Globally-Coupled LDPC Codes
- 30 September 2019
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 67 (12) , 8206-8219
Abstract
This paper presents a new type of globally-coupled low-density parity-check (GC-LDPC) codes whose base matrix has a cyclic structure in the global part. Therefore, the resulting codes are referred to as tail-biting GC-LDPC (TB-GC-LDPC) codes. We propose two methods to construct TB GC quasi-cyclic LDPC (TB-GC-QC-LDPC) codes. For the first method, we extract a replicated version of a constructed base matrix and mask it with a designed masking matrix. Compared to the conventional construction methods, this method provides more flexibility in code length for TB-GC-QC-LDPC codes. The second method is based on designing the incidence matrix of a special type of packings. Examples show that the constructed TB-GC-QC-LDPC codes perform well over the additive white Gaussian noise channel (AWGNC) and the binary erasure channel (BEC). The asymptotic performance of TB-GC-LDPC ensembles over BECs are also analyzed by resorting to density evolution. Moreover, numerical results show that TB-GC-LDPC ensembles can achieve better flooding-schedule decoding (FSD) thresholds than the corresponding GC-LDPC ensembles with a similar structure. With sufficient decoding iterations in the global phase, the local/global two-phase iterative decoding (TPD) thresholds of the TB-GC-LDPC ensembles significantly outperform those of the corresponding GC-LDPC ensembles as well.Keywords
Funding Information
- National Natural Science Foundation of China (61771364, 61701368, 61801527)
- Key Research and Development Project of Guangdong Province (2018B010114001)
- Key Research and Development Project of Shaanxi Province (2018ZDCXL-GY-04-05)
- Xidian University (JB182001)
- Henan University of Science and Technology (2014QN030)
This publication has 28 references indexed in Scilit:
- LDPC Code Designs, Constructions, and Unification2016
- Time-Invariant Quasi-Cyclic Spatially Coupled LDPC Codes Based on PackingsIEEE Transactions on Communications, 2016
- Finite-Length Algebraic Spatially-Coupled Quasi-Cyclic LDPC CodesIEEE Journal on Selected Areas in Communications, 2015
- Spatially coupled sparse codes on graphs: theory and practiceIEEE Communications Magazine, 2014
- Low-Complexity Encoding of Quasi-Cyclic Codes Based on Galois Fourier TransformIEEE Transactions on Communications, 2014
- Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation MatricesIEEE Transactions on Information Theory, 2004
- Overlapped Message Passing for Quasi-Cyclic Low-Density Parity Check CodesIEEE Transactions on Circuits and Systems I: Regular Papers, 2004
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981
- ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNSAnnals of Eugenics, 1939