Performance-Complexity Tradeoffs of Raptor Codes over Gaussian Channels

We investigate the performance-complexity tradeoffs of Raptor codes over Gaussian channels. Two different implementations of the belief-propagation (BP) decoding algorithm are considered, which we respectively refer to as "message-reset decoding" and "incremental decoding". We show that incremental decoding offers great advantages over message-reset decoding in terms of this tradeoff

[1]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

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

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

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

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