EconPapers    
Economics at your fingertips  
 

A review of channel coding schemes in the 5G standard

Navin Kumar (), Deepak Kedia and Gaurav Purohit
Additional contact information
Navin Kumar: GJUS&T
Deepak Kedia: GJUS&T
Gaurav Purohit: CSIR-CEERI

Telecommunication Systems: Modelling, Analysis, Design and Management, 2023, vol. 83, issue 4, No 8, 423-448

Abstract: Abstract The channel in a communication system is usually affected by noise, so channel coding is employed to avoid contamination of data due to noise. Channel coding is a significant and persuasive part of cellular communication systems, which increases the reliability of data transmission by detecting and correcting errors generated in the data while passing through the channel. The fourth generation standard can't achieve desired channel capacity and latency due to its high error floor, which is a challenge. For fifth generation (5G), two different channel coding techniques have been chosen by third generation partnership project for error-free data transmission. In the 5G standard, the data and control channels use low-density parity check (LDPC) and polar codes, respectively, due to their inherent benefits. This paper broadly surveys channel coding techniques varying code rate (R), codeword (N) and message (K) bits for encoding and list size (L) and iterations in decoding for 5G standards. The MATLAB-based simulation helps to find the best channel for the 5G standard considering the bit error rate (BER) and channel capacity performance among additive white Gaussian noise (AWGN), Rayleigh and Rician channels for different channel coding and modulation techniques. The Monte-Carlo simulation shows that the LDPC codes with higher iteration and polar codes with larger list sizes achieve better BER performance keeping the code rate and modulation order lower for the AWGN channel. The simulation findings demonstrate that the distributed cyclic redundancy check successive cancellation list polar decoder outperforms the LDPC min-sum decoder without offset (N = 1024, K = 512, iteration or L = 16) but with offset it enhances LDPC’s BER performance making it suitable for even shorter N.

Keywords: Polar codes; LDPC codes; Non-systematic polar encoder; Systematic polar encoder; Min-sum algorithm; Successive cancellation list decoding (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11235-023-01028-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:telsys:v:83:y:2023:i:4:d:10.1007_s11235-023-01028-y

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11235

DOI: 10.1007/s11235-023-01028-y

Access Statistics for this article

Telecommunication Systems: Modelling, Analysis, Design and Management is currently edited by Muhammad Khan

More articles in Telecommunication Systems: Modelling, Analysis, Design and Management from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:telsys:v:83:y:2023:i:4:d:10.1007_s11235-023-01028-y