High-performance binary and non-binary Low-density parity-check codes based on affine permutation matrices

Low-density parity-check (LDPC) codes from affine permutation matrices, called APM-LDPC codes, are a class of LDPC codes whose parity-check matrices consist of zero matrices or APMs of the same orders. APM-LDPC codes are not quasi-cyclic (QC), in general. In this study, necessary and sufficient conditions are provided for an APM-LDPC code to have cycles of length 2l, l ≥ 2, and a deterministic algorithm is given to generate APM-LDPC codes with a given girth. Unlike Type-I conventional QC-LDPC codes, the constructed (J, L) APM-LDPC codes with the J × L all-one base matrix can achieve minimum distance greater than (J + 1)! and girth larger than 12. Moreover, the lengths of the constructed APM-LDPC codes, in some cases, are smaller than the best known lengths reported for QC-LDPC codes with the same base matrices. Another significant advantage of the constructed APM-LDPC codes is that they have remarkably fewer cycle multiplicities compared with QC-LDPC codes with the same base matrices and the same lengths. Simulation results show that the binary and non-binary constructed APM-LDPC codes with lower girth outperform QC-LDPC codes with larger girth.

[1]  Mohammad Gholami,et al.  Large Girth Column-Weight Two and Three LDPC Codes , 2014, IEEE Communications Letters.

[2]  Ali Emre Pusane,et al.  Deriving Good LDPC Convolutional Codes from LDPC Block Codes , 2010, IEEE Transactions on Information Theory.

[3]  Norifumi Kamiya,et al.  High-Rate Quasi-Cyclic Low-Density Parity-Check Codes Derived From Finite Affine Planes , 2005, IEEE Transactions on Information Theory.

[4]  M. E. O'Sullivan,et al.  Algebraic construction of sparse matrices with large girth , 2006, IEEE Transactions on Information Theory.

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

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

[7]  Shu Lin,et al.  Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking , 2007, IEEE Transactions on Information Theory.

[8]  Roxana Smarandache,et al.  Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds , 2009, IEEE Transactions on Information Theory.

[9]  Marco Baldi,et al.  On a Family of Circulant Matrices for Quasi-Cyclic Low-Density Generator Matrix Codes , 2011, IEEE Transactions on Information Theory.

[10]  Amir H. Banihashemi,et al.  On the girth of quasi cyclic protograph LDPC codes , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

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

[12]  Marc P. C. Fossorier,et al.  Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices , 2004, IEEE Trans. Inf. Theory.

[13]  Stark C. Draper,et al.  Hierarchical and High-Girth QC LDPC Codes , 2011, IEEE Transactions on Information Theory.

[14]  D. Mackay,et al.  Low density parity check codes over GF(q) , 1998, 1998 Information Theory Workshop (Cat. No.98EX131).

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

[16]  Florian Hug,et al.  Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large Girth , 2011, IEEE Transactions on Information Theory.

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

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

[19]  Wuyang Zhou,et al.  Large-Girth Nonbinary QC-LDPC Codes of Various Lengths , 2010, IEEE Transactions on Communications.

[20]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[21]  Reza Sobhani,et al.  Approach to the construction of regular low-density parity-check codes from group permutation matrices , 2012, IET Commun..

[22]  Evangelos Eleftheriou,et al.  Binary representation of cycle Tanner-graph GF(2/sup b/) codes , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[23]  Keith M. Chugg,et al.  An algorithm for counting short cycles in bipartite graphs , 2006, IEEE Transactions on Information Theory.

[24]  Shashi Kiran Chilappagari,et al.  Structured LDPC codes from permutation matrices free of small trapping sets , 2010, 2010 IEEE Information Theory Workshop.

[25]  Kyeongcheol Yang,et al.  A Combining Method of Structured LDPC Codes from Affine Permutation Matrices , 2006, 2006 IEEE International Symposium on Information Theory.

[26]  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).

[27]  Qin Huang,et al.  Constructions of high performance non-binary quasi-cyclic LDPC codes , 2008, 2008 IEEE Information Theory Workshop.

[28]  L. Goldberg.  Abstract , 2003 .

[29]  Mohammad Gholami,et al.  Quasi-cyclic low-density parity-check codes based on finite set systems , 2014, IET Commun..