On reducing the rate of retransmission in time-varying channels

For data communications in time-varying channels such as wireless channels, the dynamic channel fluctuations often cause high frame-error rates. When the link layer detects that a frame is in error, conventionally, the frame is dropped and retransmission of the frame is requested. Based on the fact that the erroneous frames still contain useful information, several schemes have been proposed, such as packet combining and incremental redundancy, which retain and utilize the erroneous frames to improve retransmission performance. In this paper, we address two questions: 1) how much information is still useful in the erroneous frame; and 2) how to design a retransmission scheme to make efficient use of such information. We model this scenario (retransmission with an erroneous frame available at the receiver) as communication with side information at the receiver, and for a class of time-varying channels, the compound block interference channels, we derive with information-theoretic arguments the minimum information rate sufficient for retransmission to recover the erroneous frame. Motivated by the theoretical results, we propose an embedded channel coding/modulation structure together with a rate-adaptive retransmission scheme. Performance results indicate significant improvements over existing retransmission schemes in both additive white Gaussian noise and quasi-static Rayleigh fading channels.

[1]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .

[2]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[3]  Andrew J. Viterbi,et al.  Principles of Digital Communication and Coding , 1979 .

[4]  Shlomo Shamai,et al.  Fading Channels: Information-Theoretic and Communication Aspects , 1998, IEEE Trans. Inf. Theory.

[5]  Shlomo Shamai,et al.  Capacity of channels with uncoded side information , 1995, Eur. Trans. Telecommun..

[6]  David Chase,et al.  Code Combining - A Maximum-Likelihood Decoding Approach for Combining an Arbitrary Number of Noisy Packets , 1985, IEEE Transactions on Communications.

[7]  Wayne E. Stark,et al.  Channels with block interference , 1984, IEEE Trans. Inf. Theory.

[8]  Samir Kallel,et al.  Complementary punctured convolutional (CPC) codes and their applications , 1995, IEEE Trans. Commun..

[9]  Gottfried Ungerboeck,et al.  Channel coding with multilevel/phase signals , 1982, IEEE Trans. Inf. Theory.

[10]  Sergio VerdÂ,et al.  Fading Channels: InformationTheoretic and Communications Aspects , 2000 .

[11]  G. David Forney,et al.  Geometrically uniform codes , 1991, IEEE Trans. Inf. Theory.

[12]  G. David Forney,et al.  Coset codes-I: Introduction and geometrical classification , 1988, IEEE Trans. Inf. Theory.

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

[14]  Thomas M. Cover,et al.  A Proof of the Data Compression Theorem of Slepian and Wolf for Ergodic Sources , 1971 .

[15]  Richard E. Blahut,et al.  Principles and practice of information theory , 1987 .