Skip to main content

A Hybrid Automatic Repeat reQuest Scheme Based on Maximum Distance Separable Codes

  • Conference paper
  • First Online:
Communications and Networking (ChinaCom 2016)

Abstract

For communication systems, a good error control technology is expected to get higher data transmission rate without reducing the quality of service. This paper presents a Hybrid Automatic Repeat reQuest (HARQ) scheme based on Maximum Distance Separable (MDS) codes to improve the ability of error correction. We divide the file into several segments, i.e., information packets and get a check packet using a kind of MDS codes before we transmit the file. Then we try our best to recover the file with the help of the check packet and information packets at the receiver. It is shown that our proposed HARQ scheme has better Block Error Rate (BLER) performance when compared to the traditional HARQ scheme, but the average slots cost per file does not increase significantly.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Tian, Z., Yuan, D., Liang, Q.: Energy efficiency analysis of error control schemes in wireless sensor networks. In: International Wireless Communications and Mobile Computing Conference, IWCMC 2008, pp. 401–405. IEEE (2008)

    Google Scholar 

  2. de Oliveira Brante, G.G., Uchoa, A.G.D., Souza, R.D.: Cooperative coded partial retransmission scheme using type-I HARQ and LDPC codes. In: IEEE 21st International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC), pp. 123–128. IEEE (2010)

    Google Scholar 

  3. Uzawa, F., Koyama, T., Mitsuyama, K., et al.: PCI reduction method suitable for type-II HARQ with SR-ARQ. In: 2015 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR). IEEE (2015)

    Google Scholar 

  4. Yafeng, W., Lei, Z., Dacheng, Y.: Performance analysis of type III HARQ with Turbo codes. In: IEEE 38th Vehicular Technology Conference, vol. 4, pp. 2740–2744 (2003)

    Google Scholar 

  5. Szczecinski, L., Correa, C., Ahumada, L.: Variable-rate transmission for incremental redundancy hybrid ARQ. In: 2010 IEEE Global Telecommunications Conference, GLOBECOM 2010, pp. 1–5. IEEE (2010)

    Google Scholar 

  6. Sahin, C., Liu, L., Perrins, E.: On the finite blocklength performance of HARQ in modern wireless systems. In: 2014 IEEE Global Communications Conference (GLOBECOM), pp. 3513–3519. IEEE (2014)

    Google Scholar 

  7. Makki, B., Svensson, T., Zorzi, M.: Finite block-length analysis of the incremental redundancy HARQ. IEEE Wirel. Commun. Lett. 3(5), 529–532 (2014)

    Article  Google Scholar 

  8. Krishna, A., Sarwate, D.V.: Pseudocyclic maximum-distance-separable codes. IEEE Trans. Inf. Theory 36(4), 880–884 (1990)

    Article  MathSciNet  Google Scholar 

  9. Solomon, G.: Generation of maximum distance separable codes. In: Proceedings of 1991 IEEE International Symposium on Information Theory (papers in summary form only received) (Cat. No. 91CH3003-1), p. 8. IEEE (1991)

    Google Scholar 

  10. Tolhuizen, L.M.G.M.: On maximum distance separable codes over alphabets of arbitrary size. In: Proceedings of 1994 IEEE International Symposium on Information Theory (1994)

    Google Scholar 

  11. Xu, H., Takawira, F.: A new structure of single parity check product codes. In: 7th AFRICON Conference in Africa, AFRICON, vol. 1, pp. 67–70. IEEE (2004)

    Google Scholar 

  12. Kurkoski, B.M., Yamaguchi, K., Kobayashi, K.: Turbo equalization with single-parity check codes and unequal error protection codes. IEEE Trans. Magn. 42(10), 2579–2581 (2006)

    Article  Google Scholar 

  13. Shen, C., Liu, T., Fitz, M.P.: On the average rate performance of hybrid-ARQ in quasi-static fading channels. IEEE Trans. Commun. 57(11), 3339–3352 (2009)

    Article  Google Scholar 

  14. Chelli, A., Alouini, M.S.: Performance of hybrid-ARQ with incremental redundancy over relay channels. In: 2012 IEEE Globecom Workshops (GC Wkshps), pp. 116–121. IEEE (2012)

    Google Scholar 

  15. Kasami, T., Lin, S.: On the probability of undetected error for the maximum distance separable codes. IEEE Trans. Commun. 32(9), 998–1006 (1984)

    Article  MathSciNet  Google Scholar 

  16. Chee, Y.M., Ji, L., Han, M.K., et al.: Maximum distance separable codes for symbol-pair read channels. IEEE Trans. Inf. Theory 59(11), 7259–7267 (2012)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

This work is supported by the 863 project No. 2015AA01A706, 111 Project of China under Grant B14010, and National Natural Science Foundation of China under Grant No. 61421001.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fei Zesong .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Chenglin, S., Dai, J., Yanbao, Y., Hanxiao, Y., Ce, S., Zesong, F. (2018). A Hybrid Automatic Repeat reQuest Scheme Based on Maximum Distance Separable Codes. In: Chen, Q., Meng, W., Zhao, L. (eds) Communications and Networking. ChinaCom 2016. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 209. Springer, Cham. https://doi.org/10.1007/978-3-319-66625-9_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-66625-9_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-66624-2

  • Online ISBN: 978-3-319-66625-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics