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

Video Engineering

Revised Hard-decision Decoding of LDPC Codes

Hongwei Li

Published Jan 1, 2013• 0 citations
OpenAlex

Abstract

Bit-flipping decoding algorithm and its improved version weighted bit-flipping decoding algorithm are usually used to realize the hard-decision decoding of LDPC codes.But the performance of BF decoding algorithm is not good enough,and WBF decoding algorithm is complicated.A revised hard-decision decoding of LDPC codes to have a good tradeoff between complexity and decoding performance is introduced in this paper.The algorithm can make multiple bits flip in the first two iteration.The simulation results demonstrate the revised algorithm supplies a slightly inferior BER performance,but a significant reduction of the complexity.

Related papers

An efficient bit-flipping decoding algorithm for LDPC codes

Tso-Cho Chen

In this paper, 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.5dB coding gain improvement at BER = 5×10−6while reducing up to 48% iterations for decoding and maintaining low decoding complexity, compared with the conventional weighted BF algorithm.

Cross Strait Quad-Regional Radio Science and Wireless Technology Conference (CSQRWC)•Jul 1, 2012•6 citations

Weighted bit-flipping decoding for product LDPC codes

Sirawit Khittiwitchayakul, Watid Phakphisut, Pornchai Supnithi

In this work, we propose a weighted bit-flipping (WBF) decoding for product LDPC codes of which decoding complexity is lower than the belief-propagation (BP) decoding. Two distinct types based on page computations and row/column computations are proposed. In addition, we address an issue of hard decision algorithm for product LDPC codes suffering a performance degradation at high iteration numbers. We introduce a threshold of flipped bits to adjust the performance at high iterations. Although the performances of both proposed decoding are worse than that of the BP algorithm, it greatly reduces the decoding complexity.

International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON)•Jun 1, 2016•3 citations

Improved Bit-Flipping Method for Decoding Structured Low-Density Parity-Check Codes

Meiling Zhang

An improved bit-flipping(BF) algorithm with low complexity for decoding structured low-density parity-check codes(LDPC) is proposed to improve the performance of the hard-decision BF algorithm.The hard-decision bits are divided into two groups based on the magnitudes of the received symbols,and at each iteration,the proposed algorithm can flip more than one bit with using two thresholds,and the flipping error probability is effectively decreased.The improved BF algorithm requires some real number comparisons before iterations and requires only logical operations during the iterations.Compared with the weighted bit-flipping algorithm and its modifications,the new method is with significantly lower complexity.Simulations show that the proposed algorithm is provided with very fast convergence speed and excellent performance with significantly low complexity.

Beijing Youdian Xueyuan xuebao•Jan 1, 2012•0 citations

New Weighted Bit-Flipping Decoding Algorithm for LDPC Codes

Zi-jian Dong, Tiecheng Song

Several Weighted BF (WBF) algorithms are investigated in this paper, and a novel modified reliability-ratio based WBF (MRWBF) decoding algorithm for LDPC codes is proposed.WBF algorithm considers the influence of parity information on the error metric.Based on WBF, the improved WBF (IWBF) algorithm further uses the feature of message reliability on the symbol decision.The reliability-ratio based WBF (RRWBF) can eliminate the defect of requiring off-line pre-processing in IWBF.Our proposed MRWBF further removes the step of calculating normalized weighted parameters in RRWBF and achieves more reduction in decoding complexity.The results of simulations show that the proposed algorithm is feasible, effective, and can achieve good decoding performance.

Advances in intelligent systems research/Advances in Intelligent Systems Research•Jan 1, 2013•4 citations

Weighted candidate bit based bit-flipping decoding algorithms for LDPC codes

Zhu Qing, Lenan Wu

In order to improve the bit-flipping (BF) decoding algorithms, a weighted hard-decision based BF decoding algorithm for low-density parity-check (LDPC) codes is presented, in which the weights of variable-nodes are employed. A new metric is defined for the weight of candidate bits not only in unsatisfied parity check equations but also in satisfied ones. The connection between min-sum decoding algorithm and the proposed algorithm is presented. Simulation results show that the new decoding algorithm can provide better FER performance and faster convergence speed than the original candidate bit based bit-flipping (CBBF) algorithm.

International Conference on Consumer Electronics, Communications and Networks (CECNet)•Nov 1, 2013•4 citations

Hard-Decision Bit-Flipping Decoder Based on Adaptive Bit-Local Threshold for LDPC Codes

Yuanhua Liu, Meiling Zhang

This letter presents two novel adaptive bit-local threshold bit-flipping algorithms for improving the hard-decision decoding performance of LDPC codes. The threshold of each bit can be changed adaptively to maximize the number of corrected errors during the iterations. The proposed methods require only logical operations during decoding and can be realized easily by hardware. Compared with the existing adaptive threshold BF algorithm, the proposed algorithms achieve better performance while removing the need for the delay-inducing global maximum operations, thus facilitating high-throughput decoding.

IEEE Communications Letters•Apr 4, 2019•18 citations
Bit-flipping decoding algorithm and its improved version weighted bit-flipping decoding algorithm are usually used to realize the hard-decision decoding of LDPC codes.But the performance of BF decoding algorithm is not good enough,and WBF decoding algorithm is complicated.A revised hard-decision decoding of LDPC codes to have a good tradeoff between complexity and decoding performance is introduced in this paper.The algorithm can make multiple bits flip in the first two iteration.The simulation results demonstrate the revised algorithm supplies a slightly inferior BER performance,but a significant reduction of the complexity.
In this paper, 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.5dB coding gain improvement at BER = 5×10−6while reducing up to 48% iterations for decoding and maintaining low decoding complexity, compared with the conventional weighted BF algorithm.
In this work, we propose a weighted bit-flipping (WBF) decoding for product LDPC codes of which decoding complexity is lower than the belief-propagation (BP) decoding. Two distinct types based on page computations and row/column computations are proposed. In addition, we address an issue of hard decision algorithm for product LDPC codes suffering a performance degradation at high iteration numbers. We introduce a threshold of flipped bits to adjust the performance at high iterations. Although the performances of both proposed decoding are worse than that of the BP algorithm, it greatly reduces the decoding complexity.
An improved bit-flipping(BF) algorithm with low complexity for decoding structured low-density parity-check codes(LDPC) is proposed to improve the performance of the hard-decision BF algorithm.The hard-decision bits are divided into two groups based on the magnitudes of the received symbols,and at each iteration,the proposed algorithm can flip more than one bit with using two thresholds,and the flipping error probability is effectively decreased.The improved BF algorithm requires some real number comparisons before iterations and requires only logical operations during the iterations.Compared with the weighted bit-flipping algorithm and its modifications,the new method is with significantly lower complexity.Simulations show that the proposed algorithm is provided with very fast convergence speed and excellent performance with significantly low complexity.
Several Weighted BF (WBF) algorithms are investigated in this paper, and a novel modified reliability-ratio based WBF (MRWBF) decoding algorithm for LDPC codes is proposed.WBF algorithm considers the influence of parity information on the error metric.Based on WBF, the improved WBF (IWBF) algorithm further uses the feature of message reliability on the symbol decision.The reliability-ratio based WBF (RRWBF) can eliminate the defect of requiring off-line pre-processing in IWBF.Our proposed MRWBF further removes the step of calculating normalized weighted parameters in RRWBF and achieves more reduction in decoding complexity.The results of simulations show that the proposed algorithm is feasible, effective, and can achieve good decoding performance.
In order to improve the bit-flipping (BF) decoding algorithms, a weighted hard-decision based BF decoding algorithm for low-density parity-check (LDPC) codes is presented, in which the weights of variable-nodes are employed. A new metric is defined for the weight of candidate bits not only in unsatisfied parity check equations but also in satisfied ones. The connection between min-sum decoding algorithm and the proposed algorithm is presented. Simulation results show that the new decoding algorithm can provide better FER performance and faster convergence speed than the original candidate bit based bit-flipping (CBBF) algorithm.
This letter presents two novel adaptive bit-local threshold bit-flipping algorithms for improving the hard-decision decoding performance of LDPC codes. The threshold of each bit can be changed adaptively to maximize the number of corrected errors during the iterations. The proposed methods require only logical operations during decoding and can be realized easily by hardware. Compared with the existing adaptive threshold BF algorithm, the proposed algorithms achieve better performance while removing the need for the delay-inducing global maximum operations, thus facilitating high-throughput decoding.