Abstract
Quasi-cyclic low-density parity-check (QC-LDPC) codes are the choice for data channels in the fifth generation (5G) new radio (NR). At the transmitter side, code bits from the QC-LDPC encoder are delivered to the rate matcher. The task of the rate matcher is to select an appropriate number of code bits via puncturing and/or repetition. Code bits that are not selected do not need to be encoded. At the receiver side, the de-rate matcher combines code bits of different transmission attempts and sends them to the QC-LDPC decoder. The output of the QC-LDPC decoder only needs to include necessary systematic bits. Unnecessary systematic bits and parity bits can be completely removed from the decoding process. Taking these considerations into account, a smaller sub-base matrix instead of a full-base matrix can be used in the encoding and decoding process. In this paper, we propose an efficient implementation of QC-LDPC codes for 5G NR. The full-base matrix is pruned before being used. Compared to the traditional schemes, the proposed scheme improves the throughput of QC-LDPC codes in 5G NR.
Highlights
Fifth generation (5G) new radio (NR) is the generation of mobile networks beyond the fourth generation (4G) long term evolution (LTE) [1], [2]. 5G NR supports three scenarios: enhanced mobile broadband, ultra-reliable and low-latency communications and massive machine type communications
This paper proposes an efficient implementation of quasi-cyclic lowdensity parity-check (QC-LDPC) codes for 5G NR
NUMERICAL RESULTS Numerical results are given to compare the throughput and the block error rate (BLER) of the traditional schemes and the proposed scheme
Summary
Fifth generation (5G) new radio (NR) is the generation of mobile networks beyond the fourth generation (4G) long term evolution (LTE) [1], [2]. 5G NR supports three scenarios: enhanced mobile broadband (eMBB), ultra-reliable and low-latency communications (uRLLC) and massive machine type communications (mMTC). BG1 and BG2, are defined to guarantee the decoding performance for full ranges of transport block sizes and code rates. The throughput of QC-LDPC codes can be improved by using a smaller sub-base matrix instead of a full-base matrix. The proposed scheme takes into account the difference in the construction of the sub-base matrix between the encoder and the decoder. LBRM is usually enable to reduce the size of the circular buffer and increase the throughput of the QC-LDPC codes. Let G be the number of code bits available for transmission of the transport block. Since the layered decoding is widely used in QC-LDPC codes [36], [37], this design reduces the decoding latency and improves the system throughput [38], [39]
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have