The Turbo-Fountain and its Application to Reliable Wireless Broadcast

Reliable wireless broadcast with asynchronous data access based on fountain coding is investigated. We review the traditional problem formalization for fountain codes operating on erasure channels and we generalize the problem formalization to arbitrary types of channels. We introduce a novel type of rateless codes based on the turbo principle: the Turbo-Fountain. The Turbo- Fountain is able to consider soft information from the channel in the decoding process. Two realizations for the Turbo-Fountain are introduced. We show simulation results for the Turbo-Fountain realizations on the AWGNand on fading channels. Additionally, we compare the achievable Turbo-Fountain performance with traditional fountain codes designed for the erasure channel, both on the AWGN and on fading channels, considering appropriate erasure declaration. It is shown that the Turbo-Fountain provides significant performance gains, due to exploitation of soft information, and approaches capacity.

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

[2]  H. Sadjadpour,et al.  Joint interleaver design for multiple turbo codes , 2004, IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004.

[3]  M. Mörz.  Analog Sliding Window Decoder Core for Mixed Signal Turbo Decoder , 2004 .

[4]  Luigi Rizzo,et al.  A reliable multicast data distribution protocol based on software FEC techniques , 1997, The Fourth IEEE Workshop on High-Performance Communication Systems.

[5]  Michael Mitzenmacher,et al.  Digital fountains: a survey and look forward , 2004, Information Theory Workshop.

[6]  Michael Mitzenmacher,et al.  A digital fountain approach to asynchronous reliable multicast , 2002, IEEE J. Sel. Areas Commun..

[7]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[8]  Patrick Robertson,et al.  A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[9]  Dariush Divsalar,et al.  Soft-Output Decoding Algorithms in Iterative Decoding of Turbo Codes , 1996 .

[10]  David Mazières,et al.  Rateless Codes and Big Downloads , 2003, IPTPS.

[11]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[12]  Joachim Hagenauer.  The Turbo Principle in Mobile Communications , 2002 .

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

[14]  Joachim Hagenauer,et al.  Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.

[15]  D. Divsalar,et al.  Multiple turbo codes for deep-space communications , 1995 .