Skip to main content
SpringerLink
Log in

Towards Fountain Codes. Part II: Belief Propagation Decoding

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Error-prone patterns have been extensively studied for low-density parity-check codes, yet they have never been fully explored for generator-based Fountain codes. In the previous work, the structures and analysis of Fountain codes were discussed. In what follows, we will focus on different substructures in the \(G\)-based Tanner graph under the belief propagation algorithm. We will then proceed to provide further insights on the most pertinent issues related to Fountain codes, such as their code constructions, encoding and decoding techniques, performance metrics, the convergence of their decoding as well as the associated design techniques. Most of the work carried out during the previous years has been presented.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. Mitzenmacher, M. (2004). Digital fountains: A survey and look forward. IEEE information theory workshop 2004 (pp. 271–276). IEEE.

  2. MacKay, D. J. (2003). Information theory, inference and learning algorithms. Cambridge: Cambridge University Press.

    MATH  Google Scholar 

  3. MacKay, D. J. (2005). Fountain codes. In IEEE proceedings on communications, (Vol. 152, pp. 1062–1068). IET.

  4. Byers, J. W., Luby, M., Mitzenmacher, M., & Rege, A. (1998). A digital fountain approach to reliable distribution of bulk data. ACM SIGCOMM computer communication review, (Vol. 28, pp. 56–67). ACM.

  5. LUBY, M. (2002). Lt codes. Annual symposium on foundations of computer science (pp. 271–280).

  6. Pearl, J. (1988). Probabilistic reasoning in intelligent systems: Networks of plausble inference. Burlington: Morgan Kaufmann.

    Google Scholar 

  7. Shokrollahi, A. (2006). Raptor codes. IEEE Transactions on Information Theory, 52(6), 2551–2567.

    Article  MathSciNet  Google Scholar 

  8. http://www.digitalfountain.com/standards.html. Accessed 30 Sept 2010.

  9. Garcia-Frias, J., & Zhong, W. (2003). Approaching shannon performance by iterative decoding of linear codes with low-density generator matrix. IEEE Communications Letters, 7(6), 266–268.

    Article  Google Scholar 

  10. Etesami, O., & Shokrollahi, A. (2006). Raptor codes on binary memoryless symmetric channels. IEEE Transactions on Information Theory, 52(5), 2033–2051.

    Article  MathSciNet  Google Scholar 

  11. Palanki, R., & Yedidia, J. S. (2004). Rateless Codes on Noisy Channels. 2004 Annual Conference on Information Sciences and Systems (CISS). http://www.merl.com/publications/TR2004-037.

  12. Castura, J., & Mao, Y. (2006). Rateless coding over fading channels. IEEE Communications Letters, 10(1), 46–48.

    Article  Google Scholar 

  13. Cao, Y., & Blostein, S. D. (2008). Raptor codes for hybrid error—erasure channels with memory. 2008 IEEE 24th biennial symposium on communications (pp. 84–88).

  14. Orozco, V. L., & Yousefi, S. (2010). Trapping sets of fountain codes. IEEE Communications Letters, 14(8), 755–757.

    Article  Google Scholar 

  15. MacKay, D. J., & Postol, M. S. (2003). Weaknesses of Margulis and Ramanujan–Margulis low-density parity-check codes. Electronic Notes in Theoretical Computer Science, 74, 97–104.

    Article  Google Scholar 

  16. Richardson, T. (2003). Error floors of lDPC codes. In Proceedings of the annual Allerton conference on communication control and computing, The University; 1998, (Vol. 41, pp. 1426–1435).

  17. Laendner, S., & Milenkovic, O. (2007). LDPC codes based on latin squares: Cycle structure, stopping set, and trapping set analysis. IEEE Transactions on Communications, 55(2), 303–312.

    Article  Google Scholar 

  18. Han, Y., & Ryan, W. E. (2008). LDPC decoder strategies for achieving low error floors. IEEE information theory and applications workshop, 2008 (pp. 277–286).

  19. Ivkovic, M., Chilappagari, S. K., & Vasic, B. (2008). Eliminating trapping sets in low-density parity-check codes by using tanner graph covers. IEEE Transactions on Information Theory, 54(8), 3763–3768.

    Article  MathSciNet  Google Scholar 

  20. Mirrezaei, S. M., Faez, K., & Yousefi, S. (2012). Absorbing sets of fountain codes over noisy channels. 2012 IEEE 26th biennial symposium on communications (QBSC) (pp. 44–47).

  21. Chong, Z. K., Goi, B. M., Ohsaki, H., Ng, C. K. B., & Ewe, H. T. (2012). Design of short-length message fountain code for erasure channel transmission. 2012 IEEE conference on sustainable utilization and development in engineering and technology (STUDENT) (pp. 239–241). IEEE.

  22. Huang, W., Li, H., & Dill, J. (2011). Fountain codes with message passing and maximum likelihood decoding over erasure channels. 2011 IEEE conference on 10th annual wireless telecommunications symposium.

  23. Huang, W. (2012). Investigation on digital fountain codes over erasure channels and additive white gaussian noise channels. PhD thesis, Ohio University.

  24. Park, D., & Chung, S. Y. (2008). Performancecomplexity tradeoffs of rateless codes. 2008 IEEE international symposium on information theory, ISIT 2008 (pp. 2056–2060). IEEE.

  25. Jenkac, H., Mayer, T., Stockhammer, T., & Xu, W. (2005). Soft decoding of lT-codes for wireless broadcast. In Proceedings of IST mobile summit 2005.

  26. Palanki, R. (2004). Iterative decoding for wireless networks. PhD thesis, California Institute of Technology.

  27. Palanki, R., & Yedidia, J. S. (2004). Rateless codes on noisy channels. In IEEE proceedings, international symposium on information theory, 2004, ISIT 2004 (Vol. 37).

  28. Hu, K., Castura, J., & Mao, Y. (2006). Wlc44-3: Reduced-complexity decoding of raptor codes over fading channels. 2006, IEEE global telecommunications conference, GLOBECOM’06 (pp. 1–5).

  29. Castura, J., & Mao, Y. (2006). When is a message decodable over fading channels? 2006 IEEE 23rd biennial symposium on communications (pp. 59–62).

  30. Auguste, V., Charly, P., & David, D. (2009). Jointly decoded raptor codes: Analysis and design for the BIAWGN channel. EURASIP Journal on Wireless Communications and Networking.

  31. Pishro-Nik, H., & Fekri, F. (2006). On raptor codes. 2006 IEEE international conference on communications, ICC’06 (Vol. 3, pp. 1137–1141). IEEE.

  32. Bonello, N., Zhang, R., Chen, S., & Hanzo, L. (2009). Reconfigurable rateless codes. IEEE Transactions on Wireless Communications, 8(11), 5592–5600.

    Article  Google Scholar 

  33. Venkiah, A., Poulliat, C., & Declercq, D. (2007). Analysis and design of raptor codes for joint decoding using information content evolution. 2007 IEEE International symposium on information theory, ISIT 2007 (pp. 421–425).

  34. Pakzad, P., & Shokrollahi, A. (2006). Design principles for raptor codes. 2006 IEEE information theory workshop, ITW’06 Punta del Este (pp. 165–169). IEEE.

  35. Cheng, Z., Castura, J., & Mao, Y. (2009). On the design of raptor codes for binary-input gaussian channels. IEEE Transactions on Communications, 57(11), 3269–3277.

    Article  Google Scholar 

  36. Hu, K., Castura, J., & Mao, Y. (2007). Performance-complexity tradeoffs of raptor codes over gaussian channels. IEEE Communications Letters, 11(4), 343–345.

    Article  Google Scholar 

  37. AbduiHussein, A. (2008). Efficient decoding and application of rateless codes. PhD thesis, The University of British Columbia.

  38. AbdulHussein, A., Oka, A., & Lampe, L. (2008). Decoding with early termination for raptor codes. IEEE Communications Letters, 12(6), 444–446.

    Article  Google Scholar 

  39. AbdulHussein, A., Oka, A., & Lampe, L. (2008). Decoding with early termination for rateless (luby transform) codes. 2008 IEEE wireless communications and networking conference, WCNC 2008 (pp. 249–254).

  40. Yuan, L. (2012). Performance of min-sum for decoding fountain codes over Biawgn channels. 2012 IEEE 8th international conference on wireless communications, networking and mobile computing (WiCOM) (pp. 1–4).

  41. Liu, X., & Lim, T. J. (2009). Fountain codes over fading relay channels. IEEE Transactions on Wireless Communications, 8(6), 3278–3287.

    Article  Google Scholar 

  42. Singels, R., du Preez, J., & Wolhuter, R. (2013). Soft decoding of raptor codes over AWGN channels using probabilistic graphical models.

  43. Reed, I. S., & Solomon, G. (1960). Polynomial codes over certain finite fields. Journal of the Society for Industrial & Applied Mathematics, 8(2), 300–304.

    Article  MATH  MathSciNet  Google Scholar 

  44. Viterbi, A. (1967). Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory, 13(2), 260–269.

    Article  MATH  Google Scholar 

  45. Wiberg, N. (1996). Codes and decoding on general graphs. PhD thesis, Department of Electrical Engineering Linköping University, S-581 83 Linköping, Sweden.

  46. Forney, G. D, Jr, Koetter, R., Kschischang, F. R., & Reznik, A. (2001). On the effective weights of pseudocodewords for codes defined on graphs with cycles. In Codes, systems, and graphical models (pp. 101–112). Berlin: Springer.

  47. Luby, M. G., Mitzenmacher, M., Shokrollahi, M. A., & Spielman, D. A. (2001). Efficient erasure correcting codes. IEEE Transactions on Information Theory, 47(2), 569–584.

    Article  MATH  MathSciNet  Google Scholar 

  48. Di, C., Proietti, D., Telatar, I. E., Richardson, T. J., & Urbanke, R. L. (2002). Finite-length analysis of low-density parity-check codes on the binary erasure channel. IEEE Transactions on Information Theory, 48(6), 1570–1579.

    Article  MATH  MathSciNet  Google Scholar 

  49. Mirrezaei, S. M., & Yousefi, S. (2012). A new fountain decoder escaping almost all absorbing sets. In 2012 IEEE Globecom workshops (GC Wkshps) (pp. 681–685).

  50. Cavus, E., & Daneshrad, B. (2005). A performance improvement and error floor avoidance technique for belief propagation decoding of LDPC codes. 2005 IEEE 16th international symposium on personal, indoor and mobile radio communications, PIMRC 2005 (vol. 4, pp. 2386–2390). IEEE.

  51. Laendner, S., Hehn, T., Milenkovic, O., & Huber, J. B. (2006). Cth02-4: When does one redundant parity-check equation matter? In 2006 IEEE global telecommunications conference, GLOBECOM’06 (pp. 1–6).

  52. McGregor, A., & Milenkovic, O. (2007). On the hardness of approximating stopping and trapping sets in ldpc codes. 2007 IEEE information theory workshop, ITW’07 (pp. 248–253).

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Amirkabir University of Technology, Hafez Ave., 15914 , Tehran, Iran

    Seyed Masoud Mirrezaei & Karim Faez

  2. Department of Electrical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran

    Seyed Masoud Mirrezaei

  3. Department of Electrical and Robotic Engineering, Shahrood University of Technology, 3619995161 , Shahrood, Iran

    Seyed Masoud Mirrezaei

  4. Department of Electrical and Computer Engineering, Queen’s University, Kingston, Canada

    Shahram Yousefi

Authors
  1. Seyed Masoud Mirrezaei
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Karim Faez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shahram Yousefi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Seyed Masoud Mirrezaei.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mirrezaei, S.M., Faez, K. & Yousefi, S. Towards Fountain Codes. Part II: Belief Propagation Decoding. Wireless Pers Commun 77, 1563–1584 (2014). https://doi.org/10.1007/s11277-014-1646-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-014-1646-x

Keywords

Search

Navigation