Skip to main content
Log in

Fountain Codes and Their Applications: Comparison and Implementation for Wireless Applications

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Fountain codes are rateless erasure codes that have initially been designed for multicast and streaming applications. They provide dynamic code rates which are defined by the channel conditions. Subsequently, fountain codes have also demonstrated their benefits for transmissions over wireless channels. With fountain codes, feedback channel deployment can be reduced which could reduce collisions in half-duplex systems. Contrary to previous research on fountain codes that focused on defining the theoretical bound of code rate and complexity, in this paper, we would like to put them into practice by extending their performance evaluation in two other aspects. First, we would like to investigate the implementation process of fountain codes in a real-world deployment including header analysis, packet layout investigation as well as implementation cost. Next, contrary to previous works that aim at defining code rate after decoding completion, in this work, we would like to focus on the partial decoding capabilities of fountain codes. This metric could be used for performance evolution for transmissions over degraded channel conditions found in the wireless applications. We discussed and compared in this paper several types of fountain codes including LDPC, LT, Raptor, etc.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17

Similar content being viewed by others

References

  1. Apavatjrut, A., Goursaud, C., Jaffres-Runser, K., Comaniciu, C., & Gorce, J. (2011). Toward increasing packet diversity for relaying lt fountain codes in wireless sensor networks. IEEE Communications Letters, 15(1), 52–54. https://doi.org/10.1109/LCOMM.2010.111910.101692

    Article  Google Scholar 

  2. Chanayai, S., & Apavatjrut, A. (2017). Analysis of header management for lt codes in iots networks. In 2017 21st International Computer Science and Engineering Conference (ICSEC) (pp. 1–5). https://doi.org/10.1109/ICSEC.2017.8443960.

  3. Gallager, R. (1962). Low-density parity-check codes. IRE Transactions on Information Theory, 8(1), 21–28. https://doi.org/10.1109/TIT.1962.1057683

    Article  MathSciNet  MATH  Google Scholar 

  4. Luby, M. (2002). LT codes. The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., pp. 271-280. https://doi.org/10.1109/SFCS.2002.1181950

  5. Paolini, E., Liva, G., Matuz, B., & Chiani, M. (2012). Maximum likelihood erasure decoding of ldpc codes: Pivoting algorithms and code design. IEEE Transactions on Communications, 60(11), 3209–3220. https://doi.org/10.1109/TCOMM.2012.081012.110363

    Article  Google Scholar 

  6. Shokrollahi, A. (2006). Raptor codes. IEEE Transactions on Information Theory, 52(6), 2551–2567. https://doi.org/10.1109/TIT.2006.874390

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Anya Apavatjrut.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chanayai, S., Apavatjrut, A. Fountain Codes and Their Applications: Comparison and Implementation for Wireless Applications. Wireless Pers Commun 121, 1979–1994 (2021). https://doi.org/10.1007/s11277-021-08749-w

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-021-08749-w

Keywords

Navigation