Rate-compatible LDPC convolutional codes for capacity-approaching hybrid ARQ

In this paper we construct a family of rate-compatible LDPC convolutional codes for Type-II HARQ systems. For each code family, the codes of lower rates are constructed by successively extending the graph of the high-rate base code. Theoretically, the proposed rate-compatible family includes all rates from 0 to 1. We prove analytically that all LDPC convolutional codes in the family are capacity achieving over the binary erasure channel (BEC). Thus, if applied to an idealized HARQ system over the BEC where the channel parameter stays constant within one complete information delivery, the throughput achieves the capacity of the channel. Moreover, the code construction is realized by regular degree distributions, which greatly simplifies the optimization.

[1]  Joachim Hagenauer,et al.  Rate-compatible punctured convolutional codes (RCPC codes) and their applications , 1988, IEEE Trans. Commun..

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

[3]  Steven W. McLaughlin,et al.  Rate-compatible puncturing of low-density parity-check codes , 2004, IEEE Transactions on Information Theory.

[4]  Samuel Dolinar A rate-compatible family of protograph-based LDPC codes built by expurgation and lengthening , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[5]  Achilleas Anastasopoulos,et al.  Capacity achieving LDPC codes through puncturing , 2005, 2005 International Conference on Wireless Networks, Communications and Mobile Computing.

[6]  Guosen Yue,et al.  Design of Rate-Compatible IRA Codes for Capacity-Approaching with Hybrid ARQ , 2006, 2006 IEEE International Symposium on Information Theory.

[7]  Jaehong Kim,et al.  Design of Rate-Compatible Irregular LDPC Codes for Incremental Redundancy Hybrid ARQ Systems , 2006, 2006 IEEE International Symposium on Information Theory.

[8]  Robert Soni,et al.  Design of Rate-Compatible Irregular LDPC Codes Based on Edge Growth and Parity Splitting , 2007, 2007 IEEE 66th Vehicular Technology Conference.

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

[10]  Jilei Hou,et al.  Design of rate-compatible structured LDPC codes for hybrid ARQ applications , 2009, IEEE Journal on Selected Areas in Communications.

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

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

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

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

[15]  Aria Nosratinia,et al.  The design of rate-compatible protograph LDPC codes , 2010 .