Constructing LDPC Codes from Partition and Latin-Style Splicing

A novel method guaranteeing nondecreasing girth is presented for constructing longer low-density parity-check (LDPC) codes from shorter ones. The parity-check matrix of a shorter base code is decomposed into N (N>=2) non-overlapping components with the same size. Then, these components are combined together to form the parity-check matrix of a longer code, according to a given N*N Latin square. To illustrate this method, longer quasi-cyclic (QC) LDPC codes are obtained with girth at least eight and satisfactory performance, via shorter QC-LDPC codes with girth eight but poor performance. The proposed method naturally includes several well-known methods as special cases, but is much more general compared with these existing approaches.

[1]  Yang Yang,et al.  Explicit constructions for type-1 QC-LDPC codes with girth at least ten , 2014, 2014 IEEE Information Theory Workshop (ITW 2014).

[2]  Michael Lentmaier,et al.  Spatially Coupled LDPC Codes Constructed From Protographs , 2014, IEEE Transactions on Information Theory.

[3]  Guohua Zhang,et al.  Type-II quasi-cyclic low-density parity-check codes from Sidon sequences , 2016 .

[4]  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..

[5]  Khaled A. S. Abdel-Ghaffar,et al.  Algebraic construction of quasi-cyclic LDPC codes for the AWGN and erasure channels , 2006, IEEE Transactions on Communications.

[6]  Tsuyoshi Murata,et al.  {m , 1934, ACML.

[7]  Mohammad Gholami,et al.  On the girth of Tanner (3,7) quasi-cyclic LDPC codes , 2012 .

[8]  Sunghwan Kim,et al.  On the girth of tanner (3, 5) quasi-cyclic LDPC codes , 2006, IEEE Transactions on Information Theory.

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

[10]  Shu Lin,et al.  Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.

[11]  Jen-Fa Huang,et al.  Construction of quasi-cyclic LDPC codes from quadratic congruences , 2008, IEEE Communications Letters.

[12]  Rudolf Mathar,et al.  Explicit Constructions for Type-1 QC-LDPC Codes With Girth 12 , 2017, IEEE Communications Letters.

[13]  Kyeongcheol Yang,et al.  A combining method of quasi-cyclic LDPC codes by the Chinese remainder theorem , 2005, IEEE Communications Letters.