Low-Density Parity-Check Code Constructions

Low-density parity-check (LDPC) codes are a class of linear block code capable of performing extremely close to the capacity of a channel as defined by Shannon. The purpose of this chapter is to provide an overview of the basic ideas, as well as the main results, in the field of LDPC code construction. No attempt could possibly be made to include every code design in the literature, but we describe the principal design ideas and the most prominent design families. The main theoretical tools for design are reviewed, as well as the LDPC code designs currently implemented in international telecommunications standards. Some detail and examples are given for the specific case of unstructured irregular LDPC codes, so that the reader may experiment with code design for this case without recourse to further material.

[1]  Amir H. Banihashemi,et al.  A PEG Construction of Finite-Length LDPC Codes with Low Error Floor , 2012, IEEE Communications Letters.

[2]  Alon Orlitsky,et al.  Stopping set distribution of LDPC code ensembles , 2003, IEEE Transactions on Information Theory.

[3]  Lara Dolecek,et al.  Asymptotic Distribution of Absorbing Sets and Fully Absorbing Sets for Regular Sparse Code Ensembles , 2011, IEEE Transactions on Communications.

[4]  William E. Ryan,et al.  Quasi-cyclic generalized ldpc codes with low error floors , 2007, IEEE Transactions on Communications.

[5]  Shashi Kiran Chilappagari,et al.  On the Construction of Structured LDPC Codes Free of Small Trapping Sets , 2012, IEEE Transactions on Information Theory.

[6]  Li Ping,et al.  Concatenated tree codes: A low-complexity, high-performance approach , 2001, IEEE Trans. Inf. Theory.

[7]  David Declercq,et al.  Weight Distributions of Non-binary LDPC Codes , 2011, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[8]  Stephan ten Brink,et al.  Extrinsic information transfer functions: model and erasure channel properties , 2004, IEEE Transactions on Information Theory.

[9]  Sarah J. Johnson,et al.  Combinatorial Interleavers for Systematic Regular Repeat-Accumulate Codes [Transactions Letters] , 2008, IEEE Transactions on Communications.

[10]  David G. M. Mitchell,et al.  Minimum Distance and Trapping Set Analysis of Protograph-Based LDPC Convolutional Codes , 2013, IEEE Transactions on Information Theory.

[11]  Marco Chiani,et al.  Simple reconfigurable low-density parity-check codes , 2005, IEEE Communications Letters.

[12]  Dariush Divsalar,et al.  Accumulate-Repeat-Accumulate Codes , 2007, IEEE Trans. Commun..

[13]  Zhiyong Fan,et al.  Construction of Quasi-Cyclic LDPC Codes and the Performance on the PR4-Equalized MRC Channel , 2009, IEEE Transactions on Magnetics.

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

[15]  David Declercq,et al.  Design of cages with a randomized progressive edge-growth algorithm , 2008, IEEE Communications Letters.

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

[17]  Michael Lentmaier,et al.  Implementation aspects of LDPC convolutional codes , 2008, IEEE Transactions on Communications.

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

[19]  C. K. Michael Tse,et al.  Constructing Short-Length Irregular LDPC Codes with Low Error Floor , 2010, IEEE Transactions on Communications.

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

[21]  Pak-Ken Wong,et al.  Cages - a survey , 1982, J. Graph Theory.

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

[23]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

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

[25]  Olgica Milenkovic,et al.  LDPC Codes Based on Latin Squares: Cycle Structure, Stopping Set, and Trapping Set Analysis , 2007, IEEE Transactions on Communications.

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

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

[28]  David J. C. MacKay,et al.  Good Codes Based on Very Sparse Matrices , 1995, IMACC.

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

[30]  Marco Chiani,et al.  Spectral Shape of Doubly-Generalized LDPC Codes: Efficient and Exact Evaluation , 2012, IEEE Transactions on Information Theory.

[31]  Lara Dolecek,et al.  Graph cover ensembles of non-binary protograph LDPC codes , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

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

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

[34]  Dariush Divsalar,et al.  Construction of Protograph LDPC Codes with Linear Minimum Distance , 2006, 2006 IEEE International Symposium on Information Theory.

[35]  Gerd Richter,et al.  On a Construction Method of Irregular LDPC Codes Without Small Stopping Sets , 2006, 2006 IEEE International Conference on Communications.

[36]  T. Richardson,et al.  Multi-Edge Type LDPC Codes , 2004 .

[37]  Naresh R. Shanbhag,et al.  High-throughput LDPC decoders , 2003, IEEE Trans. Very Large Scale Integr. Syst..

[38]  Nenad Miladinovic,et al.  Irregular LDPC codes as concatenation regular LDPC codes , 2005, IEEE Communications Letters.

[39]  Rodrigo C. de Lamare,et al.  Decoder-Optimised Progressive Edge Growth Algorithms for the Design of LDPC Codes with Low Error Floors , 2012, IEEE Communications Letters.

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

[41]  Dejan Vukobratovic,et al.  Generalized ACE Constrained Progressive Edge-Growth LDPC Code Design , 2008, IEEE Communications Letters.

[42]  Kamil Sh. Zigangirov,et al.  Time-varying periodic convolutional codes with low-density parity-check matrix , 1999, IEEE Trans. Inf. Theory.

[43]  Dariush Divsalar,et al.  Coding theorems for 'turbo-like' codes , 1998 .

[44]  Qin Huang,et al.  Quasi-Cyclic LDPC Codes: An Algebraic Construction, Rank Analysis, and Codes on Latin Squares , 2010, IEEE Transactions on Communications.

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

[46]  R. M. Tanner,et al.  A Class of Group-Structured LDPC Codes , 2001 .

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

[48]  Marco Chiani,et al.  Channel Coding for Future Space Missions: New Requirements and Trends , 2007, Proceedings of the IEEE.

[49]  Byung-Jae Kwak,et al.  LDPC Codes for the Gaussian Wiretap Channel , 2009, IEEE Transactions on Information Forensics and Security.

[50]  Gerhard Fettweis,et al.  Asymptotically good LDPC convolutional codes with AWGN channel thresholds close to the Shannon limit , 2010, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing.

[51]  Marco Chiani,et al.  Generalized IRA Erasure Correcting Codes for Hybrid Iterative/Maximum Likelihood Decoding , 2008, IEEE Communications Letters.

[52]  Marco Chiani,et al.  Maximum Likelihood Erasure Decoding of LDPC Codes: Pivoting Algorithms and Code Design , 2012, IEEE Transactions on Communications.

[53]  W. W. Peterson,et al.  Error-Correcting Codes. , 1962 .

[54]  Fan Zhang,et al.  List-Message Passing Achieves Capacity on the q-ary Symmetric Channel for Large q , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[55]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[56]  Stephen Bates,et al.  Construction of low-density parity-check convolutional codes through progressive edge-growth , 2005, IEEE Communications Letters.

[57]  Zongwang Li,et al.  A class of good quasi-cyclic low-density parity check codes based on progressive edge growth graph , 2004, Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004..

[58]  Paul H. Siegel,et al.  Windowed Decoding of Protograph-Based LDPC Convolutional Codes Over Erasure Channels , 2010, IEEE Transactions on Information Theory.

[59]  Rüdiger L. Urbanke,et al.  Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC , 2010, IEEE Transactions on Information Theory.

[60]  D. Saad,et al.  Error-correcting codes that nearly saturate Shannon's bound , 1999, cond-mat/9906011.

[61]  Amin Shokrollahi,et al.  New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity , 1999, AAECC.

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

[63]  Tomaso de Cola,et al.  Reliability Options for Data Communications in the Future Deep-Space Missions , 2011, Proceedings of the IEEE.

[64]  Dariush Divsalar,et al.  Ensemble Weight Enumerators for Protograph LDPC Codes , 2006, 2006 IEEE International Symposium on Information Theory.

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

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

[67]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[68]  Dejan Vukobratovic,et al.  Transactions papers evaluation and design of irregular LDPC codes using ACE spectrum , 2009, IEEE Transactions on Communications.

[69]  Dariush Divsalar,et al.  The Development of Turbo and LDPC Codes for Deep-Space Applications , 2007, Proceedings of the IEEE.

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

[71]  Marco Chiani,et al.  Short Turbo Codes over High Order Fields , 2013, IEEE Transactions on Communications.

[72]  Yifei Zhang,et al.  Structured IRA Codes: Performance Analysis and Construction , 2007, IEEE Transactions on Communications.

[73]  Marco Chiani,et al.  On the Growth Rate of the Weight Distribution of Irregular Doubly Generalized LDPC Codes , 2008, IEEE Transactions on Information Theory.

[74]  Rüdiger L. Urbanke,et al.  Weight Distribution of Low-Density Parity-Check Codes , 2006, IEEE Transactions on Information Theory.

[75]  David Declercq,et al.  Weight distributions of multi-edge type LDPC codes , 2009, ISIT.

[76]  Shengli Zhou,et al.  Structure, property, and design of nonbinary regular cycle codes , 2010, IEEE Transactions on Communications.

[77]  H. Jin,et al.  Irregular repeat accumulate codes , 2000 .

[78]  Qin Huang,et al.  Quasi-cyclic LDPC codes: an algebraic construction , 2010, IEEE Transactions on Communications.

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

[80]  Ieee Microwave Theory,et al.  Part 16: Air Interface for Fixed and Mobile Broadband Wireless Access Systems — Amendment for Physical and Medium Access Control Layers for Combined Fixed and Mobile Operation in Licensed Bands , 2003 .

[81]  J. Yedidia,et al.  Construction of high-girth QC-LDPC codes , 2008, 2008 5th International Symposium on Turbo Codes and Related Topics.

[82]  Achilleas Anastasopoulos,et al.  Asymptotic weight distributions of irregular repeat-accumulate codes , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[83]  Marco Baldi,et al.  Interleaved Product LDPC Codes , 2011, IEEE Transactions on Communications.

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

[85]  Emina Soljanin,et al.  Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles , 2007, IEEE Transactions on Information Theory.

[86]  Sae-Young Chung,et al.  Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation , 2001, IEEE Trans. Inf. Theory.

[87]  Simon Litsyn,et al.  Constructing LDPC codes by error minimization progressive edge growth , 2008, IEEE Transactions on Communications.

[88]  R. Storn,et al.  Design of efficient erasure codes with differential evolution , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[89]  Dariush Divsalar,et al.  Protograph based LDPC codes with minimum distance linearly growing with block size , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[90]  William E. Ryan,et al.  Enumerators for Protograph-Based Ensembles of LDPC and Generalized LDPC Codes , 2011, IEEE Transactions on Information Theory.

[91]  P. Vontobel,et al.  Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes , 2005, ArXiv.