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

International Journal of Networking and Virtual Organisations

Enhance Belief Propagation Decoding using Ensemble Learning Approaches

Md Aleem, Sharjeel Ahmad, Syed Ahmad

Published Jan 1, 2025• 0 citations
Publisher
DOI
10.1504/ijnvo.2025.153494

Related papers

Parallel versus sequential updating for belief propagation decoding

Haggai Kfir, Ido Kanter

arXiv:cond-mat/0207185•Physica A Statistical Mechanics and its Applications•Sep 22, 2003•96 citations

Decoding of Polar Codes Based on Q-Learning-Driven Belief Propagation

Laisa Marianna Soares Oliveira, Robert M. Oliveira, Rodrigo C. de Lamare

This paper presents an enhanced belief propagation (BP) decoding algorithm and a reinforcement learning-based BP decoding algorithm for polar codes. The enhanced BP algorithm weighs each Processing Element (PE) input based on their signals and Euclidean distances using a heuristic metric. The proposed reinforcement learning-based BP decoding strategy relies on reweighting the messages and consists of two steps: we first weight each PE input based on their signals and Euclidean distances using a heuristic metric, then a Q-learning algorithm (QLBP) is employed to figure out the best correction factor for successful decoding. Simulations show that the proposed enhanced BP and QLBP decoders outperform the successive cancellation (SC) and belief propagation (BP) decoders, and approach the SCL decoders.

arXiv:2111.00673•Nov 1, 2021•1 citation

Modern-Driven Deep Learning for Belief Propagation LDPC Decoding

Yiduo Tang, Lin Zhou, Shuying Zhang +1 more

Smart innovation, systems and technologies•Jan 1, 2022•0 citations

Q-Learning-Driven BP decoding for Polar Codes

Lucas Maia de Oliveira, Robert M. Oliveira, Rodrigo C. de Lamare

This paper presents an enhanced belief propagation (BP) decoding algorithm and a reinforcement learning-based BP decoding algorithm for polar codes.The enhanced BP algorithm weighs each Processing Element (PE) input based on their signals and Euclidean distances using a heuristic metric.The proposed reinforcement learning-based BP decoding strategy relies on reweighting the messages and consists of two steps: we first weight each PE input based on their signals and Euclidean distances using a heuristic metric, then a Q-learning algorithm (QLBP) is employed to figure out the best correction factor for successful decoding.Simulations show that the proposed enhanced BP and QLBP decoders outperform the successive cancellation (SC) and belief propagation (BP) decoders, and approach the SCL decoders.

Anais de XXXV Simpósio Brasileiro de Telecomunicações e Processamento de Sinais•Jan 1, 2021•2 citations

Transforming machine learning: An exploration of quantum algorithms and their applications

Y.V.R. Naga Pawan, Bhanu Prakash Kolla

Advances in computers•Aug 11, 2025•2 citations

Joint End-to-End Training of Weighted BP Decoder Ensembles

Felix Krieg, Paul Bezner, Stephan ten Brink

Ensemble decoding improves decoding reliability by combining component decoders with complementary failure events. Existing approaches typically obtain this diversity from code-specific structure, such as code automorphisms, multiple parity-check representations, or targeted modifications of the message-passing graph. In this work, we instead learn the diversity of an ensemble of weighted belief propagation decoders by jointly optimizing trainable Tanner-graph edge weights. A central design question is how the training objective should distribute gradient among the ensemble members to promote complementary decoding behavior. To this end, we compare four ensemble objectives under direct gradient-based optimization and identify best-member training as the most effective approach. For a (64,32) progressive edge-growth (PEG) low-density parity-check (LDPC) code, the resulting ensemble outperforms the considered trained and untrained belief-propagation-based ensemble baselines. With 10 members, it provides a gain of approximately 0.66 dB over a single belief propagation decoder at a target frame error rate (FER) of $10^{-4}$. Similar behavior is observed for a (128,64) CCSDS LDPC code, indicating that the learned complementarity is not specific to PEG. Although the ensemble performance improves substantially, all trained members show a higher standalone FER. The gain therefore results from learned specialization and complementary failure events rather than uniformly improved component decoders.

arXiv:2610.33559•Oct 24, 2026•0 citations
This paper presents an enhanced belief propagation (BP) decoding algorithm and a reinforcement learning-based BP decoding algorithm for polar codes. The enhanced BP algorithm weighs each Processing Element (PE) input based on their signals and Euclidean distances using a heuristic metric. The proposed reinforcement learning-based BP decoding strategy relies on reweighting the messages and consists of two steps: we first weight each PE input based on their signals and Euclidean distances using a heuristic metric, then a Q-learning algorithm (QLBP) is employed to figure out the best correction factor for successful decoding. Simulations show that the proposed enhanced BP and QLBP decoders outperform the successive cancellation (SC) and belief propagation (BP) decoders, and approach the SCL decoders.
This paper presents an enhanced belief propagation (BP) decoding algorithm and a reinforcement learning-based BP decoding algorithm for polar codes.The enhanced BP algorithm weighs each Processing Element (PE) input based on their signals and Euclidean distances using a heuristic metric.The proposed reinforcement learning-based BP decoding strategy relies on reweighting the messages and consists of two steps: we first weight each PE input based on their signals and Euclidean distances using a heuristic metric, then a Q-learning algorithm (QLBP) is employed to figure out the best correction factor for successful decoding.Simulations show that the proposed enhanced BP and QLBP decoders outperform the successive cancellation (SC) and belief propagation (BP) decoders, and approach the SCL decoders.
Ensemble decoding improves decoding reliability by combining component decoders with complementary failure events. Existing approaches typically obtain this diversity from code-specific structure, such as code automorphisms, multiple parity-check representations, or targeted modifications of the message-passing graph. In this work, we instead learn the diversity of an ensemble of weighted belief propagation decoders by jointly optimizing trainable Tanner-graph edge weights. A central design question is how the training objective should distribute gradient among the ensemble members to promote complementary decoding behavior. To this end, we compare four ensemble objectives under direct gradient-based optimization and identify best-member training as the most effective approach. For a (64,32) progressive edge-growth (PEG) low-density parity-check (LDPC) code, the resulting ensemble outperforms the considered trained and untrained belief-propagation-based ensemble baselines. With 10 members, it provides a gain of approximately 0.66 dB over a single belief propagation decoder at a target frame error rate (FER) of 10−410^{-4}10−4. Similar behavior is observed for a (128,64) CCSDS LDPC code, indicating that the learned complementarity is not specific to PEG. Although the ensemble performance improves substantially, all trained members show a higher standalone FER. The gain therefore results from learned specialization and complementary failure events rather than uniformly improved component decoders.