Robust LT designs in binary erasures

Fountain codes are used in many applications where the channels are time varying and it is difficult at the transmitter to predict the appropriate code rate. In this situation, fixedrate codes are not suitable. Despite the good performance of fountain codes, universally optimal codes do not exist in the finite-length regime. In this paper, we design new fountain codes that are robust to the communication system's parameters such as erasure probability as well as the source length. We employ density evolution together with linear programming to design robust fountain codes offering some of the attractive properties of universally optimal codes. Different objectives are used in the analysis such as minimizing the erasure probability and maximizing the code rate. Analytically, results indicate that fountain codes can decrease the failure probability to the level of 10-12 using the optimized parameters at source length k = 128, code rate R = 1/2 and erasure probability ϵ = 0. Further, simulation results show that the code rate can be improved significantly. For example, at a source length k = 512, Shokrollahi distribution [1] achieves code rate R = 0.7268 while our novel design provides a code rate R = 0.76331, that is, an improvement of 5%.

[1]  Shih-Kai Lee,et al.  Fountain Codes With PAPR Constraint for Multicast Communications , 2011, IEEE Transactions on Broadcasting.

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

[3]  Stephan ten Brink,et al.  Extrinsic information transfer functions: model and erasure channel properties , 2004, IEEE Transactions on Information Theory.

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

[5]  Nazanin Rahnavard,et al.  Fountain Code Design for Broadcasting Systems With Intermediate-State Users , 2015, IEEE Transactions on Communications.

[6]  Taoka Hidekazu,et al.  Scenarios for 5G mobile and wireless communications: the vision of the METIS project , 2014, IEEE Communications Magazine.

[7]  Robert J. Piechocki,et al.  Fountain code design for data multicast with side information , 2009, IEEE Transactions on Wireless Communications.

[8]  Mehrdad Valipour,et al.  Improved finite-length Luby-transform codes in the binary erasure channel , 2015, IET Commun..

[9]  Ming Xiao,et al.  Design of LT Codes with Equal and Unequal Erasure Protection over Binary Erasure Channels , 2013, IEEE Communications Letters.

[10]  Lei Yuan,et al.  A Novel UEP Fountain Coding Scheme for Scalable Multimedia Transmission , 2016, IEEE Transactions on Multimedia.

[11]  Il-Min Kim,et al.  Improved Low-Complexity Soliton-Like Network Coding for a Resource-Limited Relay , 2013, IEEE Transactions on Communications.

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

[13]  Laurence B. Milstein,et al.  Generalized Unequal Error Protection LT Codes for Progressive Data Transmission , 2012, IEEE Transactions on Image Processing.

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

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

[16]  Michael Luby,et al.  A digital fountain approach to reliable distribution of bulk data , 1998, SIGCOMM '98.

[17]  Shahram Yousefi,et al.  Improved systematic fountain codes in AWGN channel , 2013, 2013 13th Canadian Workshop on Information Theory.