Skip to main content

Bounds on the Finite-Length RaptorQ Codes Under Maximum Likelihood Decoding

  • Conference paper
  • First Online:
Communications, Signal Processing, and Systems (CSPS 2017)

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 463))

  • 140 Accesses

Abstract

In this paper, we analysis the maximum likelihood (ML) decoding failure probability (DFP) of finite length RaptorQ codes with a high-order low density generator-matrix (LDGM) code as the pre-code. By investigating the rank of the product of two random coefficient matrices, we derive upper and lower bounds of DFP on the RaptorQ codes under ML decoding algorithm. Finally, we verify the accuracy of derived theoretical bounds through the Monte Carlo simulations with different degree distributions. The high accuracy bounds can be used to design near-optimum RaptorQ codes with short and moderate lengths.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Boccardi, F., Heath, R.W., Lozano, A., Marzetta, T.L., Popovski, P.: Five disruptive technology directions for 5G. IEEE Commun. Mag. 52(2), 74–80 (2014)

    Google Scholar 

  2. Durisi, G., Koch, T., Popovski, P.: Toward massive, ultrareliable, and low-latency wireless communication with short packets. Proc. IEEE 104(9), 1711–1726 (2016)

    Google Scholar 

  3. Polyanskiy, Y., Poor, H.V., Verdú, S.: Channel coding rate in the finite blocklength regime. IEEE Trans. Inf. Theory 56(5), 2307–2359 (2010)

    Google Scholar 

  4. Luby, M.G.: LT codes. In: 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 271–280. IEEE Computer Society (2002)

    Google Scholar 

  5. Shokrollahi, A.: Raptor codes. IEEE Trans. Inf. Theory 52(6), 2551–2567 (2002)

    Google Scholar 

  6. Nie S.X., Gu S.S., Jiao J., Xiang W., Zhang Q.Y.: A novel systematic raptor network coding scheme for Mars-to-Earth relay communications. In: 2016 IEEE Wireless Communications and Networking Conference (WCNC), Qatar (2016)

    Google Scholar 

  7. Jiao, J., Abbas, R., Li, Y., Zhang, Q.Y.: Multiple access rateless network coding for machine-to-machine communications. ZTE Commun. 14(4), 35–41 (2016)

    Google Scholar 

  8. Gul, M.T., Ali, A., Singh, D.K., et al.: Merge-and-forward: a cooperative multimedia transmissions protocol using raptorQ codes. IET Commun. 10(15), 1884–1895 (2016)

    Google Scholar 

  9. Wang, P., Mao, G., Lin, Z., et al.: Performance analysis of raptor codes under maximum likelihood decoding. IEEE Trans. Commun. 64(3), 906–917 (2015)

    Google Scholar 

  10. Schotsch, B., Garrammone, G., Vary, P.: Analysis of LT codes over finite fields under optimal erasure decoding. IEEE Commun. Lett. 17(9), 1826–1829 (2013)

    Google Scholar 

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

    Google Scholar 

  12. Pandya, A., Trapasiya, S.: AL-FEC raptor code implementation over 3GPP eMBMS network. Int. J. Electron. Commun. Technol. 4(4), 37–42 (2013)

    Google Scholar 

Download references

Acknowledgment

This work was supported in part by the National Natural Sciences Foundation of China (NSFC) under Grant 61771158, 61701136, 61525103 and 61371102, and the Shenzhen Basic Research Program under Grant JCYJ20160328163327348 and JCYJ20150930150304185.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jian Jiao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, K., Jiao, J., Gu, S., Wu, S., Zhang, Q. (2019). Bounds on the Finite-Length RaptorQ Codes Under Maximum Likelihood Decoding. In: Liang, Q., Mu, J., Jia, M., Wang, W., Feng, X., Zhang, B. (eds) Communications, Signal Processing, and Systems. CSPS 2017. Lecture Notes in Electrical Engineering, vol 463. Springer, Singapore. https://doi.org/10.1007/978-981-10-6571-2_101

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-6571-2_101

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-6570-5

  • Online ISBN: 978-981-10-6571-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics