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

IEEE International Conference on Communication Technology (ICCT)

A Improved Decoding Algorithm for Low-Density Parity-Check Codes

Wei Zhou, Aidong Men, Liye Zhao, Quan Zi-yi

Published Nov 1, 2006• 0 citations
Publisher

Abstract

Based on decoding performance, complexity and latency of finite-geometry low-density parity-check (LDPC) codes, an efficient decoding algorithm is proposed. The algorithm is a hybrid bit-flipping (BF)/majority-logic (MLG) algorithm. In the algorithm, there are two stages. At the first stage, a code is decoded with bit-flipping (BF) with a small fixed number of iterations. Then the output from bit-flipping (BF) decoder is decoded by majority-logic (MLG) decoding. And in bit-flipping (BF) decoding, a new method is used to find the least reliable position. In the hybrid algorithm, there aren't real operations. Simulation results show that the algorithm provides 0.3dB coding gain over weight bit-flipping (WBF) decoding, and within 1 dB away from sum-product algorithm (SPA) decoding.

DOI
10.1109/icct.2006.341793

Related papers

An Efficient Decoding Algorithm for Finite-Geometry Low-Density Parity-Check Codes

Quan Zi-yi

Based on decoding performance,complexity and latency of finite-geometry low-density parity-check(FG-LDPC) codes,an efficient decoding algorithm is proposed.The new algorithm is a hybrid bit-flipping(BF)/majority-logic(MLG) decoding scheme.In BF decoding,an efficient method was explored to measure the reliability of the checks.At the completion of a small number of iterations,the output from BF decoding is decoded by MLG decoding.In the hybrid algorithm,there are no float operations.Simulation results show that the hybrid algorithm can provide 0.3?dB coding gain over weight bit-flipping(WBF) decoding.

Beijing Youdian Xueyuan xuebao•Jan 1, 2007•0 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

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

An Improved Iterative Bit-flipping Decoding Algorithm for Low-density Parity-check Codes

Meiling Zhang

An improved iterative bit-flipping(BF) algorithm adapted for decoding low-density parity-check(LDPC) codes is proposed to improve the performance of the hard-decision BF decoding algorithm.The new algorithm uses an alternating threshold pattern to determine the bits whether to be flipped or not,and the flipping error probability is effectively decreased.Simulation results show that compared with BF algorithm,the improved BF algorithm improves both the error-correction performance and the convergence speed while maintaining the low computational complexity.

Telecommunication Engineering•Jan 1, 2012•0 citations

An Improved Multi-bit Flipping Algorithm for LDPC Decoding

Lan Tang

The bit-flipping(BF) algorithm of low density parity check(LDPC) code has low computation complexity and great practicability.On the basis of studying simple BF,WBF and RRWBF,an improved BF algorithm is proposed on considering the reliability ratio and absolute value of symbol.The proposed algorithm flips more than one bit in each iteration.Simulation results indicate that compared with RRWBF,the error rate of the proposed algorithm with 5 dB is improved from 10-3 to 10-4.

Modern Electronics Technique•Jan 1, 2011•0 citations

Two-bit bit-flipping algorithm for decoding low-density parity-check codes based on syndrome weight

Hua Li, Liangjun Xiang, Linhua Zheng

In this paper, a novel two-bit bit-flipping (BF) decoding algorithm is proposed for low-density parity-check (LDPC) codes. The proposed algorithm flips two bits per iteration based on the syndrome-weight metric. Since the algorithm requires only logical operations during the iterations. The proposed tow-bit BF algorithm has low complexity. Simulation results show that the proposed algorithm has faster convergence speed and about 0.2 dB gain compared to standard BF decoding algorithm.

International Conference on Optical Communications and Networks (ICOCN)•Sep 1, 2016•0 citations
Based on decoding performance, complexity and latency of finite-geometry low-density parity-check (LDPC) codes, an efficient decoding algorithm is proposed. The algorithm is a hybrid bit-flipping (BF)/majority-logic (MLG) algorithm. In the algorithm, there are two stages. At the first stage, a code is decoded with bit-flipping (BF) with a small fixed number of iterations. Then the output from bit-flipping (BF) decoder is decoded by majority-logic (MLG) decoding. And in bit-flipping (BF) decoding, a new method is used to find the least reliable position. In the hybrid algorithm, there aren't real operations. Simulation results show that the algorithm provides 0.3dB coding gain over weight bit-flipping (WBF) decoding, and within 1 dB away from sum-product algorithm (SPA) decoding.
Based on decoding performance,complexity and latency of finite-geometry low-density parity-check(FG-LDPC) codes,an efficient decoding algorithm is proposed.The new algorithm is a hybrid bit-flipping(BF)/majority-logic(MLG) decoding scheme.In BF decoding,an efficient method was explored to measure the reliability of the checks.At the completion of a small number of iterations,the output from BF decoding is decoded by MLG decoding.In the hybrid algorithm,there are no float operations.Simulation results show that the hybrid algorithm can provide 0.3?dB coding gain over weight bit-flipping(WBF) decoding.
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.
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.
An improved iterative bit-flipping(BF) algorithm adapted for decoding low-density parity-check(LDPC) codes is proposed to improve the performance of the hard-decision BF decoding algorithm.The new algorithm uses an alternating threshold pattern to determine the bits whether to be flipped or not,and the flipping error probability is effectively decreased.Simulation results show that compared with BF algorithm,the improved BF algorithm improves both the error-correction performance and the convergence speed while maintaining the low computational complexity.