Home > Published Issues > 2022 > Volume 17, No. 5, May 2022 >

High-Performance and Low-Complexity Decoding Algorithms for 5G Low-Density Parity-Check Codes

Bich Ngoc Tran-Thi 1,2, Thien Truong Nguyen-Ly1, and Trang Hoang1
1. Department of Electronics Engineering, Faculty of Electrical and Electronics Engineering. Ho Chi Minh City University of Technology (HCMUT), 268 Ly Thuong Kiet Street, District 10, Ho Chi Minh City Vietnam National University, Linh Trung Ward, Thu Duc District, Ho Chi Minh City, Vietnam
2. Faculty of Electrical and Electronics Engineering, Vietnam Aviation Academy, Vietnam

Abstract —The development of the Fifth Generation (5G) New Radio (NR) provides several significant advantages when compared to the fourth generation (4G) Long Term Evolution (LTE) in mobile communications. Due to the outstanding characteristics of Low-Density Parity-Check (LDPC) codes such as high decoding performance, high throughput, low complexity, they have been accepted as the standard codes for the 5G NR. In this paper, we propose two LDPC decoding algorithms: Hybrid Offset Min-Sum (HOMS) and Variable Offset Min-Sum (VOMS), which are aimed at improving the error correction performance. The main idea of the HOMS/VOMS algorithm is to apply modified factors to both variable-nodes and check-nodes updated processing in order to compensate the extrinsic messages overestimation of the MS-based algorithms and increase the protection ability for degree-1 variable-nodes. The simulation results show that at the Bit-Error-Rate (BER) of 10-5, the proposed HOMS/VOMS algorithm achieves the decoding gain up to 0.2 dB compared to the Offset Min-Sum (OMS) algorithm, with a slight increase in decoding complexity.
Index Terms—LDPC codes, 5G New Radio, Belief propagation, Min-Sum decoding, Offset Min-Sum decoding

Cite: Bich Ngoc Tran-Thi, Thien Truong Nguyen-Ly, and Trang Hoang, "High-Performance and Low-Complexity Decoding Algorithms for 5G Low-Density Parity-Check Codes," Journal of Communications vol. 17, no. 5, pp. 358-364, May 2022. Doi: 10.12720/jcm.17.5.358-364

Copyright © 2022 by the authors. This is an open access article distributed under the Creative Commons Attribution License (CC BY-NC-ND 4.0), which permits use, distribution and reproduction in any medium, provided that the article is properly cited, the use is non-commercial and no modifications or adaptations are made.