Skip to main content
SpringerLink
Log in

The design and analysis of unequal error protection fountain coding for multiple source networks over binary erasure channels

  • Research Paper
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

A novel network model of multiple source fountain coding is developed and a novel class of generic multiple source fountain codes with unequal error protection (UEP) property is proposed. The And-Or tree analysis technique is generalized to analyze the asymptotic performance of the proposed codes and a joint optimization method employing both linear and nonlinear programs is developed to optimize the degree distributions. Furthermore, we propose three basic methods to achieve UEP property and the performance of each method is discussed. We employ these analytical results and optimization method to design and discuss several UEP codes with two and four sources for different application scenarios. Simulation results verify that the proposed codes can be applied to the networks with any number of sources and can provide strong UEP property in various ways based on the proposed three basic methods.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. MacKay D J C. Fountain codes. IEE Proc Commun, 2005, 152: 1062–1068

    Article  Google Scholar 

  2. Byers J W, Luby M, Mitzenmacher M, et al. A digital fountain approach to reliable distribution of bulk data. ACM SIGCOMM Comput Commun Rev, 1998, 28: 56–67

    Article  Google Scholar 

  3. Luby M. LT codes. In: Proceedings of 43rd Annual IEEE Symposium on Foundations of Computer Science, Vancouver, 2002. 2002. 271–280

    Chapter  Google Scholar 

  4. Shokrollahi A. Raptor codes. IEEE Trans Inf Theory, 2006, 52: 2551–2567

    Article  MathSciNet  Google Scholar 

  5. Ahlswede R, Cai N, Li S Y R, et al. Network information flow. IEEE Trans Inf Theory, 2000, 46: 1204–1216

    Article  MATH  MathSciNet  Google Scholar 

  6. Li S Y R, Yeung R W, Cai N. Linear network coding. IEEE Trans Inf Theory, 2003, 49: 371–381

    Article  MATH  MathSciNet  Google Scholar 

  7. Li S Y R, Sun Q T, Shao Z. Linear network coding: theory and algorithms. Proc IEEE, 2011, 99: 372–387

    Article  Google Scholar 

  8. Liau A, Yousefi S, Kim I M. Binary soliton-like rateless coding for the Y-network. IEEE Trans Commun, 2011, 59: 3217–3222

    Article  Google Scholar 

  9. Puducheri S, Kliewer J, Fuja T E. Distributed LT codes. In: Proceedings of IEEE International Symposium on Information Theory, Seattle, 2006. 987–991

    Google Scholar 

  10. Puducheri S, Kliewer J, Fuja T E. The design and performance of distributed LT codes. IEEE Trans Inf Theory, 2007, 53: 3740–3754

    Article  MathSciNet  Google Scholar 

  11. Sejdinovic D, Piechocki R J, Doufexi A. AND-OR tree analysis of distributed LT codes. In: Proceedings of IEEE Information Theory Workshop on Networking and Information Theory, Volos, 2009. 261–265

    Google Scholar 

  12. Sejdinovic D, Piechocki R, Doufexi A, et al. Decentralised distributed fountain coding: asymptotic analysis and design. IEEE Commun Lett, 2010, 14: 42–44

    Article  Google Scholar 

  13. Arslan S S, Cosman P C, Milstein L B. Generalized unequal error protection LT codes for progressive data transmission. IEEE Trans Image Process, 2012, 21: 3586–3597

    Article  MathSciNet  Google Scholar 

  14. Rahnavard N, Vellambi B N, Fekri F. Rateless codes with unequal error protection property. IEEE Trans Inf Theory, 2007, 53: 1521–1532

    Article  MATH  MathSciNet  Google Scholar 

  15. Rahnavard N, Fekri F. Generalization of rateless codes for unequal error protection and recovery time: asymptotic analysis. In: Proceedings of IEEE International Symposium on Information Theory, Seattle, 2006. 523–527

    Google Scholar 

  16. Sejdinovic D, Vukobratovic D, Doufexi A, et al. Expanding window fountain codes for unequal error protection. IEEE Trans Commun, 2009, 57: 2510–2516

    Article  Google Scholar 

  17. Talari A, Rahnavard N. Distributed rateless codes with UEP property. In: Proceedings of IEEE International Symposium on Information Theory, Cambridge, 2010. 2453–2457

    Google Scholar 

  18. Talari A, Rahnavard N. Distributed unequal error protection rateless codes over erasure channels: a two-source scenario. IEEE Trans Commun, 2012, 60: 2084–2090

    Article  Google Scholar 

  19. Shao H Q, Xu D Z, Zhang X F. Asymptotic analysis and optimization for generalized distributed fountain codes. IEEE Commun Lett, 2013, 17: 988–991

    Article  Google Scholar 

  20. Luby M G, Mitzenmacher M, Shokrollahi M A. Analysis of random processes via and-or tree evaluation. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 1998. 364–373

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing, 210016, China

    HanQin Shao, DaZhuan Xu & XiaoFei Zhang

Authors
  1. HanQin Shao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. DaZhuan Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. XiaoFei Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to DaZhuan Xu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shao, H., Xu, D. & Zhang, X. The design and analysis of unequal error protection fountain coding for multiple source networks over binary erasure channels. Sci. China Inf. Sci. 57, 1–9 (2014). https://doi.org/10.1007/s11432-014-5130-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-014-5130-8

Keywords

Search

Navigation