Adaptive HARQ With Non-Binary Repetition Coding

We consider Incremental Redundancy Hybrid Automatic Repeat reQuest (IR-HARQ) in which the code rate and modulation of the initial transmission and all retransmissions are adjusted based on average channel statistics. In the absence of instantaneous channel state information at the transmitter (CSIT), we present a method which computes, prior to transmission, the optimum code rates and modulations and explicitly considers a given maximum number of retransmissions. For the case that additional feedback on CSI of previous transmission attempts is available, we present two heuristic schemes which exploit this knowledge and offer increased throughput at the cost of higher computational complexity. We employ a rate-adaptive non-binary LDPC coding scheme which makes use of non-binary repetitions. While this coding scheme is particularly well-suited for adaptive IR-HARQ, we note that the presented analysis can be applied to any other channel code which employs soft decoding.

[1]  David Declercq,et al.  Trellis-Based Extended Min-Sum Algorithm for Non-Binary LDPC Codes and its Hardware Structure , 2013, IEEE Transactions on Communications.

[2]  Stefan Parkvall,et al.  Adaptive Incremental Redundancy , 2003 .

[3]  Moshiur Rahman,et al.  Rate Allocation and Adaptation for Incremental Redundancy Truncated HARQ , 2013, IEEE Transactions on Communications.

[4]  David Declercq,et al.  Decoding Algorithms for Nonbinary LDPC Codes Over GF$(q)$ , 2007, IEEE Transactions on Communications.

[5]  Stephan Pfletschinger,et al.  Link Adaptation with Retransmissions for Partial Channel State Information , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[6]  John M. Cioffi,et al.  Delay-constrained capacity with causal feedback , 2002, IEEE Trans. Inf. Theory.

[7]  M. Sternad,et al.  Unbiased power prediction of Rayleigh fading channels , 2002, Proceedings IEEE 56th Vehicular Technology Conference.

[8]  Leszek Szczecinski,et al.  Rate-adaptive HARQ in relay-based cooperative transmission , 2013, 2013 IEEE International Conference on Communications (ICC).

[9]  Joachim Hagenauer,et al.  Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.

[10]  Lara Dolecek,et al.  Graph cover ensembles of non-binary protograph LDPC codes , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

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

[12]  Steven W. McLaughlin,et al.  Rate-compatible punctured low-density parity-check codes with short block lengths , 2006, IEEE Transactions on Information Theory.

[13]  Guosen Yue,et al.  Adaptive Hybrid ARQ in Gaussian and Turbo Coded Systems , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[14]  Jie Huang,et al.  Linear time encoding of cycle GF(2p) codes through graph analysis , 2006, IEEE Commun. Lett..

[15]  Vijay K. Bhargava,et al.  Joint Rate and Power Adaptation for Type-I Hybrid ARQ Systems Over Correlated Fading Channels Under Different Buffer-Cost Constraints , 2008, IEEE Transactions on Vehicular Technology.

[16]  David Declercq,et al.  Design of regular (2,d/sub c/)-LDPC codes over GF(q) using their binary images , 2008, IEEE Transactions on Communications.

[17]  David Declercq,et al.  Design of cages with a randomized progressive edge-growth algorithm , 2008, IEEE Communications Letters.

[18]  David Declercq,et al.  Fountain Coding via Multiplicatively Repeated Non-Binary LDPC Codes , 2012, IEEE Transactions on Communications.

[19]  Seong Hwan Kim,et al.  Low-Complexity Rate Selection of HARQ With Chase Combining in Rayleigh Block-Fading Channels , 2013, IEEE Transactions on Vehicular Technology.

[20]  Giuseppe Caire,et al.  Incremental redundancy hybrid ARQ schemes based on low-density parity-check codes , 2004, IEEE Transactions on Communications.

[21]  E. Boutillon,et al.  Simplified check node processing in nonbinary LDPC decoders , 2010, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing.

[22]  David Declercq,et al.  Performance Evaluation of Non-Binary LDPC Codes on Wireless Channels , 2009 .

[23]  Giuseppe Caire,et al.  Bit-Interleaved Coded Modulation , 2008, Found. Trends Commun. Inf. Theory.

[24]  David Burshtein,et al.  Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels , 2005, IEEE Transactions on Information Theory.

[25]  D. Mackay,et al.  Low density parity check codes over GF(q) , 1998, 1998 Information Theory Workshop (Cat. No.98EX131).

[26]  David Declercq,et al.  Non-binary coding for vector channels , 2011, 2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications.

[27]  Angeliki Alexiou,et al.  Link performance models for system level simulations of broadband radio access systems , 2005, 2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications.

[28]  Alexandra Duel-Hallen,et al.  Fading Channel Prediction for Mobile Radio Adaptive Transmission Systems , 2007, Proceedings of the IEEE.

[29]  Leszek Szczecinski,et al.  Variable-Rate Transmission for Incremental Redundancy Hybrid ARQ , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[30]  Dan Feng Zhao,et al.  Min-Max decoding for non binary LDPC codes , 2016 .

[31]  David Declercq,et al.  Multiplicatively Repeated Non-Binary LDPC Codes , 2010, ArXiv.

[32]  Tania Villa,et al.  Dynamic resource allocation for time-varying channels in next generation cellular networks : Part I: A mathematical framework , 2013 .

[33]  Jianhua Lu,et al.  Efficient encoding of cycle codes on graphs with large girths , 2008, 2008 International Conference on Communications, Circuits and Systems.

[34]  Marco Levorato,et al.  Analysis of Non-Cooperative and Cooperative Type II Hybrid ARQ Protocols with AMC over Correlated Fading Channels , 2011, IEEE Transactions on Wireless Communications.

[35]  Stephan Pfletschinger,et al.  Adaptive HARQ for imperfect channel knowledge , 2010, 2010 International ITG Conference on Source and Channel Coding (SCC).

[36]  David Declercq,et al.  Multi-relay cooperative NB-LDPC coding with non-binary repetition codes over block-fading channels , 2012, 2012 Proceedings of the 20th European Signal Processing Conference (EUSIPCO).

[37]  Michael L. Honig,et al.  Reliability-based incremental redundancy with convolutional codes , 2005, IEEE Transactions on Communications.

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

[39]  H. Vincent Poor,et al.  Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

[40]  Nihar Jindal,et al.  Performance of hybrid-ARQ in block-fading channels: A fixed outage probability analysis , 2010, IEEE Transactions on Communications.

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

[42]  Gianluigi Ferrari,et al.  Does the Performance of LDPC Codes Depend on the Channel? , 2006, IEEE Transactions on Communications.

[43]  N. J. A. Sloane,et al.  Tables of sphere packings and spherical codes , 1981, IEEE Trans. Inf. Theory.

[44]  Giuseppe Caire,et al.  The throughput of hybrid-ARQ protocols for the Gaussian collision channel , 2001, IEEE Trans. Inf. Theory.

[45]  Torbjörn Ekman.  Prediction of Mobile Radio Channels : Modeling and Design , 2002 .

[46]  Xavier Lagrange,et al.  Throughput of HARQ protocols on a block fading channel , 2010, IEEE Communications Letters.