Wireless Networks

, Volume 23, Issue 7, pp 2177–2188 | Cite as

A generalized design of distributed rateless codes with decreasing ripple size for multiple-access relay networks

  • Jianxin Liao
  • Lei ZhangEmail author
  • Tonghong Li
  • Jingyu Wang
  • Qi Qi


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.


Distributed 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. 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. 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
  3. 3.
    Puducheri, S., Kliewer, J., & Fuja, T. (2007). The design and performance of distributed LT codes. IEEE Transactions on Information Theory, 53(10), 3740–3754.MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Cao, R., & Yang, L. (2012). Decomposed LT codes for cooperative relay communications. IEEE Journal on Selected Areas in Communications, 30(2), 407–414.MathSciNetCrossRefGoogle Scholar
  5. 5.
    Lei, Z., Jianxin, L., Jingyu, W., Tonghong, L., & Qi, Q. (2014). Design of improved Luby transform codes with decreasing ripple size and feedback. IET Communications, 8(8), 1409–1416.CrossRefGoogle Scholar
  6. 6.
    Sorensen, J. H., Popovski, P., & Ostergaard, J. (2012). Design and analysis of LT codes with decreasing ripple size. IEEE Transactions on Communications, 60(11), 1–7.CrossRefGoogle Scholar
  7. 7.
    Reze, R. B., & Masoud, A. (2015). Fountain code design for the Y-network. IEEE Communications Letters, 19(5), 703–706.CrossRefGoogle Scholar
  8. 8.
    Talari, A., & Rahnavard, N. (2012). Distributed unequal error protection rateless codes over erasure channels: A two-source scenario. IEEE Transactions on Communications, 60(8), 2084–2090.CrossRefGoogle Scholar
  9. 9.
    Hanqin, S., Dazhuan, X., & Xiaofei, Z. (2015). Distributed Luby transform coding for three-source single-relay networks based on the deconvolution of robust soliton distribution. IET Communications, 9(2), 167–176.CrossRefGoogle Scholar
  10. 10.
    Sejdinovic, D., Piechocki, R., Doufexi, A., & Ismail, M. (2010). Decentralised distributed fountain coding: asymptotic analysis and design. IEEE Communications Letters, 14(1), 42–44.CrossRefGoogle Scholar
  11. 11.
    Shao, H., Xu, D., & Zhang, X. (2013). Asymptotic analysis and optimization for generalized distributed fountain codes. IEEE Communications Letters, 17(5), 988–991.CrossRefGoogle Scholar
  12. 12.
    Liau, A., Yousefi, S., & Kim, I.-M. (2011). Binary soliton-like rateless coding for the Y-network. IEEE Transactions on Communications, 59(12), 3217–3222.CrossRefGoogle Scholar
  13. 13.
    Liau, A., Kim, I., & Yousefi, S. (2013). Improved low-complexity soliton-like network coding for a resource-limited relay. IEEE Transactions on Communications, 61(8), 3327–3335.CrossRefGoogle Scholar
  14. 14.
    Huassain, I., Xian, M., & Rasmussen, L. K. (2014). Rateless codes for the multiway relay channel. IEEE Wireless Communication Letters, 3(5), 457–461.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  • Jianxin Liao
    • 1
    • 2
  • Lei Zhang
    • 1
    • 2
    Email author
  • Tonghong Li
    • 3
  • Jingyu Wang
    • 1
    • 2
  • Qi Qi
    • 1
    • 2
  1. 1.State Key Laboratory of Network and Switching TechnologyBeijing University of Posts and TelecommunicationsBeijingPeople’s Republic of China
  2. 2.EBUPT Information Technology Co., LtdBeijingPeople’s Republic of China
  3. 3.Department of Computer ScienceTechnical University of MadridMadridSpain

Personalised recommendations