An algorithm with high decoding success probability based on LT codes

The declining channel quality by chance would bring about the rise of error rate in wireless transmission. Moreover, automatic repeat request mechanisms would give rise to the tremendous increasement of transmission delay. Therefore, research on the scheme of low transmission delay is of great importance. In this paper, we propose the novel decoding algorithm to obtain a tradeoff between Belief Propagation and Gaussian Elimination decoding. Results show that the proposed decoding algorithm has higher DSP (decoding success probability) and lower decoding time.

[1]  Matteo Sereno,et al.  Rateless codes network coding for simple and efficient P2P video streaming , 2009, 2009 IEEE International Conference on Multimedia and Expo.

[2]  Eitan Altman,et al.  Forward Correction and Fountain Codes in Delay-Tolerant Networks , 2008, IEEE/ACM Transactions on Networking.

[3]  Douglas J. Leith,et al.  Low-delay dynamic routing using fountain codes , 2009, IEEE Communications Letters.

[4]  Sae-Young Chung,et al.  Incremental Gaussian elimination decoding of raptor codes over BEC , 2008, IEEE Communications Letters.

[5]  Matteo Sereno,et al.  On the fly gaussian elimination for LT codes , 2009, IEEE Communications Letters.

[6]  Feng Shao-dong.  BPML Decoding Algorithm of LT Codes , 2009 .

[7]  Yongyi Mao,et al.  Rateless coding for wireless relay channels , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[8]  Lajos Hanzo,et al.  A Systematic LT Coded Arrangement for Transmission over Correlated Shadow Fading Channels in 802.11 Ad-Hoc Wireless Networks , 2010, 2010 IEEE 71st Vehicular Technology Conference.

[9]  Rajarathnam Chandramouli,et al.  Reliable Multimedia Transmission Over Cognitive Radio Networks Using Fountain Codes , 2008, Proceedings of the IEEE.

[10]  Lie-Liang Yang,et al.  Serially Concatenated Luby Transform Coding and Bit-Interleaved Coded Modulation Using Iteratlive Decoding for the Wireless Internet , 2006, 2006 IEEE 63rd Vehicular Technology Conference.

[11]  Cristina Comaniciu,et al.  Towards increasing diversity for the relaying of LT Fountain Codes in Wireless Sensor Networks , 2010, ArXiv.

[12]  Emina Soljanin,et al.  Incremental Redundancy Cooperative Coding for Wireless Networks: Cooperative Diversity, Coding, and Transmission Energy Gains , 2006, IEEE Transactions on Information Theory.

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

[14]  Lajos Hanzo,et al.  Fountain-Code Aided File Transfer in 802.11 WLANs , 2009, 2009 IEEE 70th Vehicular Technology Conference Fall.

[16]  Xianzhong Xie,et al.  Performance Analysis of Wireless Dynamic Cooperative Relay Networks Using Fountain Codes , 2010, J. Commun..

[17]  Emina Soljanin,et al.  Decentralized Coding Algorithms for Distributed Storage in Wireless Sensor Networks , 2010, IEEE Journal on Selected Areas in Communications.

[18]  Thomas E. Fuja,et al.  The Design and Performance of Distributed LT Codes , 2007, IEEE Transactions on Information Theory.

[19]  Joong Bum Rhim,et al.  Fountain Codes , 2010 .

[20]  Dejan Vukobratovic,et al.  Expanding Window Fountain Codes for Unequal Error Protection , 2007, 2007 Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers.

[21]  Lutz H.-J. Lampe,et al.  Rateless coding for hybrid free-space optical and radio-frequency communication , 2010, IEEE Transactions on Wireless Communications.

[22]  Vinod Sharma,et al.  Queued Cooperative Wireless Networks With Rateless Codes , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.