Rateless coding over fading channels

We propose a framework for communication over fading channels utilizing rateless codes. An implementation using fountain codes is simulated, demonstrating that such a scheme has advantages in efficiency, reliability and robustness over conventional fixed-rate codes, particularly when channel state information is not available at the transmitter.

[1]  Omid Etesami,et al.  Raptor codes on symmetric channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[2]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[3]  Shu Lin,et al.  Error Control Coding , 2004 .

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

[5]  Yongyi Mao,et al.  Rateless coding for wireless relay channels , 2005, ISIT.

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

[7]  Muriel Médard,et al.  The effect upon channel capacity in wireless communications of perfect and imperfect knowledge of the channel , 2000, IEEE Trans. Inf. Theory.

[8]  Matthew C. Valenti,et al.  Practical relay networks: a generalization of hybrid-ARQ , 2005 .

[9]  Emre Telatar,et al.  Capacity of Multi-antenna Gaussian Channels , 1999, Eur. Trans. Telecommun..

[10]  Lizhong Zheng,et al.  Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels , 2003, IEEE Trans. Inf. Theory.

[11]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

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