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

Cross Strait Radio Science and Wireless Technology Conference (CSRSWTC)

An adaptive weighted multibit-flipping algorithm for decoding LDPC codes

Tso-Cho Chen, Kuan-Liang Lin

Published Jul 1, 2013• 1 citation
Publisher

Abstract

An adaptive weighted multibit-flipping (AWMBF) decoding algorithm which flips multiple bits in each iteration is proposed for low-density parity-check (LDPC) codes. The multibit-flipping criterion is devised based on the least reliable positions in which reliability measure threshold is dynamically adapted during the decoding process. The proposed decoder converges faster and provides better performances than the conventional weighted bit-flipping and multibit-flipping decoders. Simulation results demonstrate that the proposed algorithm achieves a good tradeoff between performance and complexity.

DOI
10.1109/csqrwc.2013.6657437

Related papers

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

Adaptive‐weighted multibit‐flipping decoding of low‐density parity‐check codes based on ordered statistics

T.-C. Chen

An adaptive‐weighted multibit‐flipping decoding algorithm, which flips multiple bits in each iteration, is proposed for low‐density parity‐check codes. The multibit‐flipping criterion is devised based on the least reliable positions and ordered statistics, in which the flipping threshold is dynamically adapted during the decoding process. The proposed decoder converges faster and provides better performances than the conventional weighted bit‐flipping and multibit‐flipping decoders. Simulation results demonstrate that the proposed algorithm achieves a good tradeoff between performance and complexity.

IET Communications•Aug 28, 2013•22 citations

An Efficient Weighted Bit-Flipping Algorithm for Decoding LDPC Codes Based on Log-Likelihood Ratio of Bit Error Probability

Tso-Cho Chen, Erl‐Huei Lu, Chia-Jung LI +1 more

In this paper, a weighted multiple bit flipping (WMBF) algorithman for decoding low-density parity-check (LDPC) codes is proposed first. Then the improved WMBF algorithm which we call the efficient weighted bit-flipping (EWBF) algorithm is developed. The EWBF algorithm can dynamically choose either multiple bit-flipping or single bit-flipping in each iteration according to the log-likelihood ratio of the error probability of the received bits. Thus, it can efficiently increase the convergence speed of decoding and prevent the decoding process from falling into loop traps. Compared with the parallel weighted bit-flipping (PWBF) algorithm, the EWBF algorithm can achieve significantly lower computational complexity without performance degradation when the Euclidean geometry (EG)-LDPC codes are decoded. Furthermore, the flipping criterion does not require any parameter adjustment.

IEICE Transactions on Communications•Jan 1, 2017•1 citation

A self-normalized weighted bit-flipping decoding algorithm for LDPC codes

Chunli Wang, Xiaofu Wu, Wei‐Ping Zhu

A novel self-normalized weighted bit-flipping (SNWBF) decoding algorithm for low-density parity-check (LDPC) codes is proposed. Compared to the best known weighted bit-flipping decoding, the SNWBF algorithm converges significantly faster but with little performance penalty. For decoding of LDPC codes, the proposed SNWBF algorithm considers not only the reliability of the neighboring check nodes, but also the reliability of each variable node. Compared to the IMWBF algorithm, the proposed algorithm does not require multiplicative normalization and performs even better.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 1, 2016•1 citation

Hybrid weighted bit-flipping decoding algorithm for LDPC codes

Gaoqi Dou

To reduce loop-oscillation errors occurring in the weighted bit-flipping algorithm,a hybrid weighted bit-flipping decoding algorithm for low-density parity-check(LDPC) codes is proposed.The proposed algorithm updates multiple bits in each iteration,a random perturbation is added when the loop oscillation is detected which could reduce loop-oscillation errors by changing objective function.And these errors are analyzed from the mathematic perspective.Simulation results and complexity comparison show that the proposed algorithm achieves an appealing tradeoff among performance,convergence and complexity for structured LDPC codes compared with the best known weighted bit-flipping decoding algorithm.

Systems engineering and electronics•Jan 1, 2010•1 citation

Adaptive Threshold Technique for Bit-Flipping Decoding of Low-Density Parity-Check Codes

Junho Cho, Wonyong Sung

The bit-flipping (BF) algorithm for decoding of low-density parity-check (LDPC) codes requires less complex hardware than other decoding algorithms, but its error correcting performance needs to be improved. In this letter, a threshold adaptation scheme is applied to BF algorithm based decoding of LDPC codes. Our experiments show that the optimal threshold value for BF depends on the error conditions, and threshold adjustment during decoding helps to prevent meaningless no-flipping iterations. Based on these statistical observations, the adaptive threshold technique is proposed to pursue both the maximum error correcting capability and the fastest decoding convergence.

IEEE Communications Letters•Aug 5, 2010•32 citations
An adaptive weighted multibit-flipping (AWMBF) decoding algorithm which flips multiple bits in each iteration is proposed for low-density parity-check (LDPC) codes. The multibit-flipping criterion is devised based on the least reliable positions in which reliability measure threshold is dynamically adapted during the decoding process. The proposed decoder converges faster and provides better performances than the conventional weighted bit-flipping and multibit-flipping decoders. Simulation results demonstrate that the proposed algorithm achieves a good tradeoff between performance and complexity.
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.
An adaptive‐weighted multibit‐flipping decoding algorithm, which flips multiple bits in each iteration, is proposed for low‐density parity‐check codes. The multibit‐flipping criterion is devised based on the least reliable positions and ordered statistics, in which the flipping threshold is dynamically adapted during the decoding process. The proposed decoder converges faster and provides better performances than the conventional weighted bit‐flipping and multibit‐flipping decoders. Simulation results demonstrate that the proposed algorithm achieves a good tradeoff between performance and complexity.
In this paper, a weighted multiple bit flipping (WMBF) algorithman for decoding low-density parity-check (LDPC) codes is proposed first. Then the improved WMBF algorithm which we call the efficient weighted bit-flipping (EWBF) algorithm is developed. The EWBF algorithm can dynamically choose either multiple bit-flipping or single bit-flipping in each iteration according to the log-likelihood ratio of the error probability of the received bits. Thus, it can efficiently increase the convergence speed of decoding and prevent the decoding process from falling into loop traps. Compared with the parallel weighted bit-flipping (PWBF) algorithm, the EWBF algorithm can achieve significantly lower computational complexity without performance degradation when the Euclidean geometry (EG)-LDPC codes are decoded. Furthermore, the flipping criterion does not require any parameter adjustment.
A novel self-normalized weighted bit-flipping (SNWBF) decoding algorithm for low-density parity-check (LDPC) codes is proposed. Compared to the best known weighted bit-flipping decoding, the SNWBF algorithm converges significantly faster but with little performance penalty. For decoding of LDPC codes, the proposed SNWBF algorithm considers not only the reliability of the neighboring check nodes, but also the reliability of each variable node. Compared to the IMWBF algorithm, the proposed algorithm does not require multiplicative normalization and performs even better.
To reduce loop-oscillation errors occurring in the weighted bit-flipping algorithm,a hybrid weighted bit-flipping decoding algorithm for low-density parity-check(LDPC) codes is proposed.The proposed algorithm updates multiple bits in each iteration,a random perturbation is added when the loop oscillation is detected which could reduce loop-oscillation errors by changing objective function.And these errors are analyzed from the mathematic perspective.Simulation results and complexity comparison show that the proposed algorithm achieves an appealing tradeoff among performance,convergence and complexity for structured LDPC codes compared with the best known weighted bit-flipping decoding algorithm.
The bit-flipping (BF) algorithm for decoding of low-density parity-check (LDPC) codes requires less complex hardware than other decoding algorithms, but its error correcting performance needs to be improved. In this letter, a threshold adaptation scheme is applied to BF algorithm based decoding of LDPC codes. Our experiments show that the optimal threshold value for BF depends on the error conditions, and threshold adjustment during decoding helps to prevent meaningless no-flipping iterations. Based on these statistical observations, the adaptive threshold technique is proposed to pursue both the maximum error correcting capability and the fastest decoding convergence.