WLC44-3: Reduced-Complexity Decoding of Raptor Codes over Fading Channels

Fountain codes are a universal class of rateless codes originally designed for erasure channels. Naturally adapting to channel states without channel knowledge at the transmitter, fountain codes have recently been demonstrated also as an appealing solution for communication over fading channels. However, their relatively high decoding complexity limits their practical use in a wireless setting. In this paper, we present a simple modification of the decoding algorithm for Raptor codes - a type of fountain codes - over fading channels, where the complexity is significantly reduced without sacrifice of performance.

[1]  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.

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

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

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

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

[6]  X. Jin.  Factor graphs and the Sum-Product Algorithm , 2002 .

[7]  Patrick Mitran,et al.  Space-time diversity enhancements using collaborative communications , 2005, IEEE Transactions on Information Theory.

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

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

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

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