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

Lecture notes in electrical engineering

Reliability-Based Single Bit-Flipping Decoding Algorithm for LDPC Codes

Soufian Addi, Mostafa Belkasmi, Ahlam Berkani, Ahmed Azouaoui

Published Jan 1, 2024• 0 citations
Publisher
DOI
10.1007/978-981-99-9833-3_16

Related papers

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

A self-normalized weighted bit-flipping decoding algorithm for LDPC codes

Chunli Wang, Xiaofu Wu, Wei‐Ping Zhu

A novel self-normalized weighted bit-flipping (SNWBF) decoding algorithm for low-density parity-check (LDPC) codes is proposed. Compared to the best known weighted bit-flipping decoding, the SNWBF algorithm converges significantly faster but with little performance penalty. For decoding of LDPC codes, the proposed SNWBF algorithm considers not only the reliability of the neighboring check nodes, but also the reliability of each variable node. Compared to the IMWBF algorithm, the proposed algorithm does not require multiplicative normalization and performs even better.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 1, 2016•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

Reliability Ratio Based Weighted Bit-Flipping Decoding for LDPC codes

Feng Guo, L. Hanzo

In this contribution, a novel reliability-ratio based weighted bit-flipping (RRWBF) algorithm is proposed for decoding low density parity check (LDPC) codes. The RRWBF algorithm proposed is benchmarked against the conventional weighted bit-flipping (WBF) algorithm and the improved weighted bit-flipping (IWBF) algorithm. More than 1 and 2 dB coding gain was achieved at a BER of 10/sup -5/ while invoking the RRWBF algorithm in comparison to the two benchmarking schemes, when communicating over an AWGN and an uncorrelated Rayleigh channel, respectively. Furthermore, the decoding complexity of the proposed RRWBF algorithm is maintained at the same level as that of the conventional WBF algorithm.

IEEE Vehicular Technology Conference•Dec 10, 2005•15 citations

n Improved Multi-Bit Threshold Flipping LDPC Decoding Algorithm

Lina Zhang, Zhihui Ye, Qi Feng

International Journal of Computer Theory and Engineering•May 5, 2014•4 citations

Check of Reliability-Based Bit-Flipping Decoding Algorithm for LDPC Codes

Xia Chen

In this paper,a check of reliability-based bit-flipping(Check Reliability-based Bit Flipping,CR-BF) decoding algorithm for Low Density Parity Check(LDPC) Code is proposed.The CR-BF algorithm flips bits based on the reliability of parity-check equations.Then the number of error parity-check equations is considered to flip more than 1 bit in each iteration.Simulation results show that the proposed algorithms converge faster and achieve better performance.

Journal of Beijing Jiaotong University•Jan 1, 2008•0 citations
A novel self-normalized weighted bit-flipping (SNWBF) decoding algorithm for low-density parity-check (LDPC) codes is proposed. Compared to the best known weighted bit-flipping decoding, the SNWBF algorithm converges significantly faster but with little performance penalty. For decoding of LDPC codes, the proposed SNWBF algorithm considers not only the reliability of the neighboring check nodes, but also the reliability of each variable node. Compared to the IMWBF algorithm, the proposed algorithm does not require multiplicative normalization and performs even better.
In this contribution, a novel reliability-ratio based weighted bit-flipping (RRWBF) algorithm is proposed for decoding low density parity check (LDPC) codes. The RRWBF algorithm proposed is benchmarked against the conventional weighted bit-flipping (WBF) algorithm and the improved weighted bit-flipping (IWBF) algorithm. More than 1 and 2 dB coding gain was achieved at a BER of 10/sup -5/ while invoking the RRWBF algorithm in comparison to the two benchmarking schemes, when communicating over an AWGN and an uncorrelated Rayleigh channel, respectively. Furthermore, the decoding complexity of the proposed RRWBF algorithm is maintained at the same level as that of the conventional WBF algorithm.