Fountain Code Design for Broadcasting Systems With Intermediate-State Users

Several studies on fountain codes have proposed degree distribution optimization schemes to maximize symbol recovery rate. However, if the number of transmitted coded symbols is limited or the channel erasure probability is high, it may be impossible that a user recovers all of the data symbols regardless of degree distribution employed by the source. In this study, we focus on a new system model where one source transmits fountain-coded symbols to multiple users who already possess some data symbols and coded symbols. Assuming that each user can transmit a feedback packet containing its own state information before the source transmits coded symbols, we propose two types of degree distribution design schemes that are suitable for the system model. Simulation results demonstrate the efficiency of our proposed schemes by comparing with conventional methods in terms of symbol recovery rate and full recovery rate.

[1]  Nazanin Rahnavard,et al.  LT-AF codes: LT codes with Alternating Feedback , 2013, 2013 IEEE International Symposium on Information Theory.

[2]  R. Stephenson A and V , 1962, The British journal of ophthalmology.

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

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

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

[6]  A. Robert Calderbank,et al.  On Design of Rateless Codes over Dying Binary Erasure Channel , 2012, IEEE Transactions on Communications.

[7]  Sujay Sanghavi Intermediate Performance of Rateless Codes , 2007, 2007 IEEE Information Theory Workshop.

[8]  Nazanin Rahnavard,et al.  Rateless Codes with Optimum Intermediate Performance , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[9]  Jon Feldman,et al.  Growth codes: maximizing sensor network data persistence , 2006, SIGCOMM 2006.

[10]  Sachin Agarwal,et al.  Rateless Coding with Feedback , 2009, IEEE INFOCOM 2009.

[11]  Nazanin Rahnavard,et al.  Rateless Codes With Unequal Error Protection Property , 2007, IEEE Transactions on Information Theory.

[12]  Daniel A. Spielman,et al.  Practical loss-resilient codes , 1997, STOC '97.

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

[14]  Petar Popovski,et al.  Feedback in LT Codes for Prioritized and Non-Prioritized Data , 2012, 2012 IEEE Vehicular Technology Conference (VTC Fall).

[15]  Saejoon Kim,et al.  Improved intermediate performance of rateless codes , 2009, 2009 11th International Conference on Advanced Communication Technology.

[16]  Toshiaki Koike-Akino,et al.  Rateless feedback codes , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

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