Quasi-cyclic low-density parity-check codes based on finite set systems

A finite set system (FSS) is a pair (V, ℬ) where V is a finite set whose members are called points, equipped with a finite collection of its subsets ℬ whose members are called blocks. In this paper, FSSs are used to define a class of quasi-cyclic low-density parity-check (LDPC) codes, called FSS codes, such that the constructed codes possess large girth and arbitrary column-weight distributions. Especially, the constructed column weight-2 FSS codes have higher rates than the column weight-2 geometric and cylinder-type codes with the same girths. To find the maximum girth of FSS codes based on (V, ℬ), inevitable walks are defined in ℬ such that the maximum girth is determined by the smallest length of the inevitable walks in ℬ. Simulation results show that the constructed FSS codes have very good performance over the additive white Gaussian noise channel with iterative decoding and achieve significantly large coding gains compared with the random-like LDPC codes of the same lengths and rates.

[1]  John L. Fan,et al.  Array Codes as LDPC Codes , 2001 .

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

[3]  Mehdi Gholami,et al.  Maximum-girth slope-based quasi-cyclic (2, k ≥ 5) low-density parity-check codes , 2008, IET Commun..

[4]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[5]  Mehdi Gholami,et al.  Maximum-Girth Cylinder-Type Block-Circulant LDPC Codes , 2012, IEEE Transactions on Communications.

[6]  Sheng Chen,et al.  Design of Low-Density Parity-Check Codes , 2011, IEEE Vehicular Technology Magazine.

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

[8]  Mehdi Gholami,et al.  Geometrically-structured maximum-girth LDPC block and convolutional codes , 2009, IEEE Journal on Selected Areas in Communications.

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

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

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

[12]  Sarah J. Johnson,et al.  A family of irregular LDPC codes with low encoding complexity , 2003, IEEE Communications Letters.

[13]  Bane V. Vasic,et al.  Combinatorial constructions of low-density parity-check codes for iterative decoding , 2002, IEEE Transactions on Information Theory.

[14]  Tao Xia,et al.  Quasi-cyclic codes from extended difference families , 2005, IEEE Wireless Communications and Networking Conference, 2005.

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

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

[17]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

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

[19]  Emre Telatar,et al.  Finite-length analysis of low-density parity-check codes on the binary erasure channel , 2002, IEEE Trans. Inf. Theory.

[20]  N. Aydin,et al.  LDPC Codes of Arbitrary Girth , 2007, 2007 10th Canadian Workshop on Information Theory (CWIT).

[21]  Lajos Hanzo,et al.  Design of low-density parity-check codes: An overview , 2011 .

[22]  Thomas J. Richardson,et al.  Error Floors of LDPC Codes , 2003 .

[23]  J.M.F. Moura,et al.  Structured LDPC codes for high-density recording: large girth and low error floor , 2006, IEEE Transactions on Magnetics.

[24]  J. Thorpe.  Low-Density Parity-Check (LDPC) Codes Constructed from Protographs , 2003 .

[25]  X. Jin.  Factor graphs and the Sum-Product Algorithm , 2002 .

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

[27]  Mikael Skoglund,et al.  Diversity–Multiplexing Tradeoff in MIMO Channels With Partial CSIT , 2007, IEEE Transactions on Information Theory.

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

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

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