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

Iranian Conference on Electrical Engineering

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

Published May 1, 2013• 10 citations
Publisher

Abstract

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.

DOI
10.1109/iraniancee.2013.6599566

Related papers

Modified Iterative Two-Stage Hybrid Decoding Algorithm for Low-Density Parity-Check (LDPC) Codes

Hany R. Zeidan, Maha Mohamed Elsabrouty

This paper considers a modified iterative version of the two-stage hybrid algorithm for decoding low-density parity- check (LDPC) codes. The hybrid-decision scheme is a decoding scheme used that combines two iterative decoding algorithms for decoding LDPC codes. This scheme is suitable for many applications such as audio and video transmission that are sensitive to time. The hybrid-decision scheme mixes between the characteristics of the soft-decision decoding scheme and the hard- decision decoding scheme to reduce the computational complexity of the whole decoding algorithm. The modification proposed in this paper is applied to the implementation-efficient reliability ratio weighted bit-flipping (IERRWBF) algorithm which represents hard-decision scheme in the hybrid algorithm. This modification is capable of achieving better performance than that of the hybrid decoding algorithm with reducing the number of iterations required at each SNR and approaching more to the performance of the SPA. This reduction is more observable as the maximum number of iterations assigned for the algorithm increases or as the code length increases with improving the error performance as proved by simulation results.

IEEE Vehicular Technology Conference•Apr 1, 2009•8 citations

Two-stage WBF Algorithm for LDPC Codes based on Multi-/single-bit Switching Mechanism

Hua ZHOU, Rui Zhang, Qi‐Wei Ge +1 more

To improve the decoding speed and performance of Weighted Bit Flipping (WBF) decoding algorithm for Low Density Parity Check (LDPC) codes, a two-stage WBF algorithm with a multi-/single-bit switching mechanism is proposed. It first performs multi-bit flipping decoding in the first-stage decoder. When cyclic flipping is detected or the maximum flipping function value is less than zero, it switches to the second-stage decoder. Simulation results show that the proposed algorithm obtains gains both in average decoding iteration number and in decoding performance compared with the Sum of the Magnitude based WBF (SMWBF) and the Variable node updating based SMWBF (VSMWBF).

•Apr 1, 2022•0 citations

A Improved Decoding Algorithm for Low-Density Parity-Check Codes

Wei Zhou, Aidong Men, Liye Zhao +1 more

Based on decoding performance, complexity and latency of finite-geometry low-density parity-check (LDPC) codes, an efficient decoding algorithm is proposed. The algorithm is a hybrid bit-flipping (BF)/majority-logic (MLG) algorithm. In the algorithm, there are two stages. At the first stage, a code is decoded with bit-flipping (BF) with a small fixed number of iterations. Then the output from bit-flipping (BF) decoder is decoded by majority-logic (MLG) decoding. And in bit-flipping (BF) decoding, a new method is used to find the least reliable position. In the hybrid algorithm, there aren't real operations. Simulation results show that the algorithm provides 0.3dB coding gain over weight bit-flipping (WBF) decoding, and within 1 dB away from sum-product algorithm (SPA) decoding.

IEEE International Conference on Communication Technology (ICCT)•Nov 1, 2006•0 citations

Hybrid Iterative Decoding for Low-Density Parity-Check Codes Based on Finite Geometries

Li Jian, Xian‐Da Zhang

In this letter, a two-stage hybrid iterative decoding algorithm which combines two iterative decoding algorithms is proposed to reduce the computational complexity of finite geometry low-density parity-check (FG-LDPC) codes. We introduce a fast weighted bit-flipping (WBF) decoding algorithm for the first stage decoding. If the first stage decoding fails, the decoding is continued by the powerful belief propagation (BP) algorithm. The proposed hybrid decoding algorithm greatly reduces the computational complexity while maintains the same performance compared to that of using the BP algorithm only.

IEEE Communications Letters•Jan 1, 2008•16 citations

A hybrid belief propagation decoding algorithms of LDPC codes for fast convergence

Tso-Cho Chen, Chia‐Jung Li, Erl‐Huei Lu

A hybrid belief propagation (BP) decoding algorithm for low-density parity-check code is proposed to accelerate the convergence of decoding and reduce the number of decoding iterations. The hybrid scheme is presented by integrating the BP algorithm with the bit-flipping function which is used as adaptive weighted factor in the BP iteration decoding. The adaptive weighting factor is based on the average weighted reliability measure of the hard output of decoder. The proposed hybrid adaptive weighted iteration scheme can efficiently increase the convergence speed of the belief propagation decoding and therefore improve the error performance. Simulation results show that the proposed algorithm can significantly reduce the decoding complexity and achieve better error performances as compared with the sum-product algorithm.

Cross Strait Radio Science and Wireless Technology Conference (CSRSWTC)•Jul 1, 2013•5 citations

Hybrid weighted bit-flipping decoding algorithm for LDPC codes

Gaoqi Dou

To reduce loop-oscillation errors occurring in the weighted bit-flipping algorithm,a hybrid weighted bit-flipping decoding algorithm for low-density parity-check(LDPC) codes is proposed.The proposed algorithm updates multiple bits in each iteration,a random perturbation is added when the loop oscillation is detected which could reduce loop-oscillation errors by changing objective function.And these errors are analyzed from the mathematic perspective.Simulation results and complexity comparison show that the proposed algorithm achieves an appealing tradeoff among performance,convergence and complexity for structured LDPC codes compared with the best known weighted bit-flipping decoding algorithm.

Systems engineering and electronics•Jan 1, 2010•1 citation
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.
This paper considers a modified iterative version of the two-stage hybrid algorithm for decoding low-density parity- check (LDPC) codes. The hybrid-decision scheme is a decoding scheme used that combines two iterative decoding algorithms for decoding LDPC codes. This scheme is suitable for many applications such as audio and video transmission that are sensitive to time. The hybrid-decision scheme mixes between the characteristics of the soft-decision decoding scheme and the hard- decision decoding scheme to reduce the computational complexity of the whole decoding algorithm. The modification proposed in this paper is applied to the implementation-efficient reliability ratio weighted bit-flipping (IERRWBF) algorithm which represents hard-decision scheme in the hybrid algorithm. This modification is capable of achieving better performance than that of the hybrid decoding algorithm with reducing the number of iterations required at each SNR and approaching more to the performance of the SPA. This reduction is more observable as the maximum number of iterations assigned for the algorithm increases or as the code length increases with improving the error performance as proved by simulation results.
To improve the decoding speed and performance of Weighted Bit Flipping (WBF) decoding algorithm for Low Density Parity Check (LDPC) codes, a two-stage WBF algorithm with a multi-/single-bit switching mechanism is proposed. It first performs multi-bit flipping decoding in the first-stage decoder. When cyclic flipping is detected or the maximum flipping function value is less than zero, it switches to the second-stage decoder. Simulation results show that the proposed algorithm obtains gains both in average decoding iteration number and in decoding performance compared with the Sum of the Magnitude based WBF (SMWBF) and the Variable node updating based SMWBF (VSMWBF).
Based on decoding performance, complexity and latency of finite-geometry low-density parity-check (LDPC) codes, an efficient decoding algorithm is proposed. The algorithm is a hybrid bit-flipping (BF)/majority-logic (MLG) algorithm. In the algorithm, there are two stages. At the first stage, a code is decoded with bit-flipping (BF) with a small fixed number of iterations. Then the output from bit-flipping (BF) decoder is decoded by majority-logic (MLG) decoding. And in bit-flipping (BF) decoding, a new method is used to find the least reliable position. In the hybrid algorithm, there aren't real operations. Simulation results show that the algorithm provides 0.3dB coding gain over weight bit-flipping (WBF) decoding, and within 1 dB away from sum-product algorithm (SPA) decoding.
In this letter, a two-stage hybrid iterative decoding algorithm which combines two iterative decoding algorithms is proposed to reduce the computational complexity of finite geometry low-density parity-check (FG-LDPC) codes. We introduce a fast weighted bit-flipping (WBF) decoding algorithm for the first stage decoding. If the first stage decoding fails, the decoding is continued by the powerful belief propagation (BP) algorithm. The proposed hybrid decoding algorithm greatly reduces the computational complexity while maintains the same performance compared to that of using the BP algorithm only.
A hybrid belief propagation (BP) decoding algorithm for low-density parity-check code is proposed to accelerate the convergence of decoding and reduce the number of decoding iterations. The hybrid scheme is presented by integrating the BP algorithm with the bit-flipping function which is used as adaptive weighted factor in the BP iteration decoding. The adaptive weighting factor is based on the average weighted reliability measure of the hard output of decoder. The proposed hybrid adaptive weighted iteration scheme can efficiently increase the convergence speed of the belief propagation decoding and therefore improve the error performance. Simulation results show that the proposed algorithm can significantly reduce the decoding complexity and achieve better error performances as compared with the sum-product algorithm.
To reduce loop-oscillation errors occurring in the weighted bit-flipping algorithm,a hybrid weighted bit-flipping decoding algorithm for low-density parity-check(LDPC) codes is proposed.The proposed algorithm updates multiple bits in each iteration,a random perturbation is added when the loop oscillation is detected which could reduce loop-oscillation errors by changing objective function.And these errors are analyzed from the mathematic perspective.Simulation results and complexity comparison show that the proposed algorithm achieves an appealing tradeoff among performance,convergence and complexity for structured LDPC codes compared with the best known weighted bit-flipping decoding algorithm.