Abstract
In this paper, we propose a new rateless coding scheme for dying erasure channels with random channel lengths and time-varying packet error rates. Firstly, we propose a heuristic approach for suboptimal degree distributions based on AND-OR tree technique to achieve higher intermediate performance. Secondly, the optimal code length for the maximum average date delivery ratio is derived and analyzed. Simulation results demonstrate that our coding scheme outperforms existing conventional rateless codes with significantly better performance, which can be employed as a solution to the efficient large bulk transmission on dynamical and unreliable channels.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Varshney, L.R., Mitter, S.K., Goyal, V.K.: An information-theoretic characterization of channels that die. IEEE Trans. Inf. Theory 58(9), 5711–5724 (2012)
Zeng, M., Zhang, R., Cui, S.: Outage capacity and optimal transmission for dying channels. IEEE Trans. Commun. 61(1), 357–367 (2013)
Luby, M.: LT codes. In: Proceeding of IEEE Symposium on the Foundations of Computer Science (STOC), Vancouver, BC, Canada, pp. 271–280 (2002)
Shokrollahi, A.: Raptor codes. IEEE Trans. Inf. Theory 52(6), 2551–2567 (2006)
Sanghavi S.: Intermediate performance of rateless codes. In: Proceeding 2007 IEEE Information Theory Workshop, Lake Tahoe, California, pp. 478–482 (2007)
Talari, A., Rahnavard, N.: On the intermediate symbol recovery rate of rateless codes. IEEE Trans. Commun. 60(5), 1237–1242 (2012)
Zeng, M., Calderbank, R., Cui, S.: On design of rateless codes over dying binary erasure channel. IEEE Trans. Commun. 60(4), 889–894 (2012)
Thomos, N., Pulikkoonattu, R., Frossard, P.: Growth codes: intermediate performance analysis and application to video. IEEE Trans. Commun. 61(11), 4710–4721 (2013)
Luby, M., Mitzenmacher, M., Shokrollahi, A.: Analysis of random processes via and-or tree evaluation. In: Proceeding 1998 ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, pp. 364–373 (1998)
Acknowledgments
This work has been supported by National Natural Sciences Foundation of China (NSFC) under Grant 61771158, 61701136, 61525103 and 61371102, and Shenzhen Basic Research Program under Grant JCYJ20160328163327348 and JCYJ20150930150304185.
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
Gu, S., Jiao, J., Zhang, Q. (2019). Intermediate Performance of Rateless Codes over Dying Erasure Channel. 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_6
Download citation
DOI: https://doi.org/10.1007/978-981-10-6571-2_6
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-6570-5
Online ISBN: 978-981-10-6571-2
eBook Packages: EngineeringEngineering (R0)