Structured non-binary LDPC codes with large girth

An LDPC code is called ultra-sparse if its parity-check matrix has uniform column weight 2. A class of non-binary ultra-sparse quasi-cyclic LDPC (UQ-LDPC) codes with girth 12 is constructed. These codes have simple structures and very fast encoding. With iterative decoding based on the belief propagation algorithm, simulation results show that the non-binary UQ-LDPC codes significantly outperform the non-binary ultra-sparse random LDPC codes with the same parameters in certain cases.

[1]  David J. C. MacKay,et al.  Low-density parity check codes over GF(q) , 1998, IEEE Communications Letters.

[2]  Shu Lin,et al.  Dispersed Reed-Solomon codes for iterative decoding and construction of q-ary LDPC codes , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[3]  Navin Kashyap,et al.  Shortened Array Codes of Large Girth , 2005, IEEE Transactions on Information Theory.

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

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

[6]  David Declercq,et al.  Decoding Algorithms for Nonbinary LDPC Codes Over GF$(q)$ , 2007, IEEE Transactions on Communications.