We propose a systematic design of protograph-based quasi-cyclic (QC) low-density parity- check (LDPC) codes with low error floor. We first characterize the trapping sets of such …
X Tao, Y Li, Y Liu, Z Hu - IEEE Communications Letters, 2017 - ieeexplore.ieee.org
Low-density parity-check (LDPC) codes exhibit excellent error correcting capability. However, small trapping sets in the Tanner graph are harmful to the iterative decoding …
V Usatyuk, I Vorobyev - 2018 41st International Conference on …, 2018 - ieeexplore.ieee.org
We present a simulated annealing method that construct high-girth quasi-cyclic low-density parity check (QC-LDPC) codes. The proposed method is applicable to both regular and …
In this letter, for the first time, an edge-coloring technique is proposed to characterize a certain elementary trapping set (ETS) and to obtain sufficient conditions to avoid small ETSs …
X Liu, F Xiong, Z Wang, S Liang - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
Many studies were carried out for the construction of low density parity-check (LDPC) codes. They usually focused on introducing the construction methods for good LDPC codes instead …
In this paper, we give lower bounds on the size of (a, b) elementary trapping sets (ETSs) of variable-regular LDPC codes with any girth, g, and irregular ones with girth 8, where a is the …
X Tao, X Chen, B Wang - IEEE Communications Letters, 2022 - ieeexplore.ieee.org
Quasi-cyclic low-density parity-check (QC-LDPC) codes have efficient hardware implementation and excellent correcting performance. However, the existence of trapping …
Quasi-cyclic low-density (QC-LDPC) codes benefit from efficient encoding hardware and display excellent error correcting performance. Therefore, they have been accepted into the …