When is a Message Decodable Over Fading Channels?

We investigate the distribution of decoding times for frequency-flat fading channels when the information block size is fixed to a finite value a priori but codeword length is not. We characterize the distribution of decoding times for block-fading channels in a computable form and demonstrate that the resulting distribution is discontinuous at block boundaries. We make suggestions regarding coding strategies based on these distributions and discuss the benefits of rateless coding in this setting

[1]  Stark C. Draper,et al.  On Rateless Coding over Fading Channels with Delay Constraints , 2006, 2006 IEEE International Symposium on Information Theory.

[2]  Giuseppe Caire,et al.  Variable-rate coding for slowly fading Gaussian multiple-access channels , 2004, IEEE Transactions on Information Theory.

[3]  Prakash Narayan,et al.  Reliable Communication Under Channel Uncertainty , 1998, IEEE Trans. Inf. Theory.

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

[5]  G. Grimmett,et al.  Probability and random processes , 2002 .

[6]  Jonathan S. Yedidia,et al.  Rateless codes on noisy channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

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

[8]  Richard G. Baraniuk,et al.  Throughput Measures for Delay-constrained Communications in Fading Channels , 2003 .

[9]  Joseph J. Boutros,et al.  Analysis of coding on non-ergodic channels , 2005 .

[10]  Brendan J. Frey,et al.  Efficient variable length channel coding for unknown DMCs , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[11]  Yongyi Mao,et al.  Rateless coding over fading channels , 2006, IEEE Communications Letters.