Skip to main content
Top
Published in: Wireless Networks 5/2019

29-01-2018

A modified design of Raptor codes for small message length

Authors: Lei Yuan, Jie Pan, Keyan Deng

Published in: Wireless Networks | Issue 5/2019

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Raptor codes are a class of fountain codes which can get capacity-achieving performance over various channels. Traditional Raptor codes can obtain perfect performance for large message length. However, small message length can cause significant performance deterioration. In this paper, a modified design of Raptor codes for small message length is proposed. The proposed Raptor codes are obtained by pre-coding the information symbols by low rate low-density parity-check codes and utilizing a low constant average degree distribution with high intermediate symbol recovery rate. Simulation results demonstrate that, although traditional Raptor codes can get good asymptotical performance, our proposed Raptor codes outperform traditional Raptor codes for small message length over binary erasure channels and binary input additive white Gaussian noise channels.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Footnotes
1
Note that, for the simulation over the AWGN channel in the rest of this section, we let BER and FER denote bit error rate and frame error rate, respectively.
 
Literature
1.
go back to reference MacKay, D. J. C. (2005). Fountain codes. IEE Proceedings Communications, 152(6), 1062–1068.CrossRef MacKay, D. J. C. (2005). Fountain codes. IEE Proceedings Communications, 152(6), 1062–1068.CrossRef
2.
go back to reference Luby, M. (2002). LT codes. In Proceedings of the 2002 IEEE symposium on foundations of computer science (FOCS) (pp. 271–280) Luby, M. (2002). LT codes. In Proceedings of the 2002 IEEE symposium on foundations of computer science (FOCS) (pp. 271–280)
4.
go back to reference Estesami, O., & Shokrollahi, A. (2006). Raptor codes on binary memoryless symmetric channels. IEEE Transactions on Information Theory, 52(5), 2033–2051.MathSciNetCrossRefMATH Estesami, O., & Shokrollahi, A. (2006). Raptor codes on binary memoryless symmetric channels. IEEE Transactions on Information Theory, 52(5), 2033–2051.MathSciNetCrossRefMATH
5.
go back to reference Sørensen, J. H., Koike-Akino, T., Orlik, P., Østergaard, J., & Popovski, P. (2009). Fountain codes over fading relay channels. IEEE Transactions on Wireless Communications, 8(6), 3278–3287.CrossRef Sørensen, J. H., Koike-Akino, T., Orlik, P., Østergaard, J., & Popovski, P. (2009). Fountain codes over fading relay channels. IEEE Transactions on Wireless Communications, 8(6), 3278–3287.CrossRef
6.
go back to reference Sørensen, J. H., Koike-Akino, T., Orlik, P., Østergaard, J., & Popovski, P. (2014). Ripple design of LT codes for BIAWGN channels. IEEE Transactions on Communications, 62(2), 434–441.CrossRef Sørensen, J. H., Koike-Akino, T., Orlik, P., Østergaard, J., & Popovski, P. (2014). Ripple design of LT codes for BIAWGN channels. IEEE Transactions on Communications, 62(2), 434–441.CrossRef
7.
go back to reference Zhang, M., Kim, S., Chang, J. Y., & Kim, W. (2015). Soft decoding method for systematic raptor codes. IET Communications, 9(16), 1933–1940.CrossRef Zhang, M., Kim, S., Chang, J. Y., & Kim, W. (2015). Soft decoding method for systematic raptor codes. IET Communications, 9(16), 1933–1940.CrossRef
8.
go back to reference Hyytiä, E., Tirronen, T., & Virtamo, J. (2007). Optimal degree distribution for LT codes with small message length. In IEEE international conference on computer communications (INFOCOM) (pp. 2576–2580). Hyytiä, E., Tirronen, T., & Virtamo, J. (2007). Optimal degree distribution for LT codes with small message length. In IEEE international conference on computer communications (INFOCOM) (pp. 2576–2580).
9.
go back to reference Sørensen, J. H., Popovski, P., & Østergaard, J. (2012). Design and analysis of LT codes with decreasing ripple size. IEEE Transactions on Communications, 60(11), 3191–3197.CrossRef Sørensen, J. H., Popovski, P., & Østergaard, J. (2012). Design and analysis of LT codes with decreasing ripple size. IEEE Transactions on Communications, 60(11), 3191–3197.CrossRef
10.
go back to reference Yao, W., Yi, B., Huang, T., & Li, W. (2016). Poisson robust soliton distribution for LT codes. IEEE Communications Letters, 20(8), 1499–1502.CrossRef Yao, W., Yi, B., Huang, T., & Li, W. (2016). Poisson robust soliton distribution for LT codes. IEEE Communications Letters, 20(8), 1499–1502.CrossRef
11.
go back to reference Schwarz, H., Marpe, D., & Wiegand, T. (2007). Overview of the scalable video coding extension of the H.264/AVC standard. IEEE Transactions on Circuits and Systems for Video Technology, 17(9), 1103–1120.CrossRef Schwarz, H., Marpe, D., & Wiegand, T. (2007). Overview of the scalable video coding extension of the H.264/AVC standard. IEEE Transactions on Circuits and Systems for Video Technology, 17(9), 1103–1120.CrossRef
12.
go back to reference Anghavi, S. (2007). Intermediate performance of rateless codes. In Proceedings of the 2007 IEEE information theory workgroup (pp. 478–482). Anghavi, S. (2007). Intermediate performance of rateless codes. In Proceedings of the 2007 IEEE information theory workgroup (pp. 478–482).
13.
go back to reference Talari, A., & Rahnavard, N. (2012). On the intermediate symbol recovery rate of rateless codes. IEEE Transactions on Communications, 60(5), 1237–1242.CrossRef Talari, A., & Rahnavard, N. (2012). On the intermediate symbol recovery rate of rateless codes. IEEE Transactions on Communications, 60(5), 1237–1242.CrossRef
14.
go back to reference Li, H., & Marsland, I. D. (2008). A comparison of rateless codes at short block lengths. In IEEE international conference on communications (ICC) (pp. 4483–4488). Li, H., & Marsland, I. D. (2008). A comparison of rateless codes at short block lengths. In IEEE international conference on communications (ICC) (pp. 4483–4488).
15.
go back to reference Luby, M., Mitzenmacher, M., & Shokrollahi, A. (1998). Analysis of random processes via and-or tree evaluation. In Proceedings of the 9th SIAM symposium on discrete algorithms (SODA) (pp. 364–373) Luby, M., Mitzenmacher, M., & Shokrollahi, A. (1998). Analysis of random processes via and-or tree evaluation. In Proceedings of the 9th SIAM symposium on discrete algorithms (SODA) (pp. 364–373)
16.
go back to reference Yuan, L., & An, P. (2010). Design of UEP-raptor codes over BEC. European Transactions on Telecommunications, 21, 30–34. Yuan, L., & An, P. (2010). Design of UEP-raptor codes over BEC. European Transactions on Telecommunications, 21, 30–34.
17.
go back to reference Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2), 182C197.CrossRef Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2), 182C197.CrossRef
18.
go back to reference Venkiah, A., Poulliat, C., & Declercq, D. (2009). Jointly decoded raptor codes: analysis and design for the BIAWGN channel. In EURASIP journal on wireless communications and networking (pp. 1–11) Venkiah, A., Poulliat, C., & Declercq, D. (2009). Jointly decoded raptor codes: analysis and design for the BIAWGN channel. In EURASIP journal on wireless communications and networking (pp. 1–11)
19.
go back to reference Richardson, T., & Urbanke, R. (2008). Modern coding theory. Cambridge: Cambridge University Press.CrossRefMATH Richardson, T., & Urbanke, R. (2008). Modern coding theory. Cambridge: Cambridge University Press.CrossRefMATH
20.
go back to reference Sivasubramanian, B., & Leib, H. (2008). Fixed-rate raptor codes over rician fading channels. IEEE Transactions on Vehicular Technology, 57(6), 3905–3911.CrossRef Sivasubramanian, B., & Leib, H. (2008). Fixed-rate raptor codes over rician fading channels. IEEE Transactions on Vehicular Technology, 57(6), 3905–3911.CrossRef
21.
go back to reference Hu, X.-Y., Eleftheriou, E., & Arnold, D. M. (2005). Regular and irregular progressive edge-growth tanner graphs. IEEE Transactions on Information Theory, 51(1), 386–398.MathSciNetCrossRefMATH Hu, X.-Y., Eleftheriou, E., & Arnold, D. M. (2005). Regular and irregular progressive edge-growth tanner graphs. IEEE Transactions on Information Theory, 51(1), 386–398.MathSciNetCrossRefMATH
Metadata
Title
A modified design of Raptor codes for small message length
Authors
Lei Yuan
Jie Pan
Keyan Deng
Publication date
29-01-2018
Publisher
Springer US
Published in
Wireless Networks / Issue 5/2019
Print ISSN: 1022-0038
Electronic ISSN: 1572-8196
DOI
https://doi.org/10.1007/s11276-018-1674-7

Other articles of this Issue 5/2019

Wireless Networks 5/2019 Go to the issue