Multilevel-Structured Low-Density Parity-Check Codes for AWGN and Rayleigh Channels

We propose a novel class of protograph low-density parity-check (LDPC) codes having a combinatorial rather than a random structure, which are termed multilevel-structured (MLS) LDPC codes. It is demonstrated that they posses a strikingly simple structure and, thus, benefit from reduced storage requirements, hardware-friendly implementations, and low-complexity encoding. Our simulation results provided for both additive white Gaussian noise (AWGN) and uncorrelated Rayleigh (UR) channels demonstrate that these advantages accrue without compromising the attainable bit error ratio (BER) and block error ratio (BLER) performance, when compared with their previously proposed more complex random-construction-based counterparts, as well as with other structured codes of the same length.

[1]  Richard D. Wesel,et al.  Construction of irregular LDPC codes with low error floors , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[2]  Bane V. Vasic.  High-rate low-density parity check codes based on anti-Pasch affine geometries , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[3]  Dharmendra S. Modha,et al.  Extended bit-filling and LDPC code design , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[4]  Lajos Hanzo,et al.  Construction of Regular Quasi-Cyclic Protograph LDPC codes based on Vandermonde Matrices , 2008, 2008 IEEE 68th Vehicular Technology Conference.

[5]  Manabu Hagiwara,et al.  Quasicyclic low-density parity-check codes from circulant permutation matrices , 2009, IEEE Transactions on Information Theory.

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

[7]  Daniel A. Spielman,et al.  Improved low-density parity-check codes using irregular graphs and belief propagation , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[8]  David J. C. MacKay,et al.  Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.

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

[10]  Lajos Hanzo,et al.  Low-Density Parity-Check Codes and Their Rateless Relatives , 2011, IEEE Communications Surveys & Tutorials.

[11]  G. Mullen,et al.  Discrete Mathematics Using Latin Squares , 1998, The Mathematical Gazette.

[12]  Bahram Honary,et al.  Construction of low-density parity-check codes based on balanced incomplete block designs , 2004, IEEE Transactions on Information Theory.

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

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

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

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

[17]  Daniel A. Spielman,et al.  Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.

[18]  Sarah J. Johnson,et al.  Regular low-density parity-check codes from combinatorial designs , 2001, Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494).

[19]  Kenneth A. Ross,et al.  Discrete mathematics (2nd ed.) , 1988 .

[20]  Shu Lin,et al.  Near-Shannon-limit quasi-cyclic low-density parity-check codes , 2003, IEEE Transactions on Communications.

[21]  Samuel Dolinar,et al.  A scalable architecture of a structured LDPC decoder , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[22]  Richard D. Wesel,et al.  Selective avoidance of cycles in irregular LDPC code construction , 2004, IEEE Transactions on Communications.

[23]  R. A. Bailey.  Association Schemes: Designed Experiments, Algebra and Combinatorics , 2004 .

[24]  Richard Johnsonbaugh,et al.  Discrete mathematics (2nd ed.) , 1990 .

[25]  Shu Lin,et al.  Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.

[26]  Bane V. Vasic,et al.  Structured iteratively decodable codes based on Steiner systems and their application in magnetic recording , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[27]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[28]  Hideki Imai,et al.  A new multilevel coding method using error-correcting codes , 1977, IEEE Trans. Inf. Theory.

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

[30]  H. Mattson,et al.  The mathematical theory of coding , 1976, Proceedings of the IEEE.

[31]  Lajos Hanzo,et al.  Channel Code-Division Multiple Access and Its Multilevel-Structured LDPC-Based Instantiation , 2009 .

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

[33]  Hua Xiao,et al.  Improved progressive-edge-growth (PEG) construction of irregular LDPC codes , 2004, IEEE Communications Letters.

[34]  C. Colbourn,et al.  CRC Handbook of Combinatorial Designs , 1996 .

[35]  Lajos Hanzo,et al.  Channel Code-Division Multiple Access and Its Multilevel-Structured LDPC-Based Instantiation , 2008, IEEE Transactions on Vehicular Technology.

[36]  Brendan D. McKay,et al.  Latin Squares of Order 10 , 1995, Electron. J. Comb..

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

[38]  Wuyang Zhou,et al.  Girth-10 LDPC Codes Based on 3-D Cyclic Lattices , 2008, IEEE Transactions on Vehicular Technology.