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 Transactions on Communications

An improved decoding algorithm for finite-geometry LDPC codes

Telex M. N. Ngatched, Fambirai Takawira, Martin Bossert

Published Feb 1, 2009• 27 citations
Publisher

Abstract

In this letter, an improved bit-flipping decoding algorithm for high-rate finite-geometry low-density parity-check (FG-LDPC) codes is proposed. Both improvement in performance and reduction in decoding delay are observed by flipping multiple bits in each iteration. Our studies show that the proposed algorithm achieves an appealing tradeoff between performance and complexity for FG-LDPC codes.

DOI
10.1109/tcomm.2009.02.060352

Related papers

A Modified Bit-Flipping Decoding Algorithm for Low-Density Parity-Check Codes

Telex M. N. Ngatched, Fambirai Takawira, Martin Bossert

In this paper, a modified bit-flipping decoding algorithm for low-density parity-check (LDPC) codes is proposed. Both improvement in performance and reduction in decoding delay are observed by flipping multiple bits in each iteration. Our studies show that the proposed algorithm achieves an appealing tradeoff between performance and complexity for many constructions of LDPC codes.

International Conference on Communications•Jun 1, 2007•11 citations

A Decoding Algorithm for Finite-Geometry LDPC Codes

Zhouding Liu, Dimitris A. Pados

In this paper, we develop a new low-complexity algorithm to decode low-density parity-check (LDPC) codes. The developments are oriented specifically toward low-cost, yet effective, decoding of (high-rate) finite-geometry (FG) LDPC codes. The decoding procedure updates iteratively the hard-decision received vector in search of a valid codeword in the vector space. Only one bit is changed in each iteration, and the bit-selection criterion combines the number of failed checks and the reliability of the received bits. Prior knowledge of the signal amplitude and noise power is not required. An optional mechanism to avoid infinite loops in the search is also proposed. Our studies show that the algorithm achieves an appealing tradeoff between performance and complexity for FG-LDPC codes.

IEEE Transactions on Communications•Mar 1, 2005•74 citations

A Decoding Algorithm for Finite-Geometry LDPC Codes

We develop a new low-complexity algorithm to decode low-density parity-check (LDPC) codes. The developments are oriented specifically toward low cost, yet effective, decoding of (high-rate) finite-geometry LDPC codes. The decoding procedure iteratively updates the hard-decision received vector in search of a valid codeword in the vector space. Only one bit is changed in each iteration, and the bit-selection criterion combines the number of failed checks and the reliability of the received bits. Prior knowledge of the signal amplitude and noise power is not required. An optional mechanism to avoid infinite loops in the search is also proposed. Our studies show that the algorithm achieves an appealing tradeoff between performance and complexity for finite-geometry LDPC codes.

IEEE Transactions on Communications•Feb 1, 2005•2 citations

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

Low complexity decoding of finite geometry LDPC codes

Zhenyu Liu, Dimitris A. Pados

We develop a new low complexity algorithm for decoding low-density parity-check (LDPC) codes. The developments are oriented specifically toward the low cost-yet effective-decoding of (high rate) finite geometry LDPC codes. The decoding procedure updates the hard-decision received vector iteratively in search of a valid codeword in the vector space. Only one bit is changed in each iteration and the bit selection criterion combines the number of failed checks and the reliability of the received bits. Prior knowledge of the signal amplitude and noise power is not required. An optimal mechanism to avoid infinite loops in the search is also proposed. Our studies show that the algorithm achieves an appealing performance versus complexity trade-off for finite geometry LDPC codes.

International Conference on Communications•Mar 30, 2004•16 citations

Improved parallel weighted bit-flipping decoding algorithm for LDPC codes

Guanchang Li, G. Feng

Aiming at seeking a low-complexity decoder with fast decoding convergence speed for short or medium low-density parity-check (LDPC) codes, an improved parallel weighted bit-flipping (IPWBF) algorithm, which is applied flexibly for two classes of codes is presented here. For LDPC codes with low column weight in their parity check matrix, both bootstrapping and loop detection procedures, described in the existing literature, are included in IPWBF. Furthermore, a novel delay-handling procedure is introduced to prevent the codeword bits of high reliability from being flipped too hastily. For large column weight finite geometry LDPC codes, only the delay-handling procedure is included in IPWBF to show its effectiveness. Extensive simulation results demonstrate that the proposed algorithm achieves a good tradeoff between performance and complexity.

IET Communications•Jan 7, 2009•13 citations
In this letter, an improved bit-flipping decoding algorithm for high-rate finite-geometry low-density parity-check (FG-LDPC) codes is proposed. Both improvement in performance and reduction in decoding delay are observed by flipping multiple bits in each iteration. Our studies show that the proposed algorithm achieves an appealing tradeoff between performance and complexity for FG-LDPC codes.
In this paper, we develop a new low-complexity algorithm to decode low-density parity-check (LDPC) codes. The developments are oriented specifically toward low-cost, yet effective, decoding of (high-rate) finite-geometry (FG) LDPC codes. The decoding procedure updates iteratively the hard-decision received vector in search of a valid codeword in the vector space. Only one bit is changed in each iteration, and the bit-selection criterion combines the number of failed checks and the reliability of the received bits. Prior knowledge of the signal amplitude and noise power is not required. An optional mechanism to avoid infinite loops in the search is also proposed. Our studies show that the algorithm achieves an appealing tradeoff between performance and complexity for FG-LDPC codes.
We develop a new low-complexity algorithm to decode low-density parity-check (LDPC) codes. The developments are oriented specifically toward low cost, yet effective, decoding of (high-rate) finite-geometry LDPC codes. The decoding procedure iteratively updates the hard-decision received vector in search of a valid codeword in the vector space. Only one bit is changed in each iteration, and the bit-selection criterion combines the number of failed checks and the reliability of the received bits. Prior knowledge of the signal amplitude and noise power is not required. An optional mechanism to avoid infinite loops in the search is also proposed. Our studies show that the algorithm achieves an appealing tradeoff between performance and complexity for finite-geometry LDPC codes.
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.
We develop a new low complexity algorithm for decoding low-density parity-check (LDPC) codes. The developments are oriented specifically toward the low cost-yet effective-decoding of (high rate) finite geometry LDPC codes. The decoding procedure updates the hard-decision received vector iteratively in search of a valid codeword in the vector space. Only one bit is changed in each iteration and the bit selection criterion combines the number of failed checks and the reliability of the received bits. Prior knowledge of the signal amplitude and noise power is not required. An optimal mechanism to avoid infinite loops in the search is also proposed. Our studies show that the algorithm achieves an appealing performance versus complexity trade-off for finite geometry LDPC codes.
Aiming at seeking a low-complexity decoder with fast decoding convergence speed for short or medium low-density parity-check (LDPC) codes, an improved parallel weighted bit-flipping (IPWBF) algorithm, which is applied flexibly for two classes of codes is presented here. For LDPC codes with low column weight in their parity check matrix, both bootstrapping and loop detection procedures, described in the existing literature, are included in IPWBF. Furthermore, a novel delay-handling procedure is introduced to prevent the codeword bits of high reliability from being flipped too hastily. For large column weight finite geometry LDPC codes, only the delay-handling procedure is included in IPWBF to show its effectiveness. Extensive simulation results demonstrate that the proposed algorithm achieves a good tradeoff between performance and complexity.