Online Fountain Codes With Unequal Recovery Time

Recently, fountain codes have developed some online versions to cope with the increasingly complicated spectrum environment. The conventional online fountain code structures are still not sufficient to meet the unequal recovery time (URT) requirement when the data have a mass of different priorities. This letter adopts an expanding-window strategy to implement two structures, where the data with higher priority ensure less recovery time. Simulation results verify the superior performance of two structures that can achieve a significant increase in decoding speed of the data of high priorities, except that they are accompanied by negligible extra overhead in comparison with the conventional online fountain codes.

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

[2]  Ming Xiao,et al.  On-Line Fountain Codes With Unequal Error Protection , 2017, IEEE Communications Letters.

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

[4]  Benshun Yi,et al.  Expanding-Window BATS Code With Intermediate Feedback , 2018, IEEE Communications Letters.

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

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

[7]  N. Alon,et al.  The Probabilistic Method, Second Edition , 2000 .

[8]  B. Bollobás.  The evolution of random graphs , 1984 .

[9]  Ming Xiao,et al.  Performance Analysis and Improvement of Online Fountain Codes , 2018, IEEE Transactions on Communications.

[10]  Amin Shokrollahi,et al.  Online Fountain Codes With Low Overhead , 2015, IEEE Transactions on Information Theory.

[11]  Vojin Senk,et al.  Expanding Window Fountain Codes for Unequal Error Protection , 2007, ASILOMAR 2007.

[12]  P. Erdos,et al.  On the evolution of random graphs , 1984 .