Skip to main content
Log in

Design of Degree Distributions for Finite Length LT Codes

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

In this paper we investigate the design of degree distributions for finite length LT codes over the binary erasure channel. A decreasing ripple size in literature provides the state of the art degree distributions for finite length LT codes. However, study on releasing multiple encoding symbols in each decoding step shows that the ripple size increases first and then decreases during the decoding process. Therefore, we propose the corresponding ripple size evolution model considering multiple releases. In the design procedure with any ripple size evolution models, the computational cost increases greatly as the length of source symbols increases. Thus, we design a suboptimal degree distribution of low computational complexity. The proposed degree distributions are compared to others through simulations and a increase in performance with respect to block error rate is provided.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

References

  1. Luby, M. (2002). LT codes. In Proceedings of 43rd annual IEEE symposium on foundations of computer science (pp. 271–280).

  2. Byers, J. W., Luby, M., Mitzenmacher, M., & Rege, A. (1988). A digital fountain approach to reliable distribution of bulk data. ACM SIGCOMM Computer Communication Review, 28(4), 56–67.

    Article  Google Scholar 

  3. MacKay, D. J. C. (2005). Fountain codes. IEE Proceedings-Communications, 152(6), 1062–1068.

    Article  Google Scholar 

  4. Luby, M., Mitzenmacher, M., & Shokrollahi, A. (1998). Analysis of random processes via and-or tree evaluation. In Proceedings of ACM-SIAM symposium on discrete algorithms (pp. 364–373).

  5. Sejdinovic, D., Piechocki, R. J., & Doufexi, A. (2009). AND-OR tree analysis of distributed LT codes. In Proceedins of IEEE information theory workshop on networking and information theory (pp. 261–265).

  6. Tsai, P. C., Chen, C. M., & Chen, Y. P. (2014). A novel evaluation function for LT codes degree distribution optimization. In Proceedings of IEEE congress on evolutionary computation (pp. 3030–3035).

  7. Hayajneh, K. F., Yousefi, S., & Valipour, M. (2015). Improved finite-length Luby-transform codes in the binary erasure channel. IET Communications, 9(8), 1122–1130.

    Article  Google Scholar 

  8. Jesper, P. P., Sorensen, H., & Ostergaard, J. (2012). Design and analysis of LT codes with decreasing ripple size. IEEE Transactions on Communications, 60(11), 3191–3197.

    Article  Google Scholar 

  9. Yen, K. K., Liao, Y. C., Chen, C. L., & Chang, H. C. (2013). Modified Robust Soliton Distribution (MRSD) with improved ripple size for LT codes. IEEE Communications Letters, 17(11), 976–979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shengkai Xu.

Additional information

The work was supported by the National Natural Science Foundation of China (Grant Nos. 61471192, 61371169), the Priority Academic Program Development of Jiangsu Higher Education Institutions, Foundation of Graduate Innovation Center in NUAA (Grant No. kfjj20160414), the Fundamental Research Funds for the Central Universities, and Postgraduate Research & Practice Innovation Program of Jiangsu Province (Grant No. KYCX17_0267).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xu, S., Xu, D. Design of Degree Distributions for Finite Length LT Codes. Wireless Pers Commun 98, 2251–2260 (2018). https://doi.org/10.1007/s11277-017-4972-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-017-4972-y

Keywords

Navigation