Quasi-Cyclic Representation and Vector Representation of RS-LDPC Codes

RS-LDPC codes, constructed based on the codewords of Reed-Solomon (RS) codes with two information symbols, are an important class of LDPC codes. In this paper, we present two representations, namely, quasi-cyclic (QC) representation and vector representation, for RS-LDPC codes. Under the first representation, most part of the parity-check matrix of a full-length RS-LDPC code consists of circulant permutation matrices and zero matrices. As a result, the class of codes can enjoy the advantages in hardware implementation as QC-LDPC codes. In addition, the base matrix under the QC representation of an RS-LDPC code can be explicitly given such that the rank of its parity-check matrix can be analyzed combinatorially. Under the second representation, each permutation matrix in the parity-check matrix of an RS-LDPC code is defined by a nonbinary vector, whose entries are a permutation of entries in the field from which the RS code is constructed. Then, the “affine invariance” property is proved for full-length RS-LDPC codes, which can facilitate the structural analysis of the codes.

[1]  Martin Bossert,et al.  On the rank of LDPC matrices constructed by Vandermonde matrices and RS codes , 2006, 2006 IEEE International Symposium on Information Theory.

[2]  Keshab K. Parhi,et al.  Low-Complexity Switch Network for Reconfigurable LDPC Decoders , 2010, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

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

[4]  Yifei Zhang,et al.  Design of LDPC Codes: A Survey and New Results , 2017 .

[5]  Haiyang Liu,et al.  On the Number of Minimum Stopping Sets and Minimum Codewords of Array LDPC Codes , 2010, IEEE Communications Letters.

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

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

[8]  Keshab K. Parhi,et al.  A Low-Complexity Hybrid LDPC Code Encoder for IEEE 802.3an (10GBase-T) Ethernet , 2009, IEEE Transactions on Signal Processing.

[9]  Zixiang Xiong,et al.  Low-Complexity Encoding of Quasi-Cyclic Codes Based on Galois Fourier Transform , 2013, IEEE Transactions on Communications.

[10]  R. M. Tanner.  On Quasi-Cyclic Repeat-Accumulate Codes , 2000 .

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

[12]  Shuai Zhang,et al.  On the dynamics of the error floor behavior in regular LDPC codes , 2009 .

[13]  Shu Lin,et al.  A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols , 2003, IEEE Communications Letters.

[14]  Shuai Zhang,et al.  Controlling the Error Floor in LDPC Decoding , 2012, IEEE Transactions on Communications.

[15]  Nirwan Ansari,et al.  Efficient and reliable link state information dissemination , 2004, IEEE Communications Letters.

[16]  R. Blahut.  Algebraic Codes for Data Transmission , 2002 .

[17]  Tor Helleseth,et al.  On the minimum distance of array codes as LDPC codes , 2003, IEEE Trans. Inf. Theory.

[18]  Zixiang Xiong,et al.  Low-complexity encoding of binary quasi-cyclic codes based on Galois Fourier transform , 2013, 2013 IEEE International Symposium on Information Theory.

[19]  Zongwang Li,et al.  Efficient encoding of quasi-cyclic low-density parity-check codes , 2006, IEEE Trans. Commun..

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

[21]  Shu Lin,et al.  Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach , 2007, IEEE Transactions on Information Theory.

[22]  Sae-Young Chung,et al.  On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit , 2001, IEEE Communications Letters.

[23]  Morteza Esmaeili,et al.  On the Stopping Distance of Array Code Parity-Check Matrices , 2009, IEEE Transactions on Information Theory.

[24]  Qiuju Diao,et al.  A matrix-theoretic approach for analyzing quasi-cyclic low-density parity-check codes , 2012, IEEE Transactions on Information Theory.