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

arXiv:2003.01998 · International Conference on Artificial Intelligence and Statistics

Neural Enhanced Belief Propagation on Factor Graphs

Víctor García Satorras, Max Welling

Published Mar 4, 2020• 75 citations
arXivHTMLPDF

Abstract

A graphical model is a structured representation of locally dependent random variables. A traditional method to reason over these random variables is to perform inference using belief propagation. When provided with the true data generating process, belief propagation can infer the optimal posterior probability estimates in tree structured factor graphs. However, in many cases we may only have access to a poor approximation of the data generating process, or we may face loops in the factor graph, leading to suboptimal estimates. In this work we first extend graph neural networks to factor graphs (FG-GNN). We then propose a new hybrid model that runs conjointly a FG-GNN with belief propagation. The FG-GNN receives as input messages from belief propagation at every inference iteration and outputs a corrected version of them. As a result, we obtain a more accurate algorithm that combines the benefits of both belief propagation and graph neural networks. We apply our ideas to error correction decoding tasks, and we show that our algorithm can outperform belief propagation for LDPC codes on bursty channels.

DOI
10.48550/arxiv.2003.01998

Related papers

Graph Neural Networks for Enhanced Decoding of Quantum LDPC Codes

Anqi Gong, Sebastian Cammerer, Joseph M. Renes

In this work, we propose a fully differentiable iterative decoder for quantum low-density parity-check (LDPC) codes. The proposed algorithm is composed of classical belief propagation (BP) decoding stages and intermediate graph neural network (GNN) layers. Both components of the decoder are defined over the same sparse decoding graph enabling a seamless integration and scalability to large codes. The core idea is to use the GNN component between consecutive BP runs so that the knowledge from the previous BP run can be leveraged to better initialize the next BP run. This enables the proposed decoder to learn to compensate for sub-optimal BP decoding graphs that result from the design constraints of quantum LDPC codes. Since the entire decoder remains differentiable, gradient descent-based training is possible. We compare the error rate performance of the proposed decoder against various post-processing methods such as random perturbation, enhanced feedback, augmentation, and ordered-statistics decoding (OSD) and show that a carefully designed training process lowers the error-floor significantly. As a result, our proposed decoder outperforms the former three methods using significantly fewer post-processing attempts. The source code of our experiments is available online.

arXiv:2310.17758•IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•21 citations

Graph Neural Network-Based Joint Equalization and Decoding

Jannis Clausius, Marvin Geiselhart, Daniel Tandler +1 more

This paper proposes to use graph neural networks (GNNs) for equalization, that can also be used to perform joint equalization and decoding (JED). For equalization, the GNN is build upon the factor graph representations of the channel, while for JED, the factor graph is expanded by the Tanner graph of the parity-check matrix (PCM) of the channel code, sharing the variable nodes (VNs). A particularly advantageous property of the GNN is the robustness against cycles in the factor graphs which is the main problem for belief propagation (BP)-based equalization. As a result of having a fully deep learning-based receiver, joint optimization instead of individual optimization of the components is enabled, so-called end-to-end learning. Furthermore, we propose a parallel flooding schedule that further reduces the latency, which turns out to improve also the error correcting performance. The proposed approach is analyzed and compared to state-of-the-art baselines in terms of error correcting capability and latency. At a fixed low latency, the flooding GNN for JED demonstrates a gain of 2.25 dB in bit error rate (BER) compared to an iterative Bahl-Cocke-Jelinek-Raviv (BCJR)-BP baseline.

arXiv:2401.16187•IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•11 citations

Graph Neural Networks for Channel Decoding

Sebastian Cammerer, Jakob Hoydis, Fayçal Ait Aoudia +1 more

In this work, we propose a fully differentiable graph neural network (GNN)-based architecture for channel decoding and showcase a competitive decoding performance for various coding schemes, such as low-density parity-check (LDPC) and BCH codes. The idea is to let a neural network (NN) learn a generalized message passing algorithm over a given graph that represents the forward error correction (FEC) code structure by replacing node and edge message updates with trainable functions. Contrary to many other deep learning-based decoding approaches, the proposed solution enjoys scalability to arbitrary block lengths and the training is not limited by the curse of dimensionality. We benchmark our proposed decoder against state-of-the-art in conventional channel decoding as well as against recent deep learning-based results. For the (63,45) BCH code, our solution outperforms weighted belief propagation (BP) decoding by approximately 0.4 dB with significantly less decoding iterations and even for 5G NR LDPC codes, we observe a competitive performance when compared to conventional BP decoding. For the BCH codes, the resulting GNN decoder can be fully parametrized with only 9640 weights.

arXiv:2207.14742•IEEE Globecom Workshops (GC Wkshps)•Dec 4, 2022•61 citations

Intelligent LDPC Decoding Using Graph Neural Networks for Beyond 5G Communication Systems

Ambar Bajpai

With changing scenarios in Beyond 5G (B5G) systems, channel coding methods will be faced with stronger requirements for reliability, flexibility, and low latency.Conventional decoding algorithms such as Belief Propagation (BP) are efficient in structured contexts but not sufficiently flexible to respond effectively to dynamic and noisy channel conditions.In this study, we introduces a new Graph Neural Network (GNN)-based solution to decode Low-Density Parity-Check (LDPC) codes by taking advantage of the intrinsic bipartite graph representation of Tanner graphs.The proposed decoder learns a data-driven messagepassing algorithm that performs better than BP over a large range of signal-to-noise ratios (SNRs) and block lengths.The experimental results show that the GNN-based decoder yields much lower bit error rates (BER), faster convergence, and better resistance to noise variability than belief propagation, especially at medium to high SNR levels.Thus, our findings highlight the foundation for scalable, adaptive, and intelligent decoding systems in B5G and 6G architectures.

Journal of information and communication convergence engineering•Dec 31, 2025•1 citation

Factor Graph Optimization of Error-Correcting Codes for Belief Propagation Decoding

Yoni Choukroun, Lior Wolf

The design of optimal linear block codes capable of being efficiently decoded is of major concern, especially for short block lengths. As near capacity-approaching codes, Low-Density Parity-Check (LDPC) codes possess several advantages over other families of codes, the most notable being its efficient decoding via Belief Propagation. While many LDPC code design methods exist, the development of efficient sparse codes that meet the constraints of modern short code lengths and accommodate new channel models remains a challenge. In this work, we propose for the first time a gradient-based data-driven approach for the design of sparse codes. We develop locally optimal codes with respect to Belief Propagation decoding via the learning of the Factor graph under channel noise simulations. This is performed via a novel complete graph tensor representation of the Belief Propagation algorithm, optimized over finite fields via backpropagation and coupled with an efficient line-search method. The proposed approach is shown to outperform the decoding performance of existing popular codes by orders of magnitude and demonstrates the power of data-driven approaches for code design.

arXiv:2406.12900•Jun 9, 2024•5 citations

Graph model-aided optimal iterative decoding technique for LDPC in optical fiber communication

Qinghua Tian, Yiqun Pan, Xiangjun Xin +10 more

The neural networks offer iteration capability for low-density parity-check (LDPC) decoding with superior performance at transmission. However, to cope with increasing code length and rate, the complexity of the neural network increases significantly. This is due to the large amount of feature extraction required to maintain the error correction capability. Based on this gap, we design a new iterative LDPC decoding technique named graph model neural network-belief propagation (GMNN-BP). GMNN-BP uses graph models as a link between deep learning and belief propagation (BP) algorithms, combining the advantages of both. Compared to traditional fully connected neural network decoders, the GMNN-BP decoding has the substantial benefit of avoiding learning and judging codeword categories directly from a large amount of data and requiring less training data as well. The proposed algorithm is verified by simulation and experiment and is tested by using IEEE 802.3ca standard LDPC code word. The results show that the GMNN-BP decoding algorithm is superior to the BP-based iterative decoding method under the same number of iterations, and the maximum gain can reach 1.9dB. When achieving the same performance, the GMNN-BP decoding algorithm only requires half the number of iterations of other algorithms.

Optics Express•Dec 19, 2024•8 citations
A graphical model is a structured representation of locally dependent random variables. A traditional method to reason over these random variables is to perform inference using belief propagation. When provided with the true data generating process, belief propagation can infer the optimal posterior probability estimates in tree structured factor graphs. However, in many cases we may only have access to a poor approximation of the data generating process, or we may face loops in the factor graph, leading to suboptimal estimates. In this work we first extend graph neural networks to factor graphs (FG-GNN). We then propose a new hybrid model that runs conjointly a FG-GNN with belief propagation. The FG-GNN receives as input messages from belief propagation at every inference iteration and outputs a corrected version of them. As a result, we obtain a more accurate algorithm that combines the benefits of both belief propagation and graph neural networks. We apply our ideas to error correction decoding tasks, and we show that our algorithm can outperform belief propagation for LDPC codes on bursty channels.
In this work, we propose a fully differentiable iterative decoder for quantum low-density parity-check (LDPC) codes. The proposed algorithm is composed of classical belief propagation (BP) decoding stages and intermediate graph neural network (GNN) layers. Both components of the decoder are defined over the same sparse decoding graph enabling a seamless integration and scalability to large codes. The core idea is to use the GNN component between consecutive BP runs so that the knowledge from the previous BP run can be leveraged to better initialize the next BP run. This enables the proposed decoder to learn to compensate for sub-optimal BP decoding graphs that result from the design constraints of quantum LDPC codes. Since the entire decoder remains differentiable, gradient descent-based training is possible. We compare the error rate performance of the proposed decoder against various post-processing methods such as random perturbation, enhanced feedback, augmentation, and ordered-statistics decoding (OSD) and show that a carefully designed training process lowers the error-floor significantly. As a result, our proposed decoder outperforms the former three methods using significantly fewer post-processing attempts. The source code of our experiments is available online.
This paper proposes to use graph neural networks (GNNs) for equalization, that can also be used to perform joint equalization and decoding (JED). For equalization, the GNN is build upon the factor graph representations of the channel, while for JED, the factor graph is expanded by the Tanner graph of the parity-check matrix (PCM) of the channel code, sharing the variable nodes (VNs). A particularly advantageous property of the GNN is the robustness against cycles in the factor graphs which is the main problem for belief propagation (BP)-based equalization. As a result of having a fully deep learning-based receiver, joint optimization instead of individual optimization of the components is enabled, so-called end-to-end learning. Furthermore, we propose a parallel flooding schedule that further reduces the latency, which turns out to improve also the error correcting performance. The proposed approach is analyzed and compared to state-of-the-art baselines in terms of error correcting capability and latency. At a fixed low latency, the flooding GNN for JED demonstrates a gain of 2.25 dB in bit error rate (BER) compared to an iterative Bahl-Cocke-Jelinek-Raviv (BCJR)-BP baseline.
In this work, we propose a fully differentiable graph neural network (GNN)-based architecture for channel decoding and showcase a competitive decoding performance for various coding schemes, such as low-density parity-check (LDPC) and BCH codes. The idea is to let a neural network (NN) learn a generalized message passing algorithm over a given graph that represents the forward error correction (FEC) code structure by replacing node and edge message updates with trainable functions. Contrary to many other deep learning-based decoding approaches, the proposed solution enjoys scalability to arbitrary block lengths and the training is not limited by the curse of dimensionality. We benchmark our proposed decoder against state-of-the-art in conventional channel decoding as well as against recent deep learning-based results. For the (63,45) BCH code, our solution outperforms weighted belief propagation (BP) decoding by approximately 0.4 dB with significantly less decoding iterations and even for 5G NR LDPC codes, we observe a competitive performance when compared to conventional BP decoding. For the BCH codes, the resulting GNN decoder can be fully parametrized with only 9640 weights.
With changing scenarios in Beyond 5G (B5G) systems, channel coding methods will be faced with stronger requirements for reliability, flexibility, and low latency.Conventional decoding algorithms such as Belief Propagation (BP) are efficient in structured contexts but not sufficiently flexible to respond effectively to dynamic and noisy channel conditions.In this study, we introduces a new Graph Neural Network (GNN)-based solution to decode Low-Density Parity-Check (LDPC) codes by taking advantage of the intrinsic bipartite graph representation of Tanner graphs.The proposed decoder learns a data-driven messagepassing algorithm that performs better than BP over a large range of signal-to-noise ratios (SNRs) and block lengths.The experimental results show that the GNN-based decoder yields much lower bit error rates (BER), faster convergence, and better resistance to noise variability than belief propagation, especially at medium to high SNR levels.Thus, our findings highlight the foundation for scalable, adaptive, and intelligent decoding systems in B5G and 6G architectures.
The design of optimal linear block codes capable of being efficiently decoded is of major concern, especially for short block lengths. As near capacity-approaching codes, Low-Density Parity-Check (LDPC) codes possess several advantages over other families of codes, the most notable being its efficient decoding via Belief Propagation. While many LDPC code design methods exist, the development of efficient sparse codes that meet the constraints of modern short code lengths and accommodate new channel models remains a challenge. In this work, we propose for the first time a gradient-based data-driven approach for the design of sparse codes. We develop locally optimal codes with respect to Belief Propagation decoding via the learning of the Factor graph under channel noise simulations. This is performed via a novel complete graph tensor representation of the Belief Propagation algorithm, optimized over finite fields via backpropagation and coupled with an efficient line-search method. The proposed approach is shown to outperform the decoding performance of existing popular codes by orders of magnitude and demonstrates the power of data-driven approaches for code design.
The neural networks offer iteration capability for low-density parity-check (LDPC) decoding with superior performance at transmission. However, to cope with increasing code length and rate, the complexity of the neural network increases significantly. This is due to the large amount of feature extraction required to maintain the error correction capability. Based on this gap, we design a new iterative LDPC decoding technique named graph model neural network-belief propagation (GMNN-BP). GMNN-BP uses graph models as a link between deep learning and belief propagation (BP) algorithms, combining the advantages of both. Compared to traditional fully connected neural network decoders, the GMNN-BP decoding has the substantial benefit of avoiding learning and judging codeword categories directly from a large amount of data and requiring less training data as well. The proposed algorithm is verified by simulation and experiment and is tested by using IEEE 802.3ca standard LDPC code word. The results show that the GMNN-BP decoding algorithm is superior to the BP-based iterative decoding method under the same number of iterations, and the maximum gain can reach 1.9dB. When achieving the same performance, the GMNN-BP decoding algorithm only requires half the number of iterations of other algorithms.