Abstract

In fifth generation (5G) new radio (NR), the medium access control (MAC) layer organizes the data into the transport block and transmits it to the physical layer. The transport block consists of up to million bits. When the transport block size exceeds a threshold, the transport block is divided into multiple equal size code blocks. The code block consists of up to 8448 bits. Both the transport block and the code block have a cyclic redundancy check (CRC) attached. Due to the difference in the size of the transport block and the code block, the CRC processing scheme suitable for the transport block and that suitable for the code block are different. This chapter gives an overview of the CRC implementation in 5G NR.

Highlights

  • In order to provide high data transmission rates, the bandwidth of mobile communication systems is increasing

  • In fifth generation (5G) new radio (NR), the frequency bands are divided into two parts: frequency range 1 (FR1) below 6 GHz and frequency range 2 (FR2) above 24.25 GHz

  • In this chapter of the book, we focus on the cyclic redundancy check (CRC) implementation in 5G NR

Read more

Summary

Introduction

In order to provide high data transmission rates, the bandwidth of mobile communication systems is increasing. The medium access control (MAC) layer organizes the data into the transport block and transmits it to the physical layer. If the transport block size is larger than 3824, a 16-bit CRC is added at the end of the transport block. A 24-bit CRC is added at the end of the transport block. For quasi-cyclic low-density parity-check code (QC-LDPC) base graph 1, the threshold is equal to 8448. In 5G NR, the maximum code block size number is 8448. An additional 24-bit CRC is added at the end of each code block when there is a segmentation.

System model
Properties of the CRC
CRC implementation by direct calculation
CRC implementation by parallel processing
CRC implementation by serial processing
The Sarwate algorithm
The slicing-by-4 and slicing-by-8 algorithms
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.