Protograph-Based LDPC Convolutional Codes for Correlated Erasure Channels

We consider terminated LDPC convolutional codes (LDPC-CC) constructed from protographs and explore the performance of these codes on correlated erasure channels including a single-burst channel (SBC) and Gilbert-Elliott channel (GEC). We consider code performance with a latency- constrained message passing decoder and the belief propagation decoder. We give theoretical bounds on the code efficiency over the SBC and describe a construction that achieves this bound.We show that the designed codes with belief propagation (BP) decoding perform as well as the regular LDPC-CCs presented in the literature on the binary erasure channel (BEC) and the GEC, while achieving significant gains on the SBC. In the case of windowed decoding, our codes perform much better than the best known regular LDPC-CCs over the BEC and the GEC, with very low decoding latencies.

[1]  Marco Chiani,et al.  Construction of Near-Optimum Burst Erasure Correcting Low-Density Parity-Check Codes , 2008, IEEE Transactions on Communications.

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

[3]  D. Costello,et al.  Approaching capacity with asymptotically regular LDPC codes , 2009, 2009 Information Theory and Applications Workshop.

[4]  Michael Lentmaier,et al.  Distance Bounds for an Ensemble of LDPC Convolutional Codes , 2007, IEEE Transactions on Information Theory.

[5]  Aravind R. Iyengar,et al.  Windowed erasure decoding of LDPC Convolutional Codes , 2010, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[6]  Sarah J. Johnson.  Burst erasure correcting LDPC codes , 2009, IEEE Transactions on Communications.

[7]  Laurence B. Milstein,et al.  On the effect of imperfect interleaving for the Gilbert-Elliott channel , 1999, IEEE Trans. Commun..

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

[9]  William E. Ryan,et al.  Design of LDPC codes for two-state fading channel models , 2002, The 5th International Symposium on Wireless Personal Multimedia Communications.

[10]  E. O. Elliott.  Estimates of error rates for codes on burst-noise channels , 1963 .

[11]  E. Gilbert.  Capacity of a burst-noise channel , 1960 .

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

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

[14]  Giovanni Emanuele Corazza,et al.  Packet Coding Performance with Correlated Fading and Shadowing , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[15]  Marco Chiani,et al.  On Construction of Moderate-Length LDPC Codes over Correlated Erasure Channels , 2009, 2009 IEEE International Conference on Communications.

[16]  Dariush Divsalar,et al.  Design of Low-Density Parity-Check (LDPC) Codes for Deep-Space Applications , 2004 .