Skip to main content
Log in

Patching Based Extra Short Packet Forward Error Control Coding for Ultra-Reliable Low Latency Communications (URLLC) in 5G

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Extra short packets are common in the 5G Internet which provides low latency, ultra-reliable services for applications such as autonomous driving, remote surgery, industry automation, to name just a few. The multitude number of low cost devices cannot afford to run high power forward error control coding algorithms, such as Turbo codes, LDPC codes, Polar codes, and so on, to meet the stringent requirements of ultra-reliability and extremely low latency. In this paper, we propose using patching as the basis for forward error control coding of extra short packets, where replicas of a packet along with its checksum are transmitted adaptively. At the receiver, we propose using dynamic formation of a full packet based on the theory of Finite Projective Plane. The newly formed packet is then checked for being non-faulty. The approach of patching with dynamic formation of a full packet is systematic and well suitable for extra short packets. Despite the fact that the proposed coding scheme provides lower coding rate for a fixed packet error rate in comparison to the Polar codes and LDPC codes, the main advantages lie in its flexibility and simplicity of processing ideal for asymmetric configuration with low power receiving devices providing ultra-reliable low latency communications.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Similar content being viewed by others

Availability of data and material

The data set generated during and/or analyzed during the current study are available from the corresponding author on reasonable request.

Code availability

All MATLAB codes can be provided by sending requests to the corresponding author.

References

  1. Promwongsa, N., et al. (2021). A comprehensive survey of the tactile internet: state-of-the-art and research directions. IEEE Communications Surveys and Tutorials, 23(1), 472–523.

    Article  Google Scholar 

  2. Akyildiz, I. F., et al. (2020). 6G and beyond: The future of wireless communications systems. IEEE Access, 8, 133995–134026.

    Article  Google Scholar 

  3. Durisi, G., Koch, T., & Popovski, P. (2016). Toward massive, ultra-reliable, and low-latency wireless communication with short packets. Proceedings of the IEEE, 104(9), 1711–1726.

    Article  Google Scholar 

  4. “3GPP TS 22.261 (2018) Service requirements for the 5G system; Stage 1 (Release 16),” In 3rd generation partnership project, technical specification group services and system aspects.

  5. “R1-1804849 (2018). Remaining issues on URLLC data channel coding,” In 3rd generation partnership project, 3GPP TSG RAN WG1 meeting #92bis–Discussion and Decision.

  6. Shirvanimoghaddam, M., Mohammadi, M. S., Abbas, R., Minja, A., Yue, C., Matuz, B., Han, G., Lin, Z., Liu, W., Li, Y., Johnson, S., & Vucetic, B. (2019). Short block-length codes for ultra-reliable low latency communications. IEEE Communications Magazine, 57(2), 130–137.

    Article  Google Scholar 

  7. Hamming, R. (1950). Error detecting and error correcting codes. Bell System Technical Journal, 29, 147–160.

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  9. Berrou, C., Glavieux, A., & Thitimajshima, P. (1993). “Near shannon limit error-correcting coding and decoding: turbo-codes,” In Proceedings of IEEE international conference on communications (ICC 1993), vol. 2, pp. 1064–1072.

  10. Gallagher, R. (1961). “Low density parity check codes,” Ph.D. thesis, M.I.T.

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

    Article  MathSciNet  Google Scholar 

  12. Byers, J. W., Luby, M., Mitzenmacher, M., & Rege, A. (1998). “A digital fountain approach to reliable distribution of bulk data,” In Proceedings of the ACM SIGCOMM, pp. 56–67. Vancouver, BC, Canada.

  13. Luby, M. (2002). “LT-codes,” In Proceedings of the 43rd Annual IEEE symposium, foundations of computer science (FOCS), pp. 271–280. Vancouver, BC, Canada.

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

    Article  MathSciNet  Google Scholar 

  15. Cassuto, Y., & Shokrollahi, A. (2015). Online fountain codes with low overhead. IEEE Transactions on. Information Theory, 61(6), 3137–3148.

    Article  MathSciNet  Google Scholar 

  16. Arıkan, E. (2009). Channel polarization: A method for constructing capacity achieving codes for symmetric binary-input memoryless channels. IEEE Transactions on Information Theory, 55(7), 3051–3073.

    Article  MathSciNet  Google Scholar 

  17. Erseghe, T. (2016). Coding in the finite-block length regime: bounds based on laplace integrals and their asymptotic approximations. IEEE Transactions on Information Theory, 62(12), 6854–6883.

    Article  MathSciNet  Google Scholar 

  18. Woo, T. K. (2017). Segment combining and patching for short packet forward error control coding. Wireless Personal Communications, 97(4), 6425–6439.

    Article  Google Scholar 

  19. Hughes, D. R., & Piper, F. (1973). Projective Planes. Berlin: Springer-Verlag.

    MATH  Google Scholar 

  20. Bruck, R. H., & Ryser, H. J. (1949). The Nonexistence of Certain Finite Projective Planes. Canadian Journal of Mathematics., 1, 88–93.

    Article  MathSciNet  Google Scholar 

  21. Parker, E. T. (1959). Construction of some sets of mutually orthogonal latin squares. Proceedings of the American Mathematical Society, 10, 946–949.

    Article  MathSciNet  Google Scholar 

  22. Aijaz, A. (2018). Toward human-in-the-loop mobile networks: A radio resource allocation perspective on haptic communications. IEEE Transactions on Wireless Communications, 17(7), 4493–4508.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tai-Kuo Woo.

Ethics declarations

Conflict of interest

There is no conflict of interest.

Additional information

Publisher's Note

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

Appendix

Appendix

We list the sets for FPP of \(N\) points, where \(N\) = 7,13, and 21, respectively as follows.

1.1 \({\varvec{N}} = 7\)

The sets for a FPP of 7 points are as follows. (1, 2, 3), (1, 4, 5), (1, 6, 7), (2, 4, 6), (2, 5, 7), (3, 5, 6), and (3, 4, 7); The sets that share a common point from 1 to 7 are as follow. \(C_{1} = \left( {1,2,3} \right)\), \(C_{2} = \left( {1,4,5} \right)\), \(C_{3} = \left( {1,6,7} \right)\), \(C_{4}\) = (2,4,7), \(C_{5} = \left( {2,5,6} \right)\), \(C_{6} = \left( {3,4,6} \right)\), and \(C_{7} = \left( {3,5,7} \right)\), where \(C_{i}\) contains the set numbers that share the common point “i.”

1.2 \({\varvec{N}} = 13\)

A FPP of 13 points includes the following 13 sets of points: (1, 2, 3, 4), (1, 5, 6, 7), (1, 8, 9, 10), (1, 11, 12, 13), (2, 5, 8, 11), (2, 6, 9, 12), (2, 7, 10, 13), (3, 5, 10, 12), (3, 6, 8, 13), (3, 7, 9, 11), (4, 5, 9, 13), (4, 6, 10, 11), and (4, 7, 8, 12). The sets that share a common point, from 1 to 13 are as follows.

\(C_{1} = \left( {1,2,3,4} \right)\), \(C_{2} = \left( {1,5,6,7} \right)\), \(C_{3} = \left( {1,8,9,10} \right)\), \(C_{4} = \left( {1,11,12,13} \right)\),

\(C_{5} = \left( {2,5,8,11} \right)\), \(C_{6} = \left( {2,6,9,12} \right)\), \(C_{7} = \left( {2,7,10,13} \right)\), \(C_{8} = \left( {3,5,9,13} \right)\),

\(C_{9} = \left( {3,6,10,11} \right)\), \(C_{10} = \left( {3,7,8,12} \right)\), \(C_{11} = \left( {4,6,10,12} \right)\), \(C_{12} = \left( {4,6,8,13} \right)\),

\(C_{13} = \left( {4,7,9,11} \right)\).

1.3 \({\varvec{N}} = 21\)

A FPP of 21 points includes the following 21 sets: (1, 2, 3, 4, 5), (1, 6, 7, 8, 9), (1, 10, 11, 12, 13), (1, 14, 15, 16, 17), (1, 18, 19, 20, 21), (2, 6, 10, 14, 18), (2, 7, 11, 15, 19), (2, 8, 12, 16, 20), (2, 9, 13, 17, 21), (3, 6, 11, 16, 21), (3, 7, 10, 17, 20), (3, 8, 13, 14, 19), (3, 9, 12, 15, 18), (4, 6, 12, 17, 19), (4, 7, 13, 16, 18), (4, 8, 10, 15, 21), (4, 9, 11, 14, 20), (5, 6, 13, 15, 20), (5, 7, 12, 14, 21), (5, 8, 11, 17, 18), and (5, 9, 10, 16, 19). The sets of points that share a common point from point 1 to point 21, are as follows.

\(C_{1} = \left( {1,2,3,4,5} \right)\), \(C_{2} = \left( {1,6,7,8,9} \right)\) \(C_{3} = \left( {1,10,11,12,13} \right),\) \(C_{4} = \left( {1,14,15,16,17} \right)\), \(C_{5} = \left( {1,18,19,20,21} \right)\), \(C_{6} = \left( {2,6,10,14,18} \right)\), \(C_{7} = \left( {2,7,11,15,19} \right)\),

\(C_{8} = \left( {2,8,12,16,20} \right)\), \(C_{9} = \left( {2,9,13,17,21} \right)\), \(C_{10} = \left( {3,6,11,16,21} \right)\),

\(C_{11} = \left( {3,7,10,17,20} \right)\), \(C_{12} = \left( {3,8,13,14,19} \right)\), \(C_{13} = \left( {3,9,12,15,18} \right)\),

\(C_{14} = \left( {4,6,12,17,19} \right)\), \(C_{15} = \left( {4,7,13,16,18} \right)\), \(C_{16} = \left( {4,8,10,15,21} \right)\),

\(C_{17} = \left( {4,9,11,14,20} \right)\), \(C_{18} = \left( {5,6,13,15,20} \right)\), \(C_{19} = \left( {5,7,12,14,21} \right)\),

\(C_{20} = \left( {5,8,11,17,18} \right)\), \(C_{21} = \left( {5,9,10,16,19} \right)\).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Woo, TK. Patching Based Extra Short Packet Forward Error Control Coding for Ultra-Reliable Low Latency Communications (URLLC) in 5G. Wireless Pers Commun 121, 2159–2180 (2021). https://doi.org/10.1007/s11277-021-08815-3

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-021-08815-3

Keywords