Abstract
As the first realisation of Fountain Codes, Luby Transform (LT) codes provide high reliability and scalability and low complexities for data transmission in networks. Two basic algorithms, Belief Propagation (BP) and Gaussian Elimination (GE), were introduced to decode LT codes. However, both of them execute their decoding process only after all the encoded symbols have been received by decoder, which results in the waste of time, storage space and computing resource. In this paper, an improved decoding algorithm termed on the fly belief propagation (OFBP) for LT codes is proposed. Based on the BP algorithm, OFBP performs the decoding processing once each encoded symbol arrives thus distributing the decoding work during all symbols reception. Compared with the traditional BP algorithm, the actual decoding time of the proposed algorithm is highly shortened. Moreover, without processing all the encoded symbols, the actual storage space and decoding complexity are greatly reduced while maintaining the same performance relative to the traditional BP decoding scheme.
Z. Liu—This work was supported by the National Natural Science Foundation of China (No. 91338201, No. 91438109, No. 61571464, No. 61401507, No. 61601511).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Byers, J.W., Luby, M., Mitzenmacher, M., Rege, A.: A digital fountain approach to reliable distribution of bulk data. ACM SIGCOMM 28(4), 56–67 (1998)
Luby M.: LT codes. In: Proceedings 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 271–282 (2002)
Mackay, D.J.C.: Fountain codes. IEEE Proc. Commun. 152(6), 1062–1068 (2005)
Shokrollahi, A.: Raptor codes. IEEE Trans. Inf. Theory 52(6), 2551–2567 (2006)
Luby, M., Mitzenmacher, M., Shokrollahi, A., Spielman, A.: Efficient erasure correcting codes. IEEE Trans. Inf. Theory 47(2), 569–584 (2001)
Puducheri, S., Kliewer, J., Fuja, T.E.: Distributed LT codes. In: IEEE International Symposium Information Theory, pp. 987–991 (2006)
Yuan, X., Ping, L.: On systematic LT codes. IEEE Commun. Lett. 12(9), 681–683 (2008)
Sorensen, J.H., Popovski, P., Ostergaard, J.: Design and analysis of LT codes with decreasing ripple size. IEEE Trans. Commun. 60(11), 3191–3197 (2012)
Huang, Y., Lei, J., Wei, J.: Joint network and fountain codes design for relay-assisted multi-user system. China Commun. 12(7), 96–107 (2015)
Kim, S., Ko, K., Chung, S.Y.: Incremental Gaussian elimination decoding of raptor codes over BEC. IEEE Commun. Lett. 12(4), 307–309 (2008)
Anglano, C., Gaeta, R., Grangetto, M.: Exploiting rateless codes in cloud storage systems. IEEE Trans. Parallel Distrib. Syst. 26(5), 1313–1322 (2015)
Bioglio, V., Grangetto, M., Gaeta, R., Sereno, M.: On the fly Gaussian elimination for LT codes. IEEE Commun. Lett. 13(12), 953–955 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Suo, L., Zhang, G., Bian, D., Lv, J., Chen, H., Liu, Z. (2019). On the Fly Belief Propagation Decoding Algorithm for LT Codes. In: Liang, Q., Mu, J., Jia, M., Wang, W., Feng, X., Zhang, B. (eds) Communications, Signal Processing, and Systems. CSPS 2017. Lecture Notes in Electrical Engineering, vol 463. Springer, Singapore. https://doi.org/10.1007/978-981-10-6571-2_217
Download citation
DOI: https://doi.org/10.1007/978-981-10-6571-2_217
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-6570-5
Online ISBN: 978-981-10-6571-2
eBook Packages: EngineeringEngineering (R0)