Large Girth Column-Weight Two and Three LDPC Codes

In this paper, the concept of broken diagonal pair in the chess-like square board is used to define some well-structured block designs whose incidence matrices can be considered as the parity-check matrices of some high rate cycle codes with girth 12. Interestingly, the constructed regular cycle codes with row-weights t, 3 ≤ t ≤ 20, t ≠ 7, 15, 16, have the minimum lengths among the known regular girth-12 cycle codes. In addition, the proposed cycle codes can be easily extended to some high rate column weight-3 LDPC codes with girth 6. Simulation results show that the constructed non-binary cycle codes and binary QC LDPC codes have good performances over AWGN channel.

[1]  Michael Liebelt,et al.  High Girth Column-Weight-Two LDPC Codes Based on Distance Graphs , 2007, EURASIP J. Wirel. Commun. Netw..

[2]  Hongwei Song,et al.  Large girth cycle codes for partial response channels , 2004, IEEE Transactions on Magnetics.

[3]  Baoming Bai,et al.  Construction of nonbinary quasi-cyclic LDPC cycle codes based on singer perfect difference set , 2010, IEEE Communications Letters.

[4]  Dariush Divsalar,et al.  Low-rate LDPC codes with simple protograph structure , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

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

[6]  Mohammad Gholami,et al.  Column-Weight Three QC LDPC Codes with Girth 20 , 2013, IEEE Communications Letters.

[7]  David Declercq,et al.  Design of cages with a randomized progressive edge-growth algorithm , 2008, IEEE Communications Letters.

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

[9]  David Declercq,et al.  Design of regular (2,d/sub c/)-LDPC codes over GF(q) using their binary images , 2008, IEEE Transactions on Communications.

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

[11]  G. Exoo,et al.  Dynamic Cage Survey , 2011 .

[12]  Mohammad Gholami,et al.  Design of Binary and Nonbinary Codes from Lifting of Girth-8 Cycle Codes with Minimum Lengths , 2013, IEEE Communications Letters.

[13]  Marco Chiani,et al.  Short non-binary IRA codes on large-girth Hamiltonian graphs , 2012, 2012 IEEE International Conference on Communications (ICC).

[14]  M. Esmaeili,et al.  Structured quasi-cyclic LDPC codes with girth 18 and column-weight J⩾3 , 2010 .

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

[16]  Sunghwan Kim,et al.  Quasi-Cyclic Low-Density Parity-Check Codes With Girth Larger Than $12$ , 2007, IEEE Transactions on Information Theory.