Advertisement

Intermediate Performance of Rateless Codes over Dying Erasure Channel

  • Shushi Gu
  • Jian Jiao
  • Qinyu Zhang
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 463)

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.

Keywords

Dying channel Rateless codes Intermediate performance Degree distribution 

Notes

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.

References

  1. 1.
    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)Google Scholar
  2. 2.
    Zeng, M., Zhang, R., Cui, S.: Outage capacity and optimal transmission for dying channels. IEEE Trans. Commun. 61(1), 357–367 (2013)Google Scholar
  3. 3.
    Luby, M.: LT codes. In: Proceeding of IEEE Symposium on the Foundations of Computer Science (STOC), Vancouver, BC, Canada, pp. 271–280 (2002)Google Scholar
  4. 4.
    Shokrollahi, A.: Raptor codes. IEEE Trans. Inf. Theory 52(6), 2551–2567 (2006)Google Scholar
  5. 5.
    Sanghavi S.: Intermediate performance of rateless codes. In: Proceeding 2007 IEEE Information Theory Workshop, Lake Tahoe, California, pp. 478–482 (2007)Google Scholar
  6. 6.
    Talari, A., Rahnavard, N.: On the intermediate symbol recovery rate of rateless codes. IEEE Trans. Commun. 60(5), 1237–1242 (2012)Google Scholar
  7. 7.
    Zeng, M., Calderbank, R., Cui, S.: On design of rateless codes over dying binary erasure channel. IEEE Trans. Commun. 60(4), 889–894 (2012)Google Scholar
  8. 8.
    Thomos, N., Pulikkoonattu, R., Frossard, P.: Growth codes: intermediate performance analysis and application to video. IEEE Trans. Commun. 61(11), 4710–4721 (2013)Google Scholar
  9. 9.
    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)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.Communication Engineering Research CenterHarbin Institute of Technology (Shenzhen)ShenzhenChina

Personalised recommendations