QC-LDPC Codes with Girth Eight Based on Independent Row-Column Mapping Sequence

Quasi-cyclic low-density parity-check (QC-LDPC) codes are known to have algebraic structure, which suits hardware implementation. However, low girth makes their performances worse than random structured LDPC codes. Based on independent row-column mapping sequence, this work proposed a generalized method of constructing QC-LDPC codes with girth eight, which enlarges the class of girth eight QC-LDPC codes to a fairly general series. Simulation results show that the bit error rate of the constructed codes is close to that of progressive edge growth (PEG) based QC-LDPC codes under iterative decoding.

[1]  Xinmei Wang,et al.  Several Explicit Constructions for (3,L) QC-LDPC Codes with Girth at Least Eight , 2013, IEEE Communications Letters.

[2]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[3]  Xinmei Wang,et al.  Construction of Girth-Eight QC-LDPC Codes from Greatest Common Divisor , 2013, IEEE Communications Letters.

[4]  D.J.C. MacKay,et al.  Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.

[5]  Evangelos Eleftheriou,et al.  Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.

[6]  Daniel J. Costello,et al.  LDPC block and convolutional codes based on circulant matrices , 2004, IEEE Transactions on Information Theory.

[7]  Jung-Fu Cheng,et al.  Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm , 1998, IEEE J. Sel. Areas Commun..

[8]  Zongwang Li,et al.  A class of good quasi-cyclic low-density parity check codes based on progressive edge growth graph , 2004, Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004..

[9]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[10]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[11]  Manabu Hagiwara,et al.  Comment on "Quasi-Cyclic Low Density Parity Check Codes From Circulant Permutation Matrices" , 2009, IEEE Trans. Inf. Theory.