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

European Signal Processing Conference (EUSIPCO)

Bit-Flipping Post-Processing For Forced Convergence Decoding Of Ldpc Codes

Ernesto Zimmermann, Prakash Pattisapu, Gerhard Paul Fettweis

Published Sep 8, 2005• 13 citations
Publisher

Abstract

Publication in the conference proceedings of EUSIPCO, Antalya, Turkey, 2005
DOI
10.5281/zenodo.39191

Related papers

High-Precision Ldpc Codes Decoding At The Lowest Complexity

Luca Fanucci, L''Insalata, Nicola, Francesco Rossi +1 more

Publication in the conference proceedings of EUSIPCO, Florence, Italy, 2006

European Signal Processing Conference (EUSIPCO)•Sep 4, 2006•6 citations

Adaptive Sub-Optimal Bit Flipping Decoding Algorithm for LDPC

S. Ashwin Kumar, R. Aravinthan, Ch. Sriram Reddy +2 more

Lecture notes on data engineering and communications technologies•Jan 1, 2021•0 citations

The Syndrome Bit Flipping Algorithm for LDPC Codes

Emmanuel Boutillon, Chris Winstead, Fakhreddine Ghaffari

Performance of LDPC decoders at high SNR is dominated by trapping sets that induce an error floor in the performance curve. We propose a new algorithm that resolves trapping sets and lowers the error floor. The new algorithm, called Syndrome Bit Flipping (SBF), computes the sum of adjacent parity violations at each symbol node. Bits are flipped by comparing the syndrome sum against a time-varying threshold called the decoding key. SBF is compared to other bit-flipping decoders on the Binary Symmetric Channel (BSC), and is demonstrated as a post-processing step for a Noisy Gradient Descent Bit-Flipping (NGDBF) hardware decoder. We demonstrate the post-processing method for an LDPC code defined in the 802.3an standard, and find that the frame error rate is improved by at least two orders of magnitude, even as the required iterations are reduced by 33%.

IEEE Communications Letters•May 1, 2023•10 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

Error Correction Capability of LDPC Codes Under the Bit-Flipping Decoding Algorithm

Hiroto Tamiya, Masanori Hirotomo, Masakatu Morii

IEICE Technical Report; IEICE Tech. Rep.•Jul 6, 2015•1 citation

Low-Complexity Symbol-Flipping Decoding Algorithms for Nonbinary LDPC Codes

박성현

•Jan 1, 2018•0 citations
Performance of LDPC decoders at high SNR is dominated by trapping sets that induce an error floor in the performance curve. We propose a new algorithm that resolves trapping sets and lowers the error floor. The new algorithm, called Syndrome Bit Flipping (SBF), computes the sum of adjacent parity violations at each symbol node. Bits are flipped by comparing the syndrome sum against a time-varying threshold called the decoding key. SBF is compared to other bit-flipping decoders on the Binary Symmetric Channel (BSC), and is demonstrated as a post-processing step for a Noisy Gradient Descent Bit-Flipping (NGDBF) hardware decoder. We demonstrate the post-processing method for an LDPC code defined in the 802.3an standard, and find that the frame error rate is improved by at least two orders of magnitude, even as the required iterations are reduced by 33%.
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.