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

Aircraft Engineering and Aerospace Technology

Research of an improved BP decoding arithmetic

Guoqiang Wu, Zhao‐Wei Sun, Xian‐De Wu

Published Oct 16, 2009• 0 citations
Publisher

Abstract

Purpose The purpose of this paper is to research the traditional belief‐propagation (BP) decoding algorithm of low‐density parity‐check code. The big computation load is a shortcoming of traditional BP decoding algorithm. Accordingly, the paper provides an improved BP decoding algorithm which raises the decoding efficiency and reduces decoding time delay. Design/methodology/approach An improved BP decoding algorithm is studied and the error correction performance of the improved BP decoding algorithm in the Gaussian channel is provided. Findings The simulation result shows the improved BP decoding algorithm has lower computational complexity and higher decoding speed based on the premise of a little decoding performance loss. Research limitations/implications The improved BP decoding algorithm has lower computational complexity and higher decoding speed based on the premise of a little decoding performance loss. Practical implications The improved BP decoding algorithm raises the decoding efficiency and reduces decoding time delay. Originality/value The decoding algorithm only needs to update the wrong bit information which might arise, but not update the bit information whose reliability is very high. The improved BP decoding algorithm raises the decoding efficiency and reduces decoding time delay.

DOI
10.1108/00022660910997838

Related papers

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

Research of an Improved BP Decoding Algorithm

Guoqiang Wu, Zhaowei Sun

That the computation load is big is a shortcoming of traditional BP decoding algorithm. According to this shortcoming we give an improved BP decoding algorithm. The decoding algorithm in the iterative decoding process, only need to update the possibility of a wrong bit of information without having to update the information whose reliability is very high, raises the decoding efficiency and reduces decoding time delay. The simulation result shows: the calculation load of improved BP decoding algorithms descends distinctively with the increasing iteration numbers; Along with the times increasing of LDPC code iterations upper limit, coding performance can be obviously improved.

International Symposium on Information Engineering and Electronic Commerce•Jan 1, 2009•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

Improved algorithm of LDPC decoding

Lei Shi

A novel Low-Density Parity-Check(LDPC) decoding algorithm was proposed,which integrates the serial belief propagation mechanism with the normalized BP-Based updating rule.The algorithm propagates the belief according to certain order of the check nodes,thus improves the convergence property of the belief propagation.Meanwhile,the algorithm efficiently lowers the decoding complexity by using the normalized BP-Based updating rule,which makes the algorithm to adapt to the implementation of hardware.Simulation was performed under the AWGN channel and results show that,compared with prior LDPC decoding algorithm,the proposed algorithm is able to accelerate the convergence speed of decoding obviously and enhance the decoding performance significantly.

Journal of Jilin University•Jan 1, 2009•1 citation

Modified BP Decoding Algorithms Combined with GA for Low-Density Parity Check Codes

Zerong Deng, Xingcheng Liu, Man Teng

In this paper we propose algorithms which combine Belief-propagation (BP) decoding algorithm with genetic algorithm (GA). The main idea is to improve the performance of traditional BP decoding algorithm by efficiently using the belief of variable nodes passing to check nodes. By considering the belief as genes, the proposed algorithms mainly employ the mutation operation in GA, and change the genes¿ amplitudes (either increase or decrease) when updating the check nodes¿ information. First, we explore that the marriage of the GA and BP decoding algorithm is reasonable. Three algorithms are proposed accordingly. Proposed algorithm I mutates chosen genes by amplitude enhancement, while proposed algorithm II by amplitude reduction. Finally, proposed algorithm III is a mixture of the former two. From computer simulation results, we show that for short and middle length LDPC codes, our proposed algorithms can improve both BER (bit error rate) and FER (frame error rate) performance over traditional BP decoding algorithm, with slight modification of traditional BP decoding algorithm and little increase of computation complexity.

International Conference on Computational Intelligence and Security (CIS)•Dec 1, 2008•6 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
Purpose The purpose of this paper is to research the traditional belief‐propagation (BP) decoding algorithm of low‐density parity‐check code. The big computation load is a shortcoming of traditional BP decoding algorithm. Accordingly, the paper provides an improved BP decoding algorithm which raises the decoding efficiency and reduces decoding time delay. Design/methodology/approach An improved BP decoding algorithm is studied and the error correction performance of the improved BP decoding algorithm in the Gaussian channel is provided. Findings The simulation result shows the improved BP decoding algorithm has lower computational complexity and higher decoding speed based on the premise of a little decoding performance loss. Research limitations/implications The improved BP decoding algorithm has lower computational complexity and higher decoding speed based on the premise of a little decoding performance loss. Practical implications The improved BP decoding algorithm raises the decoding efficiency and reduces decoding time delay. Originality/value The decoding algorithm only needs to update the wrong bit information which might arise, but not update the bit information whose reliability is very high. The improved BP decoding algorithm raises the decoding efficiency and reduces decoding time delay.
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.
That the computation load is big is a shortcoming of traditional BP decoding algorithm. According to this shortcoming we give an improved BP decoding algorithm. The decoding algorithm in the iterative decoding process, only need to update the possibility of a wrong bit of information without having to update the information whose reliability is very high, raises the decoding efficiency and reduces decoding time delay. The simulation result shows: the calculation load of improved BP decoding algorithms descends distinctively with the increasing iteration numbers; Along with the times increasing of LDPC code iterations upper limit, coding performance can be obviously improved.
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.
A novel Low-Density Parity-Check(LDPC) decoding algorithm was proposed,which integrates the serial belief propagation mechanism with the normalized BP-Based updating rule.The algorithm propagates the belief according to certain order of the check nodes,thus improves the convergence property of the belief propagation.Meanwhile,the algorithm efficiently lowers the decoding complexity by using the normalized BP-Based updating rule,which makes the algorithm to adapt to the implementation of hardware.Simulation was performed under the AWGN channel and results show that,compared with prior LDPC decoding algorithm,the proposed algorithm is able to accelerate the convergence speed of decoding obviously and enhance the decoding performance significantly.
In this paper we propose algorithms which combine Belief-propagation (BP) decoding algorithm with genetic algorithm (GA). The main idea is to improve the performance of traditional BP decoding algorithm by efficiently using the belief of variable nodes passing to check nodes. By considering the belief as genes, the proposed algorithms mainly employ the mutation operation in GA, and change the genes¿ amplitudes (either increase or decrease) when updating the check nodes¿ information. First, we explore that the marriage of the GA and BP decoding algorithm is reasonable. Three algorithms are proposed accordingly. Proposed algorithm I mutates chosen genes by amplitude enhancement, while proposed algorithm II by amplitude reduction. Finally, proposed algorithm III is a mixture of the former two. From computer simulation results, we show that for short and middle length LDPC codes, our proposed algorithms can improve both BER (bit error rate) and FER (frame error rate) performance over traditional BP decoding algorithm, with slight modification of traditional BP decoding algorithm and little increase of computation complexity.
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.