Distributed rateless codes with UEP property

When multiple sources of data need to transmit their rateless coded symbols through a single relay to a common destination, a distributed rateless code instead of several separate conventional rateless codes can be employed to encode the input symbols to increase the transmission efficiency and flexibility. In this paper, we propose distributed rateless codes (DU-rateless) that can provide unequal error protection (UEP) for distributed sources with different data block lengths and different importance levels. We analyze our proposed DU-rateless code employing And-Or tree analysis technique. Next, we design several sets of optimum DU-rateless codes for various setups employing multi-objective genetic algorithms and evaluate their performances.

[1]  P. Maymounkov.  Online codes , 2002 .

[2]  Michael Mitzenmacher,et al.  Analysis of random processes via And-Or tree evaluation , 1998, SODA '98.

[3]  Nazanin Rahnavard,et al.  Generalization of Rateless Codes for Unequal Error Protection and Recovery Time: Asymptotic Analysis , 2006, 2006 IEEE International Symposium on Information Theory.

[4]  Robert J. Piechocki,et al.  AND-OR tree analysis of distributed LT codes , 2009, 2009 IEEE Information Theory Workshop on Networking and Information Theory.

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

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

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

[8]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..