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

Improvement of decoding algorithms for low-density parity-check codes

Junho Cho

Published Jan 1, 2010• 0 citations
OpenAlex

Related papers

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

Zhu Jin-kang

An improved bit-flipping decoding algorithm is proposed for low-density parity-check(LDPC) codes in this paper.Two influences on error probabilities of code bits are considered: the influence of the number of code bits included in an unsatisfied check,and the influence of the number of unsatisfied checks of each code bit.No soft information is required for decoding.Simulation results show that improvement on performance is observed for the proposed algorithm,and it provides better performance over several soft-decision bit-flipping decoding algorithms for LDPC codes with large girth.

Wireless Communication Technology•Jan 1, 2008•0 citations

Introduction of Low-density Parity-Check decoding Algorithm design

Florent Pirou

•Jan 1, 2004•1 citation

A Decoding Algorithm of Low-Density Parity-Check Codes Using Decisions of Erasure Correcting

Gou Hosoya, Toshiyasu Matsushima, Shigeichi Hirasawa

IEEE International Symposium on Information Theory (ISIT)•Nov 20, 2005•0 citations

Self reliability based weighted bit-flipping decoding for low-density parity-check codes

Jin Sha, Minglun Gao, Zhongjin Zhang +2 more

Abstract- Low Density Parity Check (LDPC) codes can be decoded in various ways, namely the Bit-Flipping (BF) algorithm, the Weighted BF algorithm (WBF) , the Belief Propagation (BP) algorithm and so on. These algorithms provide a wide range of tradeoffs among decoding complexity, decoding speed, and error rate performance. In this paper, a novel self-reliability-based weighted bit-flipping decoding scheme for low-density parity-check codes is proposed. Improvement in performance is observed in comparison with the modified weighted bit-flipping decoding scheme, and the decoding complexity can be significantly reduced as well. Key-Words:- Low-density parity-check (LDPC) codes, decoding algorithm, bit flipping, self reliability

International Conference on Instrumentation, Measurement, Circuits and Systems•Apr 16, 2006•3 citations

The Weighted Information Storage Bit-Flipping Decoder for Generalized LDPC Codes

Haobin Xu, Zhongfeng Wang, Suwen Song

By incorporating stronger component codes, generalized Low-Density-Parity-Check (GLDPC) codes significantly enhance error-correction capability. Bit-flipping (BF) algorithms are among the primary hard-decision decoding algorithms for GLDPC codes. However, existing BF algorithms for GLDPC still exhibit limited decoding performance. This paper proposes a Weighted Information Storage Bit-Flipping (WISBF) decoding algorithm for GLDPC codes with different types of component codes to improve the decoding performance, which introduces a two-stage energy-update strategy to reduce the percentage of erroneous flips and lower the average number of iterations. The simulation results demonstrate that the WISBF algorithm far outperforms the state-of-the-art Weighted Bit-Flip Voting (WBFV) on the tested GLDPC code, achieving an approximately three-order-of-magnitude improvement in frame-errorrate (FER). Moreover, the GLDPC codes with WISBF also achieve superior performance over their LDPC counterparts decoded using existing bit-flipping (BF) algorithms, including the Information Storage Bit-Flipping (ISBF) algorithm. We then present a detailed hardware architecture for the WISBF decoder. Synthesized under the TSMC $90-\mathrm{nm}$ technology, the proposed GLDPC WISBF decoder achieves $\mathbf{1 1 4. 3 \%}$ higher throughput than the GLDPC WBFV decoder.

IEEE International Conference on Electronics, Communications and Intelligent Science (ECIS)•May 22, 2026•0 citations

Decoding Algorithms for Low-Density Parity-Check Codes with Multilevel Modulations

Hisashi Futaki, Tomoaki Otsuki Ohtsuki

IEICE Transactions on Communications•May 1, 2004•0 citations
An improved bit-flipping decoding algorithm is proposed for low-density parity-check(LDPC) codes in this paper.Two influences on error probabilities of code bits are considered: the influence of the number of code bits included in an unsatisfied check,and the influence of the number of unsatisfied checks of each code bit.No soft information is required for decoding.Simulation results show that improvement on performance is observed for the proposed algorithm,and it provides better performance over several soft-decision bit-flipping decoding algorithms for LDPC codes with large girth.
Abstract- Low Density Parity Check (LDPC) codes can be decoded in various ways, namely the Bit-Flipping (BF) algorithm, the Weighted BF algorithm (WBF) , the Belief Propagation (BP) algorithm and so on. These algorithms provide a wide range of tradeoffs among decoding complexity, decoding speed, and error rate performance. In this paper, a novel self-reliability-based weighted bit-flipping decoding scheme for low-density parity-check codes is proposed. Improvement in performance is observed in comparison with the modified weighted bit-flipping decoding scheme, and the decoding complexity can be significantly reduced as well. Key-Words:- Low-density parity-check (LDPC) codes, decoding algorithm, bit flipping, self reliability
By incorporating stronger component codes, generalized Low-Density-Parity-Check (GLDPC) codes significantly enhance error-correction capability. Bit-flipping (BF) algorithms are among the primary hard-decision decoding algorithms for GLDPC codes. However, existing BF algorithms for GLDPC still exhibit limited decoding performance. This paper proposes a Weighted Information Storage Bit-Flipping (WISBF) decoding algorithm for GLDPC codes with different types of component codes to improve the decoding performance, which introduces a two-stage energy-update strategy to reduce the percentage of erroneous flips and lower the average number of iterations. The simulation results demonstrate that the WISBF algorithm far outperforms the state-of-the-art Weighted Bit-Flip Voting (WBFV) on the tested GLDPC code, achieving an approximately three-order-of-magnitude improvement in frame-errorrate (FER). Moreover, the GLDPC codes with WISBF also achieve superior performance over their LDPC counterparts decoded using existing bit-flipping (BF) algorithms, including the Information Storage Bit-Flipping (ISBF) algorithm. We then present a detailed hardware architecture for the WISBF decoder. Synthesized under the TSMC 90−nm90-\mathrm{nm}90−nm technology, the proposed GLDPC WISBF decoder achieves 114.3%\mathbf{1 1 4. 3 \%}114.3% higher throughput than the GLDPC WBFV decoder.