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

Wireless Personal Communications

An Improved Low Complex Hybrid Weighted Bit-Flipping Algorithm for LDPC Codes

Michaelraj Kingston Roberts, Ramesh Jayabalan

Published Nov 23, 2014• 7 citations
Publisher
DOI
10.1007/s11277-014-2210-4

Related papers

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

Ehsan Olyaei Torshizi, Mohammad Amir Nazari Siahsar, Ali Akbar Khazaei +1 more

Journal of advances in computer research•Feb 1, 2018•0 citations

Hybrid weighted symbol-flipping decoding for nonbinary LDPC codes

刘冰, Tao -, Wei Wei +4 more

高技术通讯：英文版•Jan 1, 2013•2 citations

A new hybrid decoding algorithm for LDPC codes based on the improved variable multi weighted bit-flipping and BP algorithms

Ehsan Olyaei Torshizi, Hossein Sharifi, Meysam Seyrafi

In this paper, a new two-stage hybrid algorithm for decoding Low-Density Parity-Check (LDPC) codes is proposed that incorporates two iterative decoding. For the first stage of decoding, we offer a new decoding algorithm called Improved Variable Multi Weighted Bit-Flipping (IVMWBF) algorithm. Since the IVMWBF algorithm is based on the idea of flipping variable multi bits in each iteration, both improvement in performance and reduction in iteration number and computational complexity are observed in this algorithm. The proposed hybrid algorithm which is a combination of the IVMWBF and BP algorithms, while having a performance exactly similar to that of the BP algorithm, has less complexity compared to that algorithm.

Iranian Conference on Electrical Engineering•May 1, 2013•10 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

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

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
In this paper, a new two-stage hybrid algorithm for decoding Low-Density Parity-Check (LDPC) codes is proposed that incorporates two iterative decoding. For the first stage of decoding, we offer a new decoding algorithm called Improved Variable Multi Weighted Bit-Flipping (IVMWBF) algorithm. Since the IVMWBF algorithm is based on the idea of flipping variable multi bits in each iteration, both improvement in performance and reduction in iteration number and computational complexity are observed in this algorithm. The proposed hybrid algorithm which is a combination of the IVMWBF and BP algorithms, while having a performance exactly similar to that of the BP algorithm, has less complexity compared to that algorithm.
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.