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

Dianzi xuebao

An Improved BP Decoding Algorithm Based on WBF Scheme for Systematic RA Codes

Xingcheng Liu, Yuansheng Ye

Published Jan 1, 2010• 1 citation
OpenAlex

Abstract

To mitigate the problems of high computation complexity and deteriorated error correction performance in decoding Repeat-Accumulate(RA) codes with Belief Propagation(BP) and Min-Sum algorithms,the idea of Weighted Bit-Flipping(WBF) is applied to improve the BP algorithm.The improved BP decoding algorithm based on the WBF scheme is proposed for systematic RA codes.If decoding is failure in each iteration,bit flipping measure is to be taken according to specific rules in order to obtain legitimate code words.Simulation results demonstrate that the proposed algorithm can decrease the computation complexity effectively for such RA codes while maintaining the excellent error-correction performance.

Related papers

Research on an Improved Decoding Algorithm for Low-density Parity-check Codes

Xiyuan Chen

To solve the problem of high average running time,an improved decoding algorithm was proposed which was combined by BP algorithm and WBF algorithm.The parity check was added in each BP iterative decoding,and flipping criterions which were passed from check nodes to information nodes were weighted by the reliable information of received sequence.Then a bit flipping measure was to be taken according to specific rules in order to obtain correct codes,and a parity check was added again.Simulation results on Additive White Gaussian Noise(AWGN) channel show that,the improved algorithm can decrease the average running time effectively for LDPC codes while maintaining the excellent decoding performance as BP algorithm.And compared with classical BP algorithm,the effect of the different maximum numbers of iterations,different lengths of codes and different code rates for the improved decoding algorithm are analyzed.

Science Technology and Engineering•Jan 1, 2011•0 citations

Reliability Adjustment Weighted Bit-Flipping Decoding for Low-Density Parity-Check Codes

Shengpei Ding, Jiongcheng Li, Heng-hui XIAO +1 more

In this paper, we propose reliability adjustment weighted bit-flipping (RA-WBF) decoding algorithm for low density parity-check (LDPC) codes. By adjusting the reliability of received symbols during iterative decoding, the proposed algorithm can offer better tradeoff between performance, convergence speed and computational complexity. Furthermore, this improvement can easily be extended to other variations of weighted bit-flipping decoding algorithm and obtain noticeable improvement in error performance. Simulation results are shown to verify our conclusions.

International Conference on Computational Intelligence and Security (CIS)•Dec 1, 2013•0 citations

New insights into weighted bit-flipping decoding

Xiaofu Wu, Cong Ling, Ming Jiang +3 more

A natural relationship between weighted bit-flipping (WBF) decoding and belief-propagation-like (BP-like) decoding is explored. This understanding can help us develop WBF algorithms from BP-like algorithms. For min-sum decoding, one can find that its WBF algorithm is the algorithm proposed by Jiang et al. For BP decoding, we propose a new WBF algorithm and show its performance advantage. The proposed WBF algorithms are parallelized to achieve rapid convergence. Two efficient simulation-based procedures are proposed for the optimization of the associated thresholds.

IEEE Transactions on Communications•Aug 1, 2009•29 citations

Self reliability based weighted bit-flipping decoding for low-density parity-check codes

Jin Sha, Minglun Gao, Zhongjin Zhang +2 more

Abstract- Low Density Parity Check (LDPC) codes can be decoded in various ways, namely the Bit-Flipping (BF) algorithm, the Weighted BF algorithm (WBF) ， the Belief Propagation (BP) algorithm and so on. These algorithms provide a wide range of tradeoffs among decoding complexity, decoding speed, and error rate performance. In this paper, a novel self-reliability-based weighted bit-flipping decoding scheme for low-density parity-check codes is proposed. Improvement in performance is observed in comparison with the modified weighted bit-flipping decoding scheme, and the decoding complexity can be significantly reduced as well. Key-Words:- Low-density parity-check (LDPC) codes, decoding algorithm, bit flipping, self reliability

International Conference on Instrumentation, Measurement, Circuits and Systems•Apr 16, 2006•3 citations

An Enhanced Belief Propagation Decoding Algorithm With Bit-Flipping for Polar Codes

Zhongjun Yang, Li Chen

For polar codes, bit-flipping strategy can significantly improve the error-correction performance of the belief propagation (BP) decoding. However, the existing BP flipping (BPF) decoding algorithms require many attempts, due to their inefficiency in locating the erroneous positions. This leads to high decoding complexity, limiting their practical applications, especially for long polar codes. In this letter, an enhanced BPF (EBPF) decoding algorithm is proposed. It requires fewer flipping attempts, but yields an advanced decoding performance. By better utilizing the reliability and divergence of bit estimations, a novel weighted metric (WM) is introduced to identify the possible erroneous positions. During each new decoding attempt, the EBPF decoding takes turns to flip these positions. Our simulation results show that, with the same number of flipping attempts, the proposed decoding outperforms the generalized BPF (GBPF) decoding and the state-of-the-art BP correction (BPC) decoding.

IEEE Communications Letters•Dec 16, 2024•6 citations

Theoretic approach to BP-based WBF decoding algorithm of LDPC codes

Erl‐Huei Lu, Tso-Cho Chen, Pen‐Yao Lu

A theoretic approach to the belief-propagation - based weighted bit-flipping (BP-based WBF) algorithm is proposed for decoding low-density parity-check codes. The decoding algorithm can be easily simplified to IMWBF, MWBF, WBF or BF decoding algorithms by setting different parameters; hence it could offer a high flexible performance/complexity trade-off for hybrid decoding.

International Symposium on Wireless Pervasive Computing•Nov 1, 2013•8 citations
To mitigate the problems of high computation complexity and deteriorated error correction performance in decoding Repeat-Accumulate(RA) codes with Belief Propagation(BP) and Min-Sum algorithms,the idea of Weighted Bit-Flipping(WBF) is applied to improve the BP algorithm.The improved BP decoding algorithm based on the WBF scheme is proposed for systematic RA codes.If decoding is failure in each iteration,bit flipping measure is to be taken according to specific rules in order to obtain legitimate code words.Simulation results demonstrate that the proposed algorithm can decrease the computation complexity effectively for such RA codes while maintaining the excellent error-correction performance.
To solve the problem of high average running time,an improved decoding algorithm was proposed which was combined by BP algorithm and WBF algorithm.The parity check was added in each BP iterative decoding,and flipping criterions which were passed from check nodes to information nodes were weighted by the reliable information of received sequence.Then a bit flipping measure was to be taken according to specific rules in order to obtain correct codes,and a parity check was added again.Simulation results on Additive White Gaussian Noise(AWGN) channel show that,the improved algorithm can decrease the average running time effectively for LDPC codes while maintaining the excellent decoding performance as BP algorithm.And compared with classical BP algorithm,the effect of the different maximum numbers of iterations,different lengths of codes and different code rates for the improved decoding algorithm are analyzed.
In this paper, we propose reliability adjustment weighted bit-flipping (RA-WBF) decoding algorithm for low density parity-check (LDPC) codes. By adjusting the reliability of received symbols during iterative decoding, the proposed algorithm can offer better tradeoff between performance, convergence speed and computational complexity. Furthermore, this improvement can easily be extended to other variations of weighted bit-flipping decoding algorithm and obtain noticeable improvement in error performance. Simulation results are shown to verify our conclusions.
A natural relationship between weighted bit-flipping (WBF) decoding and belief-propagation-like (BP-like) decoding is explored. This understanding can help us develop WBF algorithms from BP-like algorithms. For min-sum decoding, one can find that its WBF algorithm is the algorithm proposed by Jiang et al. For BP decoding, we propose a new WBF algorithm and show its performance advantage. The proposed WBF algorithms are parallelized to achieve rapid convergence. Two efficient simulation-based procedures are proposed for the optimization of the associated thresholds.
Abstract- Low Density Parity Check (LDPC) codes can be decoded in various ways, namely the Bit-Flipping (BF) algorithm, the Weighted BF algorithm (WBF) ， the Belief Propagation (BP) algorithm and so on. These algorithms provide a wide range of tradeoffs among decoding complexity, decoding speed, and error rate performance. In this paper, a novel self-reliability-based weighted bit-flipping decoding scheme for low-density parity-check codes is proposed. Improvement in performance is observed in comparison with the modified weighted bit-flipping decoding scheme, and the decoding complexity can be significantly reduced as well. Key-Words:- Low-density parity-check (LDPC) codes, decoding algorithm, bit flipping, self reliability
For polar codes, bit-flipping strategy can significantly improve the error-correction performance of the belief propagation (BP) decoding. However, the existing BP flipping (BPF) decoding algorithms require many attempts, due to their inefficiency in locating the erroneous positions. This leads to high decoding complexity, limiting their practical applications, especially for long polar codes. In this letter, an enhanced BPF (EBPF) decoding algorithm is proposed. It requires fewer flipping attempts, but yields an advanced decoding performance. By better utilizing the reliability and divergence of bit estimations, a novel weighted metric (WM) is introduced to identify the possible erroneous positions. During each new decoding attempt, the EBPF decoding takes turns to flip these positions. Our simulation results show that, with the same number of flipping attempts, the proposed decoding outperforms the generalized BPF (GBPF) decoding and the state-of-the-art BP correction (BPC) decoding.