Windowed erasure decoding of LDPC Convolutional Codes

We consider windowed decoding of LDPC Convolutional Codes on the Binary Erasure Channel (BEC) to study the trade-off between the decoding latency and the code performance. We make some key observations about regular LDPC Convolutional code ensembles under windowed decoding and give modified constructions of these codes that allow us to efficiently trade-off performance for gains in latency.

[1]  Stefano Cioni,et al.  The very short frame of mobile DVB‐RCS: Code design and QoS Performance , 2010, Int. J. Satell. Commun. Netw..

[2]  Arvind Sridharan,et al.  Design and Analysis of LDPC Convolutional Codes , 2005 .

[3]  Marco Chiani,et al.  Protograph LDPC Codes Design Based on EXIT Analysis , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

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

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

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

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

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

[9]  Michael Lentmaier,et al.  Iterative Decoding Threshold Analysis for LDPC Convolutional Codes , 2010, IEEE Transactions on Information Theory.

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

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