A generalized design of distributed rateless codes with decreasing ripple size for multiple-access relay networks
In this correspondence, the problem of existing distributed rateless codes (DRC) with inaccurate degree distributions in the sources and the relay is addressed. Based on a well-known multiple-access relay network model, a generalized design of DRC (GDRC) is proposed by using optimization theory and heuristic Jacobian iterative algorithm, in which the interaction between the degree distributions in the sources and in the relay is considered. Our GDRC can be applied to Luby transfer codes or any other rateless codes that can be described with a degree distribution. Furthermore, a novel approach of designing GDRC with decreasing ripple size is proposed by directly analysing the interaction between the ripple size revolutions in the sources and in the relay. Our proposed scheme is evaluated and compared with existing schemes. It is shown that our proposed scheme exhibits reduced overhead, memory usage, bit error rate and energy consumption compared to the existing schemes.
KeywordsDistributed rateless codes Degree distribution Heuristic matrixes Optimization algorithm
This work was jointly supported by: (1) the National Basic Research Program of China (No. 2013CB329102); (2) National Natural Science Foundation of China (Nos. 61471063, 61421061, 61372120, 61271019, 61101119, 61121001); (3) the Key (Keygrant) Project of Chinese Ministry of Education (No. MCM20130310); (4) Beijing Municipal Natural Science Foundation (No. 4152039); (5) Beijing Higher Education Young Elite Teacher Project (No. YETP0473); (6) Spanish Research Council (No: TIN2014-46883); (7) Regional Government of Madrid (No: S2013/ICE-2894) cofunded by FSE and FEDER.
- 1.Byers, J., Luby, M., Mitzenmacher, M., Rege, A. (1998). A digital fountain approach to reliable distribution of bulk data. In Proceeding of SIGCOMM, Vancouver, BC, CA (pp. 56–67).Google Scholar
- 2.Luby, M. (2002) LT codes. In Proceeding of the ACM symposium on foundations of computer science, Vancouver, BC, CA (pp. 37–47).Google Scholar