Construction of QC-LDPC Codes Based on Pre-Masking and Local Optimal Searching

In this letter, we consider the construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes by jointly optimizing the girth g and the number of g-cycles. We first propose a sub-array detection method to accelerate the detection of cycles, and by detecting the non-repeated automatic enume...

Full description

Saved in:
Bibliographic Details
Published inIEEE communications letters Vol. 22; no. 6; pp. 1148 - 1151
Main Authors Wang, Dongdong, Wang, Liqian, Chen, Xue, Fei, Aimei, Ju, Chen, Wang, Zhirong
Format Journal Article
LanguageEnglish
Published IEEE 01.06.2018
Subjects
Acceleration
Algorithm design and analysis
Complexity theory
cycle detection
girth
Indexes
LDPC codes
masking
Null space
Parity check codes
quasi-cyclic (QC) LDPC codes
Simulation
Online AccessGet full text

Cover

More Information
Summary:In this letter, we consider the construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes by jointly optimizing the girth g and the number of g-cycles. We first propose a sub-array detection method to accelerate the detection of cycles, and by detecting the non-repeated automatic enumerative cycles in the frame of sub-arrays, cycle detection time can be greatly reduced. Furthermore, a local optimal searching algorithm combined with pre-masking is presented, by orderly searching the local optimal p j,l for each circulant permutation matrix (CPM), a class of QC-LDPC codes with possibly enlarged g, less number of g-cycles, and arbitrary attainable degree distribution could be constructed. Simulation results show that the codes constructed by the proposed method perform well in error floor region.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2017.2756640