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

IEICE Technical Report; IEICE Tech. Rep.

Performance Comparison of 3bit Decoding Algorithm having Bias Terms with other Bit Flipping Algorithms

Hiroshi Ono, Hiroshi Kamabe

Published Jan 13, 2012• 0 citations
OpenAlex

Related papers

BER Performance Comparison of Bit Flipping Algorithms used for Decoding of LDPC Codes

G Pavithra, M Naveen Kumar

•Jan 6, 2015•0 citations

BER Performance Comparison of Bit Flipping Algorithms used for Decoding of LDPC Codes

G. Pavithra, Naveen Kumar M.

International Journal of Engineering Research and•Jun 1, 2015•1 citation

Simple improvements of bit-flipping decoding

Hiroshi Kamabe, Shusaku Kobota

A bit-flipping (BF) algorithm is a decoding algorithm for LDPC codes that can be efficiently implemented by electronic circuits. Although its error correcting performance is rather poor, we show that a BF algorithm with bias terms has good error correcting performance. We also introduce two more parameters to improve the performance further. We also propose a variant of candidate bit based BF (CBBF) algorithm by introducing bias terms. We see that these algorithms having bias terms exhibit very good error correcting performances.

International Conference on Advanced Communication Technology•Jan 1, 2010•4 citations

Performance Evaluation of a Combination of Sum-Product and Two-bit Bit Flipping Decoding Algorithms

Koh Matsushita, Hiroshi Kamabe

IEICE Technical Report; IEICE Tech. Rep.•Feb 28, 2013•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

Bit-Flipping LDPC Decoding Algorithm for Optical Fiber Communication Systems

Oulfa Laouar, Imed Amamra, Nadir Derouiche

The increasing popularity of optical communication systems emphasizes the need for effective errorcorrection solutions, including high-efficiency hardware decoder designs and codes with strong performance. Within optical communication networks, Low-Density Parity-Check (LDPC) codes utilizing sparse matrices and decoded through the Bit-Flipping (BF) algorithm, known for its hard iterative decoding approach are extensively utilized. These codes effectively balance decoding complexity with error-correction performance.This paper focuses on comparing the optical performance of LDPC codes with and without the BF decoding algorithm using two simulation software packages: MATLAB and OptiSystem 7.0. The comparison is conducted across different wavelengths and quality factors. Through this study, we evaluate the advantages of LDPC codes in terms of error-rate reduction and enhancing the reliability of optical transmission.

International Conference on Advances in Electrical and Communication Technologies (ICAECOT)•Oct 1, 2024•0 citations
A bit-flipping (BF) algorithm is a decoding algorithm for LDPC codes that can be efficiently implemented by electronic circuits. Although its error correcting performance is rather poor, we show that a BF algorithm with bias terms has good error correcting performance. We also introduce two more parameters to improve the performance further. We also propose a variant of candidate bit based BF (CBBF) algorithm by introducing bias terms. We see that these algorithms having bias terms exhibit very good error correcting performances.
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
The increasing popularity of optical communication systems emphasizes the need for effective errorcorrection solutions, including high-efficiency hardware decoder designs and codes with strong performance. Within optical communication networks, Low-Density Parity-Check (LDPC) codes utilizing sparse matrices and decoded through the Bit-Flipping (BF) algorithm, known for its hard iterative decoding approach are extensively utilized. These codes effectively balance decoding complexity with error-correction performance.This paper focuses on comparing the optical performance of LDPC codes with and without the BF decoding algorithm using two simulation software packages: MATLAB and OptiSystem 7.0. The comparison is conducted across different wavelengths and quality factors. Through this study, we evaluate the advantages of LDPC codes in terms of error-rate reduction and enhancing the reliability of optical transmission.