Coding performance of hybrid ARQ schemes

被引:112
作者
Cheng, Jung-Fu [1 ]
机构
[1] Ericsson Inc, Res Triangle Pk, NC 27709 USA
关键词
block fading channels; channel coding; hybrid automatic repeat request (HARQ); turbo codes; woreless communication systems;
D O I
10.1109/TCOMM.2006.876846
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We develop a unified performance metric and detailed analysis for hybrid automatic repeat request (HARQ) schemes based on incremental redundancy (IR) and Chase combining (CC). The general result is applicable to both symbol-based and bit-interleaved coded modulations, to HARQ processes based on rateless and fixed-rate mother codes, and IR schemes with and without a self-decodability restriction. The analysis shows that IR over CC coding gains tend to increase with the initial coding rate, but decrease with the signal-to-noise (SNR) variation between, retransmissions. The gains can also be diminished when a fixed-rate mother code is used or when the self-decodability criterion is imposed. The theoretical prediction is compared with observed gains at 10% codeword error rates based on turbo-coding simulations. For scenarios with moderately varying SNR between retransmissions, the analytical model tracks actual simulation results very well. However, when the SNR varies widely and the systematic part of the turbo codeword is effectively erased, the CC scheme could, in fact, outperform some IR schemes. For these scenarios, which can be induced by fast time-varying fading or long retransmission delays, the self-decodable IR and the CC schemes prove to be more robust without much performance comprise. Finally, we discuss adaptive improvement to the conventional schemes based on the. analytical result.
引用
收藏
页码:1017 / 1029
页数:13
相关论文
共 32 条
[1]   OPTIMAL DECODING OF LINEAR CODES FOR MINIMIZING SYMBOL ERROR RATE [J].
BAHL, LR ;
COCKE, J ;
JELINEK, F ;
RAVIV, J .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (02) :284-287
[2]   A search for good convolutional codes to be used in the construction of turbo codes [J].
Benedetto, S ;
Garello, R ;
Montorsi, G .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1998, 46 (09) :1101-1105
[3]   Unveiling turbo codes: Some results on parallel concatenated coding schemes [J].
Benedetto, S ;
Montorsi, G .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (02) :409-428
[4]  
BERROU C, 1993, IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS 93 : TECHNICAL PROGRAM, CONFERENCE RECORD, VOLS 1-3, P1064, DOI 10.1109/ICC.1993.397441
[5]   A generalized RAKE receiver for interference suppression [J].
Bottomley, GE ;
Ottosson, T ;
Wang, YPE .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2000, 18 (08) :1536-1545
[6]   ERROR CONTROL TECHNIQUES USING BINARY SYMBOL BURST CODES [J].
BRAYER, K .
IEEE TRANSACTIONS ON COMMUNICATION TECHNOLOGY, 1968, CO16 (02) :199-&
[7]   Bit-interleaved coded modulation [J].
Caire, G ;
Taricco, G ;
Biglieri, E .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (03) :927-946
[8]   COMBINED CODING AND MODULATION APPROACH FOR COMMUNICATION OVER DISPERSIVE CHANNELS [J].
CHASE, D .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1973, CO21 (03) :159-174
[9]  
Cheng JF, 2005, IEEE VTS VEH TECHNOL, P1950
[10]  
Cheng JF, 2004, 2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, P319