A II-HARQ scheme for BEC models with ML decoding of Turbo Codes

In this paper we propose a coding-decoding scheme to be used for II-type hybrid ARQ on a binary erasure channel model, based on rate compatible punctured binary Turbo Codes, DRP interleaver design and ML decoding at the receiver. We carefully design the interleaver and the puncturing mask, and we describe how to achieve low-complexity Maximum Likelihood decoding. We show for the case of an MPEG2 packet size that this scheme overrides random codes upper bounds, providing throughputs within 0.05 bits from capacity at word error rates greater or equal to 10-6.

[1]  Faramarz Fekri,et al.  On decoding of low-density parity-check codes over the binary erasure channel , 2004, IEEE Transactions on Information Theory.

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

[3]  K. K. Ramakrishnan,et al.  Hybrid Packet FEC and Retransmission-based Erasure Recovery Mechanisms for Lossy Networks: Analysis and Design , 2007, 2007 2nd International Conference on Communication Systems Software and Middleware.

[4]  Roberto Garello,et al.  Computing the free distance of turbo codes and serially concatenated codes with interleavers: algorithms and applications , 2001, IEEE J. Sel. Areas Commun..

[5]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[6]  Peter Kabal,et al.  Efficient distance measurement method for turbo codes that use structured interleavers , 2006, IEEE Communications Letters.

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

[8]  David Burshtein,et al.  Efficient maximum-likelihood decoding of LDPC codes over the binary erasure channel , 2004, IEEE Transactions on Information Theory.

[9]  Øyvind Ytrehus,et al.  Turbo Decoding on the Binary Erasure Channel: Finite-Length Analysis and Turbo Stopping Sets , 2006, IEEE Transactions on Information Theory.

[10]  Paul H. Siegel,et al.  Exact probability of erasure and a decoding algorithm for convolutional codes on the binary erasure channel , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[11]  Jung-Fu Cheng,et al.  Coding performance of hybrid ARQ schemes , 2006, IEEE Transactions on Communications.

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

[13]  Robert G. Gallager,et al.  A simple derivation of the coding theorem and some applications , 1965, IEEE Trans. Inf. Theory.

[14]  Paul Guinand,et al.  Distance upper bounds and true minimum distance results for turbo-codes designed with DRP interleavers , 2005, Ann. des Télécommunications.

[15]  Jing Cai,et al.  Analysis of the distribution of the number of erasures correctable by a binary linear code and the link to low-weight codewords , 2007, IET Commun..

[16]  Sandro Bellini,et al.  Rate Variable, Multi-Binary Turbo Codes with Controlled Error-Floor , 2009, IEEE Transactions on Communications.