We develop an information-theoretic model to explain and predict the coding gains of the incre- mental redundancy over the Chase combining scheme. From this analysis, we identify a new approach to im- prove the spectral efficiency of the conventional in- cremental redundancy scheme, which uses the same modulation and coding formats and, most notably, the same amounts of channel resources for retransmissions as those for the initial transmissions. Depending on the relative channel conditions between the transmissions, fewer incremental redundant bits than those employed in the first transmission might be enough to guaran- tee high probability of successful decoding. Hence, we propose a new scheme that adapts the modulation and coding formats according to simple feedback informa- tion to minimize unnecessary channel usage. Our sim- ulation results demonstrate system throughput gains up to 25% in certain conditions can be achieved by the proposed scheme without modifying the existing WCDMA specifications.
[1]
Shu Lin,et al.
Error control coding : fundamentals and applications
,
1983
.
[2]
Frank Kelly,et al.
Charging and rate control for elastic traffic
,
1997,
Eur. Trans. Telecommun..
[3]
Andrew J. Viterbi,et al.
Principles of Digital Communication and Coding
,
1979
.
[4]
Gregory E. Bottomley,et al.
A generalized RAKE receiver for interference suppression
,
2000,
IEEE Journal on Selected Areas in Communications.
[5]
Jung-Fu Cheng.
On the coding gain of incremental redundancy over chase combining
,
2003,
GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).
[6]
Shlomo Shamai,et al.
Information theoretic considerations for cellular mobile radio
,
1994
.
[7]
D. Chase.
A Combined Coding and Modulation Approach for Communication over Dispersive Channels
,
1973,
IEEE Trans. Commun..