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

Cross Strait Radio Science and Wireless Technology Conference (CSRSWTC)

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

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

Published Jul 1, 2013• 5 citations
Publisher

Abstract

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.

DOI
10.1109/csqrwc.2013.6657436

Related papers

A Weighted Belief Propagation Decoding Algorithm of LDPC Codes for Fast Convergence and Early Stopping

Tso-Cho Chen

A weighted belief propagation decoding algorithm for low-density parity-check decoding is proposed to accelerate the convergence of decoding and reduce the number of decoding iterations. We propose an early stopping criterion which is based on the average weighted reliability measure of the hard output of decoder to detect undecodable blocks in an early stage of the decoding process. In addition, an adaptive weighted iteration scheme is proposed to increase the convergence speed of belief propagation (BP) decoding and therefore improve the error performance. The evolution of the adaptive weighting factor with the number of decoding iterations is based on the relative entropy between two consecutive ”a posteriori” probabilities distribution at decoder output. Simulation results show that the proposed algorithm can achieve about 0.2-0.4 dB coding gain improvement on average while reducing up to about 50%-85% iterations for decoding at low to medium E(subscript b)/ N(subscript 0) , compared with the conventional BP based algorithms.

•Jul 1, 2012•0 citations

Improved belief propagation algorithm for decoding of convolutional LDPC codes

Chen Ru-wei

A novel belief propagation(BP) decoding algorithm for convolutional low-density parity-check codes is proposed.The proposed algorithm raises the efficiency of updating the variable information by applying feedback information at each decoding iteration and employs the weighting factor to reduce the error propagation caused by the cycles in the Tanner graph,thus yielding a faster convergence of the decoding.Simulation results show that an error performance better than that of the existing belief propagation algorithm can be achieved,while the 5/8 decoding delay and the computation complexity are effectively reduced.Compared with the existing BP,the proposed algorithm achieves a gain of 0.16dB at the BER of 10-6 with the same number of iterations.

Journal of Xidian University•Jan 1, 2009•0 citations

Hybrid decoding for one class of low-density parity-check codes

Guangwen Li, Xuelan Zou, Xin Wang

For high rate LDPC codes with light column weight and few redundant checks in their parity check matrix, the belief propagation (BP) decodings yield good error performance at the cost of high complexity. Aiming at seeking a effective decoder with good performance versus complexity tradeoff for this kind of LDPC codes, we present a new decoding framework which cascades a bit flipping (BF) variant with the ordered statistic decoding (OSD). During the iterative decoding of BF variant, the flipping value for each codeword bit is summed. The summation for each bit will be utilized as the reliability input for the OSD postprocessing, if no valid codeword is found after the maximum number of iterations for the BF variant is reached. With respect to the BP, simulation results show that the proposed BF-OSD achieves comparable performance with much less complexity.

International Conference on Communications and Networking in China (ChinaCom)•Jan 1, 2008•1 citation

An efficient bit-flipping decoding algorithm for LDPC codes

Tso-Cho Chen

In this paper, a new method for improving hard-decision bit-flipping (BF) decoding is proposed for low-density parity-check codes. The flipping criterion is derived theoretically from the soft-decision belief-propagation decoding algorithm. The proposed BF decoding algorithm is channel independent and is improved by introducing a more efficient method for computing the reliability of the parity checks. Extensive simulations are provided to demonstrate the efficiency of the proposed algorithm. Simulation results show that the proposed algorithm can achieve about 1.5dB coding gain improvement at BER = 5×10−6while reducing up to 48% iterations for decoding and maintaining low decoding complexity, compared with the conventional weighted BF algorithm.

Cross Strait Quad-Regional Radio Science and Wireless Technology Conference (CSQRWC)•Jul 1, 2012•7 citations

New low complexity belief propagation decoding of low density parity check codes

Liu Ji-lin

An improved belief propagation(BP) decoding scheme was put forward to solve the high complexity and low decoding efficiency problem of BP in low density parity check(LDPC) codes.Because different bit nodes and check nodes have different reliability and contribute differently to BP decoding;the proposed decoding scheme employs a differentiate rule based on lawless check number and pseudo posterior probability to evaluate every bit's reliability before each step of iteration;The nodes have little lawless check number and large pseudo posterior probability are supposed to have higher reliability.The bits with high reliability need not to be updated by the decoder.Simulation shows that the proposed BP decoding algorithm can reduce the computational load and increase the decoding efficiency significantly.

Journal of Zhejiang University(Engineering Science)•Jan 1, 2008•1 citation

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•15 citations
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.
A weighted belief propagation decoding algorithm for low-density parity-check decoding is proposed to accelerate the convergence of decoding and reduce the number of decoding iterations. We propose an early stopping criterion which is based on the average weighted reliability measure of the hard output of decoder to detect undecodable blocks in an early stage of the decoding process. In addition, an adaptive weighted iteration scheme is proposed to increase the convergence speed of belief propagation (BP) decoding and therefore improve the error performance. The evolution of the adaptive weighting factor with the number of decoding iterations is based on the relative entropy between two consecutive ”a posteriori” probabilities distribution at decoder output. Simulation results show that the proposed algorithm can achieve about 0.2-0.4 dB coding gain improvement on average while reducing up to about 50%-85% iterations for decoding at low to medium E(subscript b)/ N(subscript 0) , compared with the conventional BP based algorithms.
A novel belief propagation(BP) decoding algorithm for convolutional low-density parity-check codes is proposed.The proposed algorithm raises the efficiency of updating the variable information by applying feedback information at each decoding iteration and employs the weighting factor to reduce the error propagation caused by the cycles in the Tanner graph,thus yielding a faster convergence of the decoding.Simulation results show that an error performance better than that of the existing belief propagation algorithm can be achieved,while the 5/8 decoding delay and the computation complexity are effectively reduced.Compared with the existing BP,the proposed algorithm achieves a gain of 0.16dB at the BER of 10-6 with the same number of iterations.
For high rate LDPC codes with light column weight and few redundant checks in their parity check matrix, the belief propagation (BP) decodings yield good error performance at the cost of high complexity. Aiming at seeking a effective decoder with good performance versus complexity tradeoff for this kind of LDPC codes, we present a new decoding framework which cascades a bit flipping (BF) variant with the ordered statistic decoding (OSD). During the iterative decoding of BF variant, the flipping value for each codeword bit is summed. The summation for each bit will be utilized as the reliability input for the OSD postprocessing, if no valid codeword is found after the maximum number of iterations for the BF variant is reached. With respect to the BP, simulation results show that the proposed BF-OSD achieves comparable performance with much less complexity.
In this paper, a new method for improving hard-decision bit-flipping (BF) decoding is proposed for low-density parity-check codes. The flipping criterion is derived theoretically from the soft-decision belief-propagation decoding algorithm. The proposed BF decoding algorithm is channel independent and is improved by introducing a more efficient method for computing the reliability of the parity checks. Extensive simulations are provided to demonstrate the efficiency of the proposed algorithm. Simulation results show that the proposed algorithm can achieve about 1.5dB coding gain improvement at BER = 5×10−6while reducing up to 48% iterations for decoding and maintaining low decoding complexity, compared with the conventional weighted BF algorithm.
An improved belief propagation(BP) decoding scheme was put forward to solve the high complexity and low decoding efficiency problem of BP in low density parity check(LDPC) codes.Because different bit nodes and check nodes have different reliability and contribute differently to BP decoding;the proposed decoding scheme employs a differentiate rule based on lawless check number and pseudo posterior probability to evaluate every bit's reliability before each step of iteration;The nodes have little lawless check number and large pseudo posterior probability are supposed to have higher reliability.The bits with high reliability need not to be updated by the decoder.Simulation shows that the proposed BP decoding algorithm can reduce the computational load and increase the decoding efficiency significantly.
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.