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

Journal of Computers

Improved Belief Propagation by Employing the Positive Effects of the Feedback Messages

Cui Junyun

Published Jan 1, 2019• 0 citations
Publisher

Abstract

In this paper, a modification to belief propagation (BP) decoding algorithm is proposed, which is based on extracting the prior messages of each variable node to help the BP decoding, and is particularly effective for low-density parity-check (LDPC) codes with short cycles, where the existence of cycles makes the original BP algorithm perform suboptimal.The proposed algorithm, referred to as "employing the positive effects of the feedback messages (EPEFM)", extracts the positive effects of the feedback messages and then makes use of them as prior messages to assist the decoding of the BP algorithm.Simulation results confirm the effectiveness of our proposed algorithm, which improves the performance in high signal-to-noise-ratio (SNR) region without loss in low SNR region.

DOI
10.17706/jcp.14.4.295-301

Related papers

Improving Belief Propagation on Graphs With Cycles

M Yazdani, Saied Hemati, Amir H. Banihashemi

In this letter, we propose two modifications to belief propagation (BP) decoding algorithm. The modifications are based on reducing the reliability of messages throughout the iteration process, and are particularly effective for short low-density parity-check codes, where the existence of cycles makes the original BP algorithm perform suboptimal. The proposed algorithms, referred to as "normalized BP" and "offset BP," reduce the absolute value of the outgoing log-likelihood ratio messages at variable nodes by using a multiplicative factor and an additive factor, respectively. Simulation results show that both algorithms perform more or less the same, and both outperform BP in error performance.

IEEE Communications Letters•Jan 1, 2004•93 citations

An improved decoding algorithm of low-density parity-check codes

Yongqiang Deng, Guangxi Zhu, Liu Wenming +1 more

In this paper, the decoding algorithm of low-density parity-check (LDPC) codes is analyzed, and a new decoding algorithm based on the belief propagation (BP) algorithm to eliminate the influence of cycles in the factor graph is proposed. In the traditional BP algorithm, the cycles of factor graph sends message back to its source, and this decreases the decoding performance. The new algorithm records each cycle's path and length of each node, and cuts off the path by which message is propagated when the message comes back. It can advance the decoding performance by protect the message of good quality be propagated as widely as possible. Our results of simulation show that the performance of new algorithm is not worse than that of traditional BP algorithm in the low SNR channel and the new algorithm significantly outperform traditional BP algorithm in good channel condition.

International Conference on Wireless Communications, Networking and Mobile Computing•Dec 10, 2005•0 citations

A high‐performance belief propagation decoding algorithm for codes with short cycles

Ali Karimi-lenji, Monireh Houshmand, Fahimeh Zarmehi

Summary The simplicity of decoding is one of the most important characteristics of the low density parity check (LDPC) codes. Belief propagation (BP) decoding algorithm is a well‐known decoding algorithm for LDPC codes. Most LDPC codes with long lengths have short cycles in their Tanner graphs, which reduce the performance of the BP algorithm. In this paper, we present 2 methods to improve the BP decoding algorithm for LDPC codes. In these methods, the calculation of the variable nodes is controlled by using “multiplicative correction factor” and “additive correction factor.” These factors are obtained for 2 separate channels, namely additive white Gaussian noise (AWGN) and binary symmetric channel (BSC), as 2 functions of code and channel parameters. Moreover, we use the BP‐based method in the calculation of the check nodes, which reduces the required resources. Simulation results show the proposed algorithm has better performance and lower decoding error as compared to BP and similar methods like normalized‐BP and offset‐BP algorithms.

International Journal of Communication Systems•Feb 28, 2017•2 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

A Study on Low Complexity Decoding Algorithm of LDPC Codes

Yong Deng

In this paper,the decoding algorithm of low-density parity-check(LDPC)codes is analyzed,and a new decoding algorithm based on the belief propagation(BP)algorithm to eliminate the influence of cycles in the factor graph is proposed. In the traditional BP algorithm,the cycles of factor graph will send message back to its source,and this will decrease the decoding performance. The new algorithm records each cycle’s path and length of each node,and cuts off the path by which message is propagated when the message will come back. It can advance the decoding performance by protect the message of good quality be propagated as widely as possible. Our results of simulation show that the performance of new algorithm is not worse than that of traditional BP algorithm in the low SNR channel and the new algorithm significantly outperform traditional BP algorithm in good channel condition.

•Jan 1, 2006•0 citations

A Modified belief propagation decoding algorithm for low-density parity-check codes based on oscillating iteration

Bao Jian-rong

According to no-convergence of falsely oscillating iteration in the low-density parity-check(LDPC) decoding at the range from medium to high SNRs(Signal to Noise Ratios),we propose a modified LDPC belief propagation(BP) decoding algorithm,i.e.soft value zero-forcing BP algorithm.By setting extrinsic information of the oscillating iteration bit nodes into zero,the impact on the iteratively decoding from false channel information is greatly reduced.And it also improves the performance of the decoding algorithm.Furthermore,a decision criterion of oscillating iteration nodes is presented to increase the accuracy of the decision.Simulation results show that the proposed algorithm has better decoding performance than that of the BP algorithm with the same iterations at medium and high SNRs.

Journal of Circuits and Systems•Jan 1, 2012•0 citations
In this paper, a modification to belief propagation (BP) decoding algorithm is proposed, which is based on extracting the prior messages of each variable node to help the BP decoding, and is particularly effective for low-density parity-check (LDPC) codes with short cycles, where the existence of cycles makes the original BP algorithm perform suboptimal.The proposed algorithm, referred to as "employing the positive effects of the feedback messages (EPEFM)", extracts the positive effects of the feedback messages and then makes use of them as prior messages to assist the decoding of the BP algorithm.Simulation results confirm the effectiveness of our proposed algorithm, which improves the performance in high signal-to-noise-ratio (SNR) region without loss in low SNR region.
In this letter, we propose two modifications to belief propagation (BP) decoding algorithm. The modifications are based on reducing the reliability of messages throughout the iteration process, and are particularly effective for short low-density parity-check codes, where the existence of cycles makes the original BP algorithm perform suboptimal. The proposed algorithms, referred to as "normalized BP" and "offset BP," reduce the absolute value of the outgoing log-likelihood ratio messages at variable nodes by using a multiplicative factor and an additive factor, respectively. Simulation results show that both algorithms perform more or less the same, and both outperform BP in error performance.
In this paper, the decoding algorithm of low-density parity-check (LDPC) codes is analyzed, and a new decoding algorithm based on the belief propagation (BP) algorithm to eliminate the influence of cycles in the factor graph is proposed. In the traditional BP algorithm, the cycles of factor graph sends message back to its source, and this decreases the decoding performance. The new algorithm records each cycle's path and length of each node, and cuts off the path by which message is propagated when the message comes back. It can advance the decoding performance by protect the message of good quality be propagated as widely as possible. Our results of simulation show that the performance of new algorithm is not worse than that of traditional BP algorithm in the low SNR channel and the new algorithm significantly outperform traditional BP algorithm in good channel condition.
Summary The simplicity of decoding is one of the most important characteristics of the low density parity check (LDPC) codes. Belief propagation (BP) decoding algorithm is a well‐known decoding algorithm for LDPC codes. Most LDPC codes with long lengths have short cycles in their Tanner graphs, which reduce the performance of the BP algorithm. In this paper, we present 2 methods to improve the BP decoding algorithm for LDPC codes. In these methods, the calculation of the variable nodes is controlled by using “multiplicative correction factor” and “additive correction factor.” These factors are obtained for 2 separate channels, namely additive white Gaussian noise (AWGN) and binary symmetric channel (BSC), as 2 functions of code and channel parameters. Moreover, we use the BP‐based method in the calculation of the check nodes, which reduces the required resources. Simulation results show the proposed algorithm has better performance and lower decoding error as compared to BP and similar methods like normalized‐BP and offset‐BP 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.
In this paper,the decoding algorithm of low-density parity-check(LDPC)codes is analyzed,and a new decoding algorithm based on the belief propagation(BP)algorithm to eliminate the influence of cycles in the factor graph is proposed. In the traditional BP algorithm,the cycles of factor graph will send message back to its source,and this will decrease the decoding performance. The new algorithm records each cycle’s path and length of each node,and cuts off the path by which message is propagated when the message will come back. It can advance the decoding performance by protect the message of good quality be propagated as widely as possible. Our results of simulation show that the performance of new algorithm is not worse than that of traditional BP algorithm in the low SNR channel and the new algorithm significantly outperform traditional BP algorithm in good channel condition.
According to no-convergence of falsely oscillating iteration in the low-density parity-check(LDPC) decoding at the range from medium to high SNRs(Signal to Noise Ratios),we propose a modified LDPC belief propagation(BP) decoding algorithm,i.e.soft value zero-forcing BP algorithm.By setting extrinsic information of the oscillating iteration bit nodes into zero,the impact on the iteratively decoding from false channel information is greatly reduced.And it also improves the performance of the decoding algorithm.Furthermore,a decision criterion of oscillating iteration nodes is presented to increase the accuracy of the decision.Simulation results show that the proposed algorithm has better decoding performance than that of the BP algorithm with the same iterations at medium and high SNRs.