Journal of Information and Telecommunication

A hybrid of machine learning based early termination and optimal scaling factor scheme for 5G LDPC codes

Madhavsingh Indoonundon, Tulsi Pawan Fowdur

Published Sep 25, 2025• 0 citations

Abstract

Machine Learning (ML) has proven to be an effective tool for optimizing several aspects of channel codes in communication systems. In this work, ML-based schemes have been adapted to the 5G New Radio (NR) Low-Density Parity Check (LDPC) codes to help them meet the stringent requirements of ultra-reliable low-latency communications (URLLC) in 5G NR. Furthermore, enhancements to the modulation schemes have also been applied to attempt to outperform the complex and robust Layered Belief Propagation Algorithm (LBPA) using the lower complexity Normalized Min-Sum Algorithm (NMSA) decoder. By combining the ML-based schemes and the enhanced modulation schemes, NMSA effectively provided Eb/N0 gains of up to 1 dB and latency reductions of up to 0.53 ms compared to the conventional Layered Belief Propagation Algorithm.

DOI: 10.1080/24751839.2025.2556086

Related papers

Neural Layered Decoding of 5G LDPC Codes

Nemin Shah, Yash M. Vasavada

In this letter, we propose various low-complexity neural layered min-sum (NLMS) algorithms to improve the decoding performance of the fifth generation (5G) new radio (NR) low-density parity-check (LDPC) codes. Our proposals are based on the computationally-efficient normalized offset min-sum (NOMS) approach for the layered belief propagation (LBP). The main novelty of our proposals is a deep neural network (DNN) that implements the layered mode decoding and that additionally learns the normalization and the offset parameters of the NOMS scheme. The schemes that we propose use the DNN as well as adaptation and filtering for estimating the optimum values of these parameters. We show by simulation that our proposed decoders achieve a significant computational benefit compared to the standard (non-neural) LBP decoder without an appreciable performance penalty.

IEEE Communications LettersSep 16, 202124 citations

Optimizing LDPC Decoding with Machine Learning Using Learnable Weights: A Hybrid Framework Integrating Neural Networks with Iterative Message-Passing for Enhanced Error-Correction in 5G Systems

Niklas Savijoki

This thesis investigates the optimization of Low-Density Parity-Check (LDPC) decoding through machine learning techniques, with a specific focus on 5G communication systems. Traditional LDPC decoding algorithms face a critical trade-off: Belief Propagation (BP) offers excellent error-correction performance but with high computational complexity, while Min-Sum (MS) reduces complexity at the cost of degraded performance. To address this limitation, a hybrid neural network architecture is proposed that incorporates learnable normalization and offset weights into the message-passing framework of LDPC decoders. This approach integrates multiplicative (normalization) and additive (offset) weights into the Tanner graph structure, allowing the decoder to adapt to specific channel conditions. A novel weighted binary cross-entropy loss function is developed that prioritizes entire block recovery by assigning different importance to information and parity bits during training. Experimental results demonstrate that ML-assisted decoder consistently outperforms conventional Min-Sum decoding, approaching the error-correction capability of Belief Propagation while maintaining comparable computational efficiency to Min-Sum. Comprehensive evaluations across different weight configurations (scalar and vector-based) reveal that increased parametrization generally improves decoding performance. Analysis of the impact of iteration counts shows that the optimal number of decoding iterations varies between different code configurations with studied Basegraph 1 case requiring 15 iterations for optimal performance while studied Basegraph 2 case benefits significantly from 20 iterations. The proposed ML-assisted LDPC decoder represents a significant advancement for 5G systems, offering improved error correction at lower signal strengths while balancing latency and computational requirements. This research contributes to the ongoing evolution of wireless technology by demonstrating how machine learning can effectively enhance traditional decoding algorithms, providing a practical pathway toward more efficient and adaptive error correction in modern communication systems.

Jan 1, 20250 citations

Performance Simulation of a Layered QC-LDPC Decoder for URLLC Applications

Bilal Mejmaa, Chakir Aqil, Ismail Akharraz +1 more

This research investigates the simulation performance of a layered Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) decoder intended for Ultra-Reliable Low-Latency Communication (URLLC) applications in 5G New-Radio (NR) standards. The proposed work focuses on short block-length QC-LDPC codes (280,176) to meet the dual challenge of achieving ultra-low latency (<1ms) while maintaining high reliability. LDPC codes have traditionally excelled at longer code lengths; this study demonstrates the effectiveness of LDPC codes in short-length contexts through architectural optimization utilizing a layered decoding approach, which provides improved convergence speed and reduced latency compared to traditional flooding techniques. The baseline QC-LDPC decoder performs better in terms of Bit Error Rate (BER) and Block Error Rate (BLER) with only 7 iterations. For a target BLER of 10−2, the decoder outperforms reference shorter codes (K40, K64) with an Eb/No gain of up to 0.9 dB.

Jul 1, 20260 citations

Neural Self-Corrected Min-Sum Decoder for NR LDPC Codes

Taehyun Kim, Joo Sung Park

In this letter, a neural self-corrected min-sum (NSCMS) decoder is proposed for 5G new radio (NR) low-density parity-check (LDPC) codes. Training in real-time on a rapidly changing channel requires low latency and minimal resource utilization. Unfortunately, typical neural decoders for LDPC codes use large and deep neural networks proportional to the code length, leading to latency and resource problems. In the network of NSCMS similar to network model pruning, certain nodes meeting the self correction condition are deleted and excluded from learning. This reduces the computational complexity of learning, compared to conventional networks. Thus, the NSCMS decoder has high practicality in real-time training using machine learning. Furthermore, self-correction allows for more reliable message-based learning and significantly improves performance. Simulation results demonstrate that NSCMS decoders exhibit lower error rates than previously proposed min-sum decoders.

IEEE Communications LettersMay 22, 20247 citations

Performance Simulation of a Layered QC-LDPC Decoder for URLLC Applications

Bilal Mejmaa, Chakir Aqil, Ismail Akharraz +1 more

This research investigates the simulation performance of a layered Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) decoder intended for Ultra-Reliable Low-Latency Communication (URLLC) applications in 5G New-Radio (NR) standards. The proposed work focuses on short block-length QC-LDPC codes (280,176) to meet the dual challenge of achieving ultra-low latency (<1ms) while maintaining high reliability. LDPC codes have traditionally excelled at longer code lengths; this study demonstrates the effectiveness of LDPC codes in short-length contexts through architectural optimization utilizing a layered decoding approach, which provides improved convergence speed and reduced latency compared to traditional flooding techniques. The baseline QC-LDPC decoder performs better in terms of Bit Error Rate (BER) and Block Error Rate (BLER) with only 7 iterations. For a target BLER of 10 −2 , the decoder outperforms reference shorter codes (K40, K64) with an E b /N o gain of up to 0.9 dB.

EPJ Web of ConferencesJan 1, 20260 citations

Improving Short-Block LDPC Decoding Using Perturbation-Based Rescue with Maximum Likelihood Based Candidate Validation

Haider Abdulkarim, Hussein Khaleel, Marwa K. Farhan

Abstract Meeting the latency and reliability requirements of 5G Ultra-Reliable Low-Latency Communications (URLLC) is enabled through the adoption of short-block Low-Density Parity-Check (LDPC) codes. Traditional decoding of short-block LDPC using Belief Propagation (BP) may fail due to trapping sets, resulting in degraded decoding performance. This paper proposes a three-stage decoding algorithm that combines low-iteration BP decoding, a perturbation-based rescue process, and Maximum Likelihood (ML) based candidate validation to improve decoding reliability. When the low-iteration BP decoding stage fails to converge, the rescue stage perturbs the least reliable bits to generate multiple decoding candidates, which are subsequently evaluated using an ML-based metric to select the most likely candidate and reduce miscorrections. The proposed algorithm was evaluated through MATLAB simulations with a short-block LDPC configuration for 5G URLLC systems. QAM modulation was used and two channel models were considered, Additive White Gaussian Noise and flat Rayleigh fading. The performance was investigated for different numbers of perturbed bits and different coding rates. The results show improved decoding performance compared to standard LDPC, achieving coding gains exceeding 1 dB at low bit error rates while reducing decoding failures caused by trapping sets.

Oct 12, 20260 citations