Construction of protographs for large-girth structured LDPC convolutional codes

In this paper, we present a method to construct girth-6 protographs that lead to the shortest constraint length in the convolutional structure. A stringent structural constraint is imposed on the protographs such that the decoder can be implemented efficiently. Then, given the structural constraint, it is shown that finding the aforementioned protographs is equivalent to solving a simple algebraic problem. Based on this mathematical formulation, girth-6 protographs are created without having to resort to a graph search. Using the girth-6 protographs, we derive good low-density parity-check (LDPC) convolutional codes by using periodic quasi-cyclic lifting. The performance of such constructed codes is compared with AR4JA-based LDPC convolutional codes.

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

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

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

[4]  M. E. O'Sullivan,et al.  Algebraic construction of sparse matrices with large girth , 2006, IEEE Transactions on Information Theory.

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

[6]  Gerhard Fettweis,et al.  Asymptotically regular LDPC codes with linear distance growth and thresholds close to capacity , 2010, 2010 Information Theory and Applications Workshop (ITA).

[7]  Laurent Schmalen,et al.  Status and Recent Advances on Forward Error Correction Technologies for Lightwave Systems , 2014, Journal of Lightwave Technology.

[8]  Marc P. C. Fossorier.  Quasicyclic low density parity check codes , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

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

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

[11]  Sarah J. Johnson,et al.  Memory Efficient Decoders using Spatially Coupled Quasi-Cyclic LDPC Codes , 2013, ArXiv.

[12]  Dariush Divsalar,et al.  Capacity-approaching protograph codes , 2009, IEEE Journal on Selected Areas in Communications.

[13]  Rudiger Urbanke,et al.  Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC , 2010, ISIT.

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

[15]  Daniel J. Costello,et al.  LDPC block and convolutional codes based on circulant matrices , 2004, IEEE Transactions on Information Theory.

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

[17]  David G. M. Mitchell,et al.  Quasi-cyclic LDPC codes based on pre-lifted protographs , 2011, ITW.

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

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

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

[21]  Laurent Schmalen,et al.  On the convergence speed of spatially coupled LDPC ensembles , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).