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

International Symposium on Information Engineering and Electronic Commerce

Research of an Improved BP Decoding Algorithm

Guoqiang Wu, Zhaowei Sun

Published Jan 1, 2009• 0 citations
Publisher

Abstract

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.

DOI
10.1109/ieec.2009.14

Related papers

Research of an improved BP decoding arithmetic

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

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.

Aircraft Engineering and Aerospace Technology•Oct 16, 2009•0 citations

A Novel Log-BP Decoding Algorithm for LDPC Codes

Jun Wang, Shuhui Yang

In this paper, we present a simplification of log-BP algorithm which is able to reduce iterative times of decoding algorithm and save the hardware resource of decoder for LDPC codes. This simplification designs an improved layered-iterative decoding method without reducing the decoding performance, of which speed the updating of check nodes and variable nodes. Simulation results show that the improved layered-iterative log-BP algorithm with six-time iteration exhibits similar decoding performance to the traditional log-BP algorithm with ten-time iteration. When the improved log-BP and traditional log-BP both are simulated in ten-time iteration, the SNR of improved layer-iterative method decreases about 0.25 dB than that of traditional log-BP in the BER of 1e-2.

World Congress on Software Engineering (WCSE)•Jan 1, 2009•0 citations

Research of LDPC decoding based on LLR BP algorithm

Yin Shuang-shuang

In iterations processing of LLR BP algorithm for LDPC decoding,the computational of check nodes renewal is high;The decoding performance will be reduced,while there are lots of loops in short LDPC codes.According to these problems,a new LLR BP decoding algorithm based on Hybrid Check-Variable offset processing is proposed in this paper.Decrease complexity by adjusting amplitudes of check nodes processing and relativity of variable nodes by adjusting their information.Simulation results show that this improved decoding algorithm,compared with LLR BP algorithm,is consideration to decoding performance of LDPC and computational complexity.

Electronic Design Engineering•Jan 1, 2012•0 citations

Research on an Improved Decoding Algorithm for Low-density Parity-check Codes

Xiyuan Chen

To solve the problem of high average running time,an improved decoding algorithm was proposed which was combined by BP algorithm and WBF algorithm.The parity check was added in each BP iterative decoding,and flipping criterions which were passed from check nodes to information nodes were weighted by the reliable information of received sequence.Then a bit flipping measure was to be taken according to specific rules in order to obtain correct codes,and a parity check was added again.Simulation results on Additive White Gaussian Noise(AWGN) channel show that,the improved algorithm can decrease the average running time effectively for LDPC codes while maintaining the excellent decoding performance as BP algorithm.And compared with classical BP algorithm,the effect of the different maximum numbers of iterations,different lengths of codes and different code rates for the improved decoding algorithm are analyzed.

Science Technology and Engineering•Jan 1, 2011•0 citations

Research of LDPC decoding based on LLR BP algorithm

Sun Zengyou, Jin Zhang, Du Juan

In iterations processing of LLR BP algorithm for LDPC decoding, the computational complexity of check nodes renewal is high; The decoding performance will be reduced, while there are lots of loops in short LDPC codes. According to these problems, a new LLR BP decoding algorithm based on Hybrid Check-Variable offset processing is proposed in this paper. Decrease complexity by adjusting amplitudes of check nodes processing and relativity of variable nodes by adjusting their information. Simulation results show that this improved decoding algorithm, compared with LLR BP algorithm, is consideration to decoding performance of LDPC and computational complexity.

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

Study of Simple LDPC Codes BP Algorithm

Xiaoqi Yin, Yin Kui-xi

Low Density Parity Check Codes(LDPC) is a kind of linear group codes which can be near the Shannon limit,the complexity of decoding is low.The BP decoding algorithm has a good performance among the decoding algorithms,it can make certain that if the codes are decoded in the iterative decoding process,but it is complicated and needs large operations.In this paper,a better algorithm is proposed to reduce the amount of operations by curve fitting when updating the computation of check codes,it is useful for the realizing of hardware and can reduce decoding delay.The results of computer simulation have shown that the proposed algorithm has similar performance with the traditional BP algorithm,and it is less complicated.

Modern Electronics Technique•Jan 1, 2006•1 citation
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.
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.
In this paper, we present a simplification of log-BP algorithm which is able to reduce iterative times of decoding algorithm and save the hardware resource of decoder for LDPC codes. This simplification designs an improved layered-iterative decoding method without reducing the decoding performance, of which speed the updating of check nodes and variable nodes. Simulation results show that the improved layered-iterative log-BP algorithm with six-time iteration exhibits similar decoding performance to the traditional log-BP algorithm with ten-time iteration. When the improved log-BP and traditional log-BP both are simulated in ten-time iteration, the SNR of improved layer-iterative method decreases about 0.25 dB than that of traditional log-BP in the BER of 1e-2.
In iterations processing of LLR BP algorithm for LDPC decoding,the computational of check nodes renewal is high;The decoding performance will be reduced,while there are lots of loops in short LDPC codes.According to these problems,a new LLR BP decoding algorithm based on Hybrid Check-Variable offset processing is proposed in this paper.Decrease complexity by adjusting amplitudes of check nodes processing and relativity of variable nodes by adjusting their information.Simulation results show that this improved decoding algorithm,compared with LLR BP algorithm,is consideration to decoding performance of LDPC and computational complexity.
To solve the problem of high average running time,an improved decoding algorithm was proposed which was combined by BP algorithm and WBF algorithm.The parity check was added in each BP iterative decoding,and flipping criterions which were passed from check nodes to information nodes were weighted by the reliable information of received sequence.Then a bit flipping measure was to be taken according to specific rules in order to obtain correct codes,and a parity check was added again.Simulation results on Additive White Gaussian Noise(AWGN) channel show that,the improved algorithm can decrease the average running time effectively for LDPC codes while maintaining the excellent decoding performance as BP algorithm.And compared with classical BP algorithm,the effect of the different maximum numbers of iterations,different lengths of codes and different code rates for the improved decoding algorithm are analyzed.
In iterations processing of LLR BP algorithm for LDPC decoding, the computational complexity of check nodes renewal is high; The decoding performance will be reduced, while there are lots of loops in short LDPC codes. According to these problems, a new LLR BP decoding algorithm based on Hybrid Check-Variable offset processing is proposed in this paper. Decrease complexity by adjusting amplitudes of check nodes processing and relativity of variable nodes by adjusting their information. Simulation results show that this improved decoding algorithm, compared with LLR BP algorithm, is consideration to decoding performance of LDPC and computational complexity.
Low Density Parity Check Codes(LDPC) is a kind of linear group codes which can be near the Shannon limit,the complexity of decoding is low.The BP decoding algorithm has a good performance among the decoding algorithms,it can make certain that if the codes are decoded in the iterative decoding process,but it is complicated and needs large operations.In this paper,a better algorithm is proposed to reduce the amount of operations by curve fitting when updating the computation of check codes,it is useful for the realizing of hardware and can reduce decoding delay.The results of computer simulation have shown that the proposed algorithm has similar performance with the traditional BP algorithm,and it is less complicated.