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

Algoritmos de decodificação abrupta para códigos LDGM

Fernando Pujaico Rivera

Published Jun 3, 2011• 0 citations
Publisher

Abstract

Since Gallager introduced Bit-Flipping (BF ) decoding with hard-decision for Low-Density Parity-Check Codes (LDP C), other two variants were proposed by Sipser and Spielman for expander codes.Later, a soft-decision version of BF decoding, known as Modified Weighted BF (MW BF ) decoding, was investigated.This thesis proposes modified versions of Sipser and Spielman algorithms.Simulation results for long systematic Low-Density Generator Matrix (LDGM) codes show a better performance of the proposed versions.Moreover, for moderate length systematic LDGM codes, simulation results show performance similar to that of MWBF decoding with the advantage of not requiring floating-point operations.

DOI
10.47749/t/unicamp.2011.804563

Related papers

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

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

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 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

Modified Bit-Flipping Decoding of Low-Density Parity-Check Codes

Yuan Hua Liu, Mei Ling Zhang

A novel bit-flipping (BF) algorithm with low complexity for high-throughput decoding of low-density parity-check (LDPC) codes is presented. At each iteration, a novel threshold pattern is used to determine the code bits whether to be flipped or not, and the flipping error probability is effectively decreased. Compared with the weighted BF algorithm and its modifications, the modified BF algorithm has significantly lower complexity and decoding time. Through simulations the proposed BF algorithm is shown to achieve excellent performance and fast convergence speed while maintaining significantly low complexity thus facilitating high-throughput decoding.

Advanced materials research•Jun 1, 2013•0 citations

Multi-Stage Bit-Flipping Decoding Algorithms for LDPC Codes

Tofar C.-Y. Chang, Pin-Han Wang, Yu T. Su

We present two general multi-stage (MS) bit-flipping (BF) decoding algorithms for low-density parity-check (LDPC) codes. Both algorithms consist of soft-decision (SD) and hard-decision BF decoding parts. In comparison with known MS LDPC decoders, our approach is much simpler as all stages share the same BF structure. The only complexity increase is due to the use of an adaptive stage-switching (SS) mechanism which gives near-optimal SS timing. A new design issue we address is that the first-stage algorithm's parameter has to be re-tuned to achieve the optimal overall performance. The numerical results demonstrate that the proposed decoding methods can significantly improve the error-rate performance of the conventional SD BF decoders.

IEEE Communications Letters•Jun 20, 2019•16 citations
Since Gallager introduced Bit-Flipping (BF ) decoding with hard-decision for Low-Density Parity-Check Codes (LDP C), other two variants were proposed by Sipser and Spielman for expander codes.Later, a soft-decision version of BF decoding, known as Modified Weighted BF (MW BF ) decoding, was investigated.This thesis proposes modified versions of Sipser and Spielman algorithms.Simulation results for long systematic Low-Density Generator Matrix (LDGM) codes show a better performance of the proposed versions.Moreover, for moderate length systematic LDGM codes, simulation results show performance similar to that of MWBF decoding with the advantage of not requiring floating-point operations.
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 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.
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 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.
A novel bit-flipping (BF) algorithm with low complexity for high-throughput decoding of low-density parity-check (LDPC) codes is presented. At each iteration, a novel threshold pattern is used to determine the code bits whether to be flipped or not, and the flipping error probability is effectively decreased. Compared with the weighted BF algorithm and its modifications, the modified BF algorithm has significantly lower complexity and decoding time. Through simulations the proposed BF algorithm is shown to achieve excellent performance and fast convergence speed while maintaining significantly low complexity thus facilitating high-throughput decoding.
We present two general multi-stage (MS) bit-flipping (BF) decoding algorithms for low-density parity-check (LDPC) codes. Both algorithms consist of soft-decision (SD) and hard-decision BF decoding parts. In comparison with known MS LDPC decoders, our approach is much simpler as all stages share the same BF structure. The only complexity increase is due to the use of an adaptive stage-switching (SS) mechanism which gives near-optimal SS timing. A new design issue we address is that the first-stage algorithm's parameter has to be re-tuned to achieve the optimal overall performance. The numerical results demonstrate that the proposed decoding methods can significantly improve the error-rate performance of the conventional SD BF decoders.