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

Early termination scheme for polar belief propagation decoding

Minjung Sung, Cheng-Hung Dixson Lin

Published Aug 6, 2019• 0 citations
OpenAlex

Related papers

BP Polar Decoders with Early Termination and Belief Enhancing

Chao Yang, Junmei Yang, Xiao Liang +3 more

In this paper an early termination scheme, partial LLR-aided (PLA) scheme, is proposed for belief propagation (BP) polar decoding with lower complexity and higher throughput. Numerical results of (1024, 512) code show at least 82% iteration reduction than conventional design at SNR =3.5 dB with proposed early termination scheme. In this paper, belief enhancing schemes based on threshold and cyclic redundancy check (CRC) are proposed, namely, threshold-based LLR (TB-LLR) scheme and segment-divided CRC (SD-CRC) scheme. For (1024, 512) polar code, the performance gains for TB-LLR and SD-CRC are 0.35 dB and 0.2 dB respectively, when BER = 10-3. A general hardware architecture for proposed BP polar decoders is also proposed.

IEEE International Conference on Digital Signal Processing (DSP)•Nov 1, 2018•5 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

Early termination belief propagation decoder with parity check matrix for polar codes

Hsin−Fu Yu, Huang–Chang Lee, Shih-Kai Lee

In this paper, a belief propagation (BP) decoding algorithm with early termination is proposed for polar code. The early termination is accomplished using the syndrome generated by the parity-check matrix, which can be transferred from the generator matrix. With the assistance of the early termination, the BP decoder can provide not only a better bit error rate performance but also significantly reduce the decoding complexity. For (1024, 512) polar codes, the average numbers of iterations can be reduced from 80 to 23 when Eb/N0=3 dB. The reduction in the computation complexity is about 70%.

Wireless and Optical Communications Conference•Apr 1, 2018•5 citations

A Stage-Combined Belief Propagation Decoder for Polar Codes

Jin Sha, Jingbo Liu, Jun Ting Lin +1 more

Journal of Signal Processing Systems•Oct 7, 2016•8 citations

CRC-Aided Belief Propagation with Permutated Graphs Decoding of Polar Codes

Liyun Dai, Li Huang, Yaohui Bai +2 more

It has been shown that the permutation factor graph is an effective method to improve the performance of belief propagation (BP) decoding. The research of belief propagation list (BPL) algorithm based on permutation factor graph has also made great progress, but the complexity of decoding process is still too high. In order to compromise performance and complexity, in this work, we focus on the iterative convergence of BPL decoding algorithm, and propose an early termination BPL algorithm based on multiple CRCs. The results show that the improved BPL decoding scheme can provide higher throughput and achieve similar decoding performance with the existing BPL decoding under the same simulation condition.

IEEE International Conference on Electronic Information and Communication Technology (ICEICT)•Nov 13, 2020•4 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
In this paper an early termination scheme, partial LLR-aided (PLA) scheme, is proposed for belief propagation (BP) polar decoding with lower complexity and higher throughput. Numerical results of (1024, 512) code show at least 82% iteration reduction than conventional design at SNR =3.5 dB with proposed early termination scheme. In this paper, belief enhancing schemes based on threshold and cyclic redundancy check (CRC) are proposed, namely, threshold-based LLR (TB-LLR) scheme and segment-divided CRC (SD-CRC) scheme. For (1024, 512) polar code, the performance gains for TB-LLR and SD-CRC are 0.35 dB and 0.2 dB respectively, when BER = 10-3. A general hardware architecture for proposed BP polar decoders is also proposed.
In this paper, a belief propagation (BP) decoding algorithm with early termination is proposed for polar code. The early termination is accomplished using the syndrome generated by the parity-check matrix, which can be transferred from the generator matrix. With the assistance of the early termination, the BP decoder can provide not only a better bit error rate performance but also significantly reduce the decoding complexity. For (1024, 512) polar codes, the average numbers of iterations can be reduced from 80 to 23 when Eb/N0=3 dB. The reduction in the computation complexity is about 70%.
It has been shown that the permutation factor graph is an effective method to improve the performance of belief propagation (BP) decoding. The research of belief propagation list (BPL) algorithm based on permutation factor graph has also made great progress, but the complexity of decoding process is still too high. In order to compromise performance and complexity, in this work, we focus on the iterative convergence of BPL decoding algorithm, and propose an early termination BPL algorithm based on multiple CRCs. The results show that the improved BPL decoding scheme can provide higher throughput and achieve similar decoding performance with the existing BPL decoding under the same simulation condition.