Proceedings ArticleDOI
Comparative Study of Channel Coding Schemes for 5G
Walled Khalid Abdulwahab,Abdulkareem Abdulrahman Kadhim +1 more
- Vol. 8, Iss: 3, pp 95
TLDR
Looking into 5G requirements for channel coding and candidate channel coding schemes for 5G, it seems that polar code with Successive Cancellation List (SCL) decoding using small list length is a promising choice for short message lengths due to its error performance and relatively low complexity.Abstract:
In this paper we look into 5G requirements for channel coding and review candidate channel coding schemes for 5G. A comparative study is presented for possible channel coding candidates of 5G covering Convolutional, Turbo, Low Density Parity Check (LDPC), and Polar codes. It seems that polar code with Successive Cancellation List (SCL) decoding using small list length (such as 8) is a promising choice for short message lengths (≤128 bits) due to its error performance and relatively low complexity. Also adopting non-binary LDPC can provide good performance on the expense of increased complexity but with better spectral efficiency. Considering the implementation, polar code with decoding algorithms based on SCL required small area and low power consumption when compared to LDPC codes. For larger message lengths (≥256 bits) turbo code can provide better performance at low coding rates (<1/2)read more
Citations
More filters
Proceedings ArticleDOI
Coding Techniques for 5G Networks: A Review
TL;DR: In 5G NR (New Radio) LDPC codes used for the data channel and control channel Polar Codes are used and high Coding gain is got for this code.
Journal ArticleDOI
Intelligent Covert Satellite Communication for Military Robot Swarm
TL;DR: A multi-carrier intelligent covert satellite communication architecture based on electromagnetic environment sensing technology, in where the ability of dynamically adapting the system configuration to the holistic requirements of covertness, performance, and complexity can be considerably improved.
Journal ArticleDOI
Deployment of Polar Codes for Mission-Critical Machine-Type Communication Over Wireless Networks
R. Manjula Devi,Madhumita Premkumar,Pradeep Jangir,Mohamed Abdelghany Elkotb,Rajvikram Madurai Elavarasan,Kottakkaran Sooppy Nisar +5 more
Proceedings ArticleDOI
Discrete Polar Decoder using Information Bottleneck Method
Akira Yamada,Tomoaki Ohtsuki +1 more
TL;DR: The information bottleneck method is used for the BP decode of polar codes and the error correcting capability of the discrete polar decoders of the proposed method is negligibly degraded compared to the BP decoding without compression.
Proceedings ArticleDOI
Performance evaluation of coding schemes for 5G Communication under different channel setting
TL;DR: It is observed that coded transmission outperforms uncoded once in terms of bit error rate, and this paper simulates uncoded and coded massive MIMO system with perfect and imperfect channel state information.
References
More filters
Journal ArticleDOI
Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
TL;DR: The paper proves that, given any B-DMC W with I(W) > 0 and any target rate R< I( W) there exists a sequence of polar codes {Cfrn;nges1} such that Cfrn has block-length N=2n, rate ges R, and probability of block error under successive cancellation decoding bounded as Pe(N,R) les O(N-1/4) independently of the code rate.
Journal ArticleDOI
Near Shannon limit performance of low density parity check codes
TL;DR: The authors report the empirical performance of Gallager's low density parity check codes on Gaussian channels, showing that performance substantially better than that of standard convolutional and concatenated codes can be achieved.
Journal ArticleDOI
Low-density parity check codes over GF(q)
TL;DR: A significant improvement over the performance of the binary codes is found, including a rate 1/4 code with bit error probability <10/sup -5/ at E/sub b//N/sub 0/=0.2 dB.
Proceedings ArticleDOI
Low density parity check codes over GF(q)
TL;DR: The results of Monte Carlo simulations of the decoding of infinite LDPC codes which can be used to obtain good constructions for finite codes and empirical results for the Gaussian channel are presented.