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

IET Communications

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

T.-C. Chen

Published Aug 28, 2013• 22 citations
Publisher

Abstract

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.

DOI
10.1049/iet-com.2013.0052

Related papers

An adaptive weighted multibit-flipping algorithm for decoding LDPC codes

Tso-Cho Chen, Kuan-Liang Lin

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.

Cross Strait Radio Science and Wireless Technology Conference (CSRSWTC)•Jul 1, 2013•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

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

A Modified Bit-Flipping Decoding for Low-density Parity-check Codes Based on Weighted Violation

Hui Han

This paper proposes a modified weighted violation-based bit-flipping decoding algorithm for LDPC codes, and no soft information is required for decoding, Futhermore, in order to reduce the average number of iterations and decoding complexity, the threshold of judgement is set. Simulation results show that this modified algorithm could achieve much less number of iterations and better performance as compared with several soft-decision bit-flipping decoding algorithms for LDPC codes with large girth and low code rate.

Communications technology•Jan 1, 2009•0 citations

Channel-independent weighted bit-flipping decoding algorithm for low-density parity-check codes

T.-C. Chen

In this study, a new method for improving hard-decision bit-flipping (BF) decoding is proposed for low-density parity-check codes. The flipping criterion is derived theoretically from the soft-decision belief-propagation decoding algorithm. The proposed BF decoding algorithm is channel independent and is improved by introducing a more efficient method for computing the reliability of the parity checks. Extensive simulations are provided to demonstrate the efficiency of the proposed algorithm. Simulation results show that the proposed algorithm can achieve about 1.6 dB coding gain improvement at BER=10−5 while reducing up to 53% iterations for decoding and maintaining low-decoding complexity, compared with the conventional weighted BF algorithm.

IET Communications•Nov 27, 2012•10 citations

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
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.
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.
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.
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.
This paper proposes a modified weighted violation-based bit-flipping decoding algorithm for LDPC codes, and no soft information is required for decoding, Futhermore, in order to reduce the average number of iterations and decoding complexity, the threshold of judgement is set. Simulation results show that this modified algorithm could achieve much less number of iterations and better performance as compared with several soft-decision bit-flipping decoding algorithms for LDPC codes with large girth and low code rate.
In this study, a new method for improving hard-decision bit-flipping (BF) decoding is proposed for low-density parity-check codes. The flipping criterion is derived theoretically from the soft-decision belief-propagation decoding algorithm. The proposed BF decoding algorithm is channel independent and is improved by introducing a more efficient method for computing the reliability of the parity checks. Extensive simulations are provided to demonstrate the efficiency of the proposed algorithm. Simulation results show that the proposed algorithm can achieve about 1.6 dB coding gain improvement at BER=10−5 while reducing up to 53% iterations for decoding and maintaining low-decoding complexity, compared with the conventional weighted BF algorithm.
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.