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

Journal of Signal Processing Systems

A Stage-Combined Belief Propagation Decoder for Polar Codes

Jin Sha, Jingbo Liu, Jun Ting Lin, Zhongfeng Wang

Published Oct 7, 2016• 8 citations
Publisher
DOI
10.1007/s11265-016-1181-y

Related papers

Low‐latency BP decoder of polar code with alternate‐structure scheduling scheme

Xiaojun Zhang, Xiaofeng Yan, Jianming Cui +1 more

In this Letter, a new scheduling scheme for belief propagation (BP) is proposed to reduce the decoding latency. All the stages update messages at the same time, it improves the reliability and accelerates the decoding convergence. The authors also remove the last stage of factor graph to reduce computational complexity. Simulations show that the average decoding latency of a (1024,512) polar code is reduced to 29.4 clocks.

Electronics Letters•Sep 4, 2020•0 citations

Improved Belief Propagation Decoding Algorithm for Short Polar Codes

Shajeel Iqbal, Adnan Ahmed Hashmi, GoangSeog Choi

Wireless Personal Communications•Apr 22, 2017•3 citations

Parity-check and G-matrix based intelligent early stopping criterion for belief propagation decoder for polar codes

Qasim Jan, Shahid Hussain, Zhiwen Pan +4 more

The error correction performance of Belief Propagation (BP) decoding for polar codes is satisfactory compared with the Successive Cancellation (SC) decoding. Nevertheless, it has to complete a fixed number of iterations, which results in high computational complexity. This necessitates an intelligent identification of successful BP decoding for early termination of the decoding process to avoid unnecessary iterations and minimize the computational complexity of BP decoding. This paper proposes a hybrid technique that combines the “parity-check” with the “G-matrix” to reduce the computational complexity of BP decoder for polar codes. The proposed hybrid technique takes advantage of the parity-check to intelligently identify the valid codeword at an early stage and terminate the BP decoding process, which minimizes the overhead of the G-matrix and reduces the computational complexity of BP decoding. We explore a detailed mechanism incorporating the parity bits as outer code and prove that the proposed hybrid technique minimizes the computational complexity while preserving the BP error correction performance. Moreover, mathematical formulation for the proposed hybrid technique that minimizes the computation cost of the G-matrix is elaborated. The performance of the proposed hybrid technique is validated by comparing it with the state-of-the-art early stopping criteria for BP decoding. Simulation results show that the proposed hybrid technique reduces the iterations by about 90% of BP decoding in a high Signal-to-Noise Ratio (SNR) (i.e., 3.5 ∼ 4 ​dB), and approaches the error correction performance of G-matrix and conventional BP decoder for polar codes.

Digital Communications and Networks•Dec 15, 2022•2 citations

Belief propagation list bit-flip decoder for polar codes

Yuyu Yang, Yaoyue Hu, Zhiwen Pan +2 more

Science China Information Sciences•Aug 18, 2021•2 citations

Early termination scheme for polar belief propagation decoding

Minjung Sung, Cheng-Hung Dixson Lin

•Aug 6, 2019•0 citations

CRC-Aided Learned Ensembles of Belief-Propagation Polar Decoders

Tomer Raviv, Alon Goldman, Ofek Vayner +2 more

Polar codes have promising error-correction capabilities. Yet, decoding polar codes is often challenging, particularly with large blocks, with recently proposed decoders based on list-decoding or neural-decoding. The former applies multiple decoders, while the latter family learns to decode from data. In this work we introduce a novel polar decoder that combines list-decoding with neural-decoding, by forming an ensemble of multiple weighted belief-propagation (BP) decoders trained with different data. We employ the cyclic-redundancy check code as a proxy for combining the ensemble decoders and selecting the most-likely decoded word after inference, while facilitating real-time decoding. We evaluate our decoder over a wide range of polar codes lengths, empirically showing gains of around 0.25dB in frame-error rate. Our complexity and latency analysis shows that the number of operations approaches that of a single BP decoder at high SNR.

arXiv:2301.06060•IEEE International Conference on Acoustics Speech and Signal Processing•Mar 18, 2024•9 citations
The error correction performance of Belief Propagation (BP) decoding for polar codes is satisfactory compared with the Successive Cancellation (SC) decoding. Nevertheless, it has to complete a fixed number of iterations, which results in high computational complexity. This necessitates an intelligent identification of successful BP decoding for early termination of the decoding process to avoid unnecessary iterations and minimize the computational complexity of BP decoding. This paper proposes a hybrid technique that combines the “parity-check” with the “G-matrix” to reduce the computational complexity of BP decoder for polar codes. The proposed hybrid technique takes advantage of the parity-check to intelligently identify the valid codeword at an early stage and terminate the BP decoding process, which minimizes the overhead of the G-matrix and reduces the computational complexity of BP decoding. We explore a detailed mechanism incorporating the parity bits as outer code and prove that the proposed hybrid technique minimizes the computational complexity while preserving the BP error correction performance. Moreover, mathematical formulation for the proposed hybrid technique that minimizes the computation cost of the G-matrix is elaborated. The performance of the proposed hybrid technique is validated by comparing it with the state-of-the-art early stopping criteria for BP decoding. Simulation results show that the proposed hybrid technique reduces the iterations by about 90% of BP decoding in a high Signal-to-Noise Ratio (SNR) (i.e., 3.5 ∼ 4 ​dB), and approaches the error correction performance of G-matrix and conventional BP decoder for polar codes.
Polar codes have promising error-correction capabilities. Yet, decoding polar codes is often challenging, particularly with large blocks, with recently proposed decoders based on list-decoding or neural-decoding. The former applies multiple decoders, while the latter family learns to decode from data. In this work we introduce a novel polar decoder that combines list-decoding with neural-decoding, by forming an ensemble of multiple weighted belief-propagation (BP) decoders trained with different data. We employ the cyclic-redundancy check code as a proxy for combining the ensemble decoders and selecting the most-likely decoded word after inference, while facilitating real-time decoding. We evaluate our decoder over a wide range of polar codes lengths, empirically showing gains of around 0.25dB in frame-error rate. Our complexity and latency analysis shows that the number of operations approaches that of a single BP decoder at high SNR.