Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Wireless Communications

AI-Driven Rate-Adaptive LDPC Coding and Decoding

Xiyu Wang, Yukun Cheng, Wei Ren Chen, Lun Li, Bo Ai

Published Jan 1, 2026• 0 citations
Publisher

Abstract

Artificial intelligence (AI)–driven channel coding has emerged as a promising solution for enhancing error correction performance and reducing decoding complexity, particularly in the context of Low-Density Parity-Check (LDPC) codes. Unlike traditional coding-theory-based encoding and decoding methods, AI-driven approaches optimise codeword design in a data-driven manner under conditions where classical techniques have limitations, e.g., LDPC codes with limited block lengths and finite decoding complexity. AI-designed LDPC codewords and AI-based decoding algorithms are usually optimised for a given block length or code rate, and cannot be directly applied to different block lengths or rates. To this end, this article presents an AI-driven rate-adaptive LDPC coding framework that incorporates a parameter-sharing mechanism within the encoder and decoder, trained via multi-task learning to support multiple code rates. Preliminary evaluations in AWGN channels validate the feasibility of such a design and demonstrate its promising error-correction potential and adaptability. In this article, we present key design principles, emphasise their advantages, and discuss the future research challenges that remain.

DOI
10.1109/mwc.2026.3723359

Related papers

Rate Compatible LDPC Neural Decoding Network: A Multi-Task Learning Approach

Yukun Cheng, Wei Ren Chen, Lun Li +1 more

Deep learning based decoding networks have shown significant improvement in decoding low density parity check (LDPC) codes, but the neural decoders are limited by rate-matching operations such as puncturing or extending, thus needing to train multiple decoders with different code rates for a variety of channel conditions. In this correspondence, we propose a Multi-Task Learning based rate-compatible LDPC decoding network, which utilizes the structure of raptor-like LDPC codes and can deal with multiple code rates. In the proposed network, different portions of parameters are activated to deal with distinct code rates, which leads to parameter sharing among tasks. Numerical experiments demonstrate the effectiveness of the proposed method. Training the specially designed network under multiple code rates makes the decoder compatible with multiple code rates without sacrificing frame error rate performance.

arXiv:2310.06256•IEEE Transactions on Vehicular Technology•Dec 19, 2023•10 citations

Optimized decoder for low-density parity check codes based on genetic algorithms

Hajar El Ouakili, Mohammed El Ghzaoui, Rachid El Alami

Low-density parity check (LDPC) codes, are a family of error-correcting codes, their performances close to the Shannon limit make them very attractive solutions for digital communication systems. There are several algorithms for decoding LDPC codes that show great diversity in terms of performance related to error correction. Also, very recently, many research papers involved the genetic algorithm (GA) in coding theory, in particular, in the decoding linear block codes case, which has heavily contributed to reducing the bit error rate (BER). In this paper, an efficient method based on the GA is proposed and it is used to improve the power of correction in terms of BER and the frame error rate (FER) of LDPC codes. Subsequently, the proposed algorithm can independently decide the most suitable moment to stop the decoding process, moreover, it does not require channel information (CSI) making it adaptable for all types of channels with different noise or intensity. The simulations show that the proposed algorithm is more efficient in terms of BER compared to other LDPC code decoders.

International Journal of Power Electronics and Drive Systems/International Journal of Electrical and Computer Engineering•Apr 4, 2024•0 citations

Neural Network-Based Iterative Decoding, Code Design, and Erasure Correction of Low-Density Parity-Check Codes

Xin Wei Xiao

Low-density parity-check (LDPC) codes have been one of the most popular error correction candidates in modern communication and data storage systems for the past three decades due to their capacity-approaching error correction capability under the Belief Propagation (BP) decoding algorithms. In this dissertation, we investigate three topics related to efficient and effective decoding algorithms and the code design of LDPC codes. In the first part of this dissertation, we propose a methodology with the help of artificial intelligence to design Finite Alphabet Iterative Decoders (FAID) for LDPC codes, which are not only of great theoretical but also practical importance. This model-driven neural network (NN) framework unfolds the decoding iterations, introduces quantized neural networks (QNN) to model the FAIDs, and proposes a new cost function, namely, bit error rate (BER), to address the inefficiency in discrete-output channel scenarios. The low precision activations in the QNN and quantization in the cost functions cause a critical issue that their gradients vanish almost everywhere, making it difficult to use classical backward propagation. We design and leverage straight-through estimators as surrogate gradients to tackle this issue and provide a joint training scheme. These QNN-aided FAIDs, are capable of surpassing the floating-point BP algorithms, with much lower complexity and faster convergence. The QNN-aided approach is general, as it can be applied to both continuous and discrete-output channels. In the second part of this dissertation, we propose a new code construction of LDPC codes based on the conventional parity-check matrices of Reed-Solomon (RS) codes. We investigate the girth and cycle structure and introduce an efficient searching algorithm to reduce short cycles in their Tanner graphs and to construct LDPC codes with a girth of at least eight. We use masking to further reduce the number of short cycles and to adjust the column and row weights of the parity-check matrices of the constructed codes for performance improvement. Our designs are systematic and flexible, which balance the requirements of good waterfall performance and low error-floor while maintaining a structure that facilitates implementation. In the third part of this dissertation, we investigate binary quasi-cyclic (QC) LDPC codes and their capability to correct phased bursts of erasures. We prove that the peeling algorithm when applied to such parity-check matrices of column weight two can correct all erasures that can be corrected by a maximum likelihood (ML) decoder. We show that by modifying the parity-check matrices of column weight two and globally coupling them, the erasure correcting capability can be further enhanced. For the Additive White Gaussian Noise (AWGN) channel, we design QC LDPC codes with parity-check matrices of column weight three or more that can correct phased bursts of erasures and perform well over the AWGN channel. Our analysis of QC-LDPC codes with parity-check matrices of column weight two is rather comprehensive as we determine, for all such codes, their dimensions, minimum Hamming distances, and their capabilities to correct phased bursts.

•Jan 1, 2021•0 citations

Multiple-rate low-density parity-check codes with constant blocklength

Andres I. Vila Casado, Wen-Yen Weng, Stefano Valle +1 more

This paper describes and analyzes low-density parity-check code families that support variety of different rates while maintaining the same fundamental decoder architecture. Such families facilitate the decoding hardware design and implementation for applications that require communication at different rates, for example to adapt to changing channel conditions. Combining rows of the lowest-rate parity-check matrix produces the parity-check matrices for higher rates. An important advantage of this approach is that all effective code rates have the same blocklength. This approach is compatible with well known techniques that allow low-complexity encoding and parallel decoding of these LDPC codes. This technique also allows the design of programmable analog LDPC decoders. The proposed design method maintains good graphical properties and hence low error floors for all rates.

IEEE Transactions on Communications•Jan 1, 2009•44 citations

Intelligent Channel Coding Using Graph Neural Networks: A Machine Learning Perspective

K S Koushik, M. Thilakeshwari, T. Likith Vignesh +2 more

Wireless communication is rapidly evolving, and this evolution has led to increasing demands for better error correction, lower latency, and higher adaptability, particularly in Beyond 5G (B5G) networks. Traditional channel coding methods like Low-density Parity-check (LDPC) and Turbo codes often struggle to meet these advanced requirements. To address this challenge, we explore the use of Graph Neural Networks (GNNs) to enhance LDPC decoding. By imposing the structured nature of the Tanner graph, GNNs improve decoding accuracy, optimize bit error rate (BER), and adapt to changing signal conditions in real-time. We implement and evaluate our approach using MATLAB and Python, training our ML-based decoder on varying SNR levels to ensure robustness. The results show that integrating machine learning into LDPC decoding significantly enhances error correction and communication reliability. This work highlights the potential of ML-driven techniques in shaping the future of wireless networks.

IEEE Space, Aerospace and Defence Conference (SPACE)•Jul 21, 2025•0 citations

Non iterative LDPC decoding by syndrome generation using Artificial Neural Network

Dinesh Kumar, Alkesh Agrawal, Gopal Singh Phartiyal

Low density parity-check code (LDPC) is an error correcting code used in noisy communication channel (e.g. AWGN) to reduce the probability of error in information. By using LDPC codes, this probability can be made comparatively small, so that the data transmission rate can be as close to Shannon's limit. The decoding of Low Density Parity Check (LDPC) codes by iterative process of belief propagation gives challenges for designers looking for real time performance in communication systems. This thesis work proposes the use of Artificial Neural Networks (ANN) to replace belief propagation to approach closer to Shannon's limit more closer than other traditional decoding methods. This thesis is intended to design a new methodology to decode LDPC codes in Non-iterative manner with the help of ANN and Look Up Table (LUT). This work is at initial stage and will be extended for better performance.

National Conference on Recent Advances in Electronics & Computer Engineering (RAECE)•Feb 1, 2015•1 citation
Artificial intelligence (AI)–driven channel coding has emerged as a promising solution for enhancing error correction performance and reducing decoding complexity, particularly in the context of Low-Density Parity-Check (LDPC) codes. Unlike traditional coding-theory-based encoding and decoding methods, AI-driven approaches optimise codeword design in a data-driven manner under conditions where classical techniques have limitations, e.g., LDPC codes with limited block lengths and finite decoding complexity. AI-designed LDPC codewords and AI-based decoding algorithms are usually optimised for a given block length or code rate, and cannot be directly applied to different block lengths or rates. To this end, this article presents an AI-driven rate-adaptive LDPC coding framework that incorporates a parameter-sharing mechanism within the encoder and decoder, trained via multi-task learning to support multiple code rates. Preliminary evaluations in AWGN channels validate the feasibility of such a design and demonstrate its promising error-correction potential and adaptability. In this article, we present key design principles, emphasise their advantages, and discuss the future research challenges that remain.
Deep learning based decoding networks have shown significant improvement in decoding low density parity check (LDPC) codes, but the neural decoders are limited by rate-matching operations such as puncturing or extending, thus needing to train multiple decoders with different code rates for a variety of channel conditions. In this correspondence, we propose a Multi-Task Learning based rate-compatible LDPC decoding network, which utilizes the structure of raptor-like LDPC codes and can deal with multiple code rates. In the proposed network, different portions of parameters are activated to deal with distinct code rates, which leads to parameter sharing among tasks. Numerical experiments demonstrate the effectiveness of the proposed method. Training the specially designed network under multiple code rates makes the decoder compatible with multiple code rates without sacrificing frame error rate performance.
Low-density parity check (LDPC) codes, are a family of error-correcting codes, their performances close to the Shannon limit make them very attractive solutions for digital communication systems. There are several algorithms for decoding LDPC codes that show great diversity in terms of performance related to error correction. Also, very recently, many research papers involved the genetic algorithm (GA) in coding theory, in particular, in the decoding linear block codes case, which has heavily contributed to reducing the bit error rate (BER). In this paper, an efficient method based on the GA is proposed and it is used to improve the power of correction in terms of BER and the frame error rate (FER) of LDPC codes. Subsequently, the proposed algorithm can independently decide the most suitable moment to stop the decoding process, moreover, it does not require channel information (CSI) making it adaptable for all types of channels with different noise or intensity. The simulations show that the proposed algorithm is more efficient in terms of BER compared to other LDPC code decoders.
Low-density parity-check (LDPC) codes have been one of the most popular error correction candidates in modern communication and data storage systems for the past three decades due to their capacity-approaching error correction capability under the Belief Propagation (BP) decoding algorithms. In this dissertation, we investigate three topics related to efficient and effective decoding algorithms and the code design of LDPC codes. In the first part of this dissertation, we propose a methodology with the help of artificial intelligence to design Finite Alphabet Iterative Decoders (FAID) for LDPC codes, which are not only of great theoretical but also practical importance. This model-driven neural network (NN) framework unfolds the decoding iterations, introduces quantized neural networks (QNN) to model the FAIDs, and proposes a new cost function, namely, bit error rate (BER), to address the inefficiency in discrete-output channel scenarios. The low precision activations in the QNN and quantization in the cost functions cause a critical issue that their gradients vanish almost everywhere, making it difficult to use classical backward propagation. We design and leverage straight-through estimators as surrogate gradients to tackle this issue and provide a joint training scheme. These QNN-aided FAIDs, are capable of surpassing the floating-point BP algorithms, with much lower complexity and faster convergence. The QNN-aided approach is general, as it can be applied to both continuous and discrete-output channels. In the second part of this dissertation, we propose a new code construction of LDPC codes based on the conventional parity-check matrices of Reed-Solomon (RS) codes. We investigate the girth and cycle structure and introduce an efficient searching algorithm to reduce short cycles in their Tanner graphs and to construct LDPC codes with a girth of at least eight. We use masking to further reduce the number of short cycles and to adjust the column and row weights of the parity-check matrices of the constructed codes for performance improvement. Our designs are systematic and flexible, which balance the requirements of good waterfall performance and low error-floor while maintaining a structure that facilitates implementation. In the third part of this dissertation, we investigate binary quasi-cyclic (QC) LDPC codes and their capability to correct phased bursts of erasures. We prove that the peeling algorithm when applied to such parity-check matrices of column weight two can correct all erasures that can be corrected by a maximum likelihood (ML) decoder. We show that by modifying the parity-check matrices of column weight two and globally coupling them, the erasure correcting capability can be further enhanced. For the Additive White Gaussian Noise (AWGN) channel, we design QC LDPC codes with parity-check matrices of column weight three or more that can correct phased bursts of erasures and perform well over the AWGN channel. Our analysis of QC-LDPC codes with parity-check matrices of column weight two is rather comprehensive as we determine, for all such codes, their dimensions, minimum Hamming distances, and their capabilities to correct phased bursts.
This paper describes and analyzes low-density parity-check code families that support variety of different rates while maintaining the same fundamental decoder architecture. Such families facilitate the decoding hardware design and implementation for applications that require communication at different rates, for example to adapt to changing channel conditions. Combining rows of the lowest-rate parity-check matrix produces the parity-check matrices for higher rates. An important advantage of this approach is that all effective code rates have the same blocklength. This approach is compatible with well known techniques that allow low-complexity encoding and parallel decoding of these LDPC codes. This technique also allows the design of programmable analog LDPC decoders. The proposed design method maintains good graphical properties and hence low error floors for all rates.
Wireless communication is rapidly evolving, and this evolution has led to increasing demands for better error correction, lower latency, and higher adaptability, particularly in Beyond 5G (B5G) networks. Traditional channel coding methods like Low-density Parity-check (LDPC) and Turbo codes often struggle to meet these advanced requirements. To address this challenge, we explore the use of Graph Neural Networks (GNNs) to enhance LDPC decoding. By imposing the structured nature of the Tanner graph, GNNs improve decoding accuracy, optimize bit error rate (BER), and adapt to changing signal conditions in real-time. We implement and evaluate our approach using MATLAB and Python, training our ML-based decoder on varying SNR levels to ensure robustness. The results show that integrating machine learning into LDPC decoding significantly enhances error correction and communication reliability. This work highlights the potential of ML-driven techniques in shaping the future of wireless networks.
Low density parity-check code (LDPC) is an error correcting code used in noisy communication channel (e.g. AWGN) to reduce the probability of error in information. By using LDPC codes, this probability can be made comparatively small, so that the data transmission rate can be as close to Shannon's limit. The decoding of Low Density Parity Check (LDPC) codes by iterative process of belief propagation gives challenges for designers looking for real time performance in communication systems. This thesis work proposes the use of Artificial Neural Networks (ANN) to replace belief propagation to approach closer to Shannon's limit more closer than other traditional decoding methods. This thesis is intended to design a new methodology to decode LDPC codes in Non-iterative manner with the help of ANN and Look Up Table (LUT). This work is at initial stage and will be extended for better performance.