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

Jisuanji yingyong yanjiu

Modified BP decoding algorithm based on oscillation and check update

Bao Jian-rong

Published Jan 1, 2011• 0 citations
OpenAlex

Abstract

To reduce the average number of decoding iterations in the region of low SNR(signal to noise ratio) and weaken the oscillation of the LLR(logarithm likelihood ratio),discovered the variation law of the check nodes'LLR and the checksum,in the error frame of the short and middle length LDPC codes.Based on the law,proposed an improved BP algorithm of LDPC decoding.In the algorithm,developed an early stopping criterion to reduce the average number of decoding iterations in the region of low SNR.And to improve the decoding performance by weakening the oscillation of the LLR,modified the update algorithm of check node.Simulation results show that,the algorithm reduces the number of iteration while the performance is not reduced in the region of low SNR,the decoding performance is improved while the number of iteration is not changed in the region of middle and high SNR.

Related papers

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

Iterative decoding algorithm with channel adaptation for LDPC codes

Guojun Han, Xingcheng Liu

For short to moderate block-length LDPC codes, a large number of uncorrected error frames causes the increase of average number of iterations in the region of low SNR(Signal-to-Noise Ratio) and the oscillation of some variable nodes degrades the error performance in the region of medium to high SNR. In order to reduce the average number of iterations in the region of low SNR and improve error performance in the region of medium to high SNR, an iterative decoding algorithm with channel adaptation is proposed. The decoding method with pre-decision making based on error patterns of check-sum and weighted average message is adopted in this algorithm. Through the primary role of early decision method on reducing average iterations at low SNR and weighted average message on reducing error frames at medium to high SNR, iterative decoding with channel adaptation is realized and high efficient decoding is achieved. Simulation results show that, with the proposed algorithm, the average number of iterations is reduced in the region of low SNR without noticeable error performance degradation, and the error performance is improved in the region of medium to high SNR without obvious increase of the number of iterations compared with standard BP algorithm.

Journal of Circuits and Systems•Jan 1, 2010•0 citations

Serial Update Scheduling Based on Weighted Average Message of Check Nodes for LDPC Codes

Xingcheng Liu

For short and middle length LDPC codes,the oscillation of LLR owing to cycles degrades the performance of BP algorithm.In order to minimize the oscillation of LLR during BP decoding process,an improved BP algorithm with serial update scheduling using weighted average message to update the message of check-to-variable node is proposed.Currently computed message of check-to-variable node and the message of old check-to-variable node are weighted and then added up to update the message of check-to-variable node.By higher weighted currently computed message of check-to-variable node than the message of old check-to-variable node,the improved algorithm effectively minimizes oscillation of LLR,at the same time,keeps normal BP message propagation and low compute complexity.Simulation results show that,for short and middle length LDPC codes,the improved algorithm achieves more noticeable error performance than CSBP algorithm at middle to high signal to noise ratio.

Acta Scientiarum Naturalium Universitatis Sunyatseni•Jan 1, 2010•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 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

Modified EMS Decoding Algorithm Combined with Feedback Theory

Fang Ye, Ruo-Lin Wang, Qian Sun

In comparison to the binary LDPC codes, the nonbinary low-density parity-check (NB-LDPC) codes have the advantage of solving burst errors. In order to improve the accuracy of the decoding results, an improved extended min-sum (EMS) algorithm is proposed in this paper. By adopting the feedback idea of joint iterative detection algorithm and introducing the reliability and stability parameters, the new algorithm can mitigate the influence of Log-likelihood ratio (LLR) oscillation on the decoding result and adjust the update information of the check node properly, thereby improving the decoding accuracy. This method can effectively restrain the LLR oscillation and speed up the convergence rate, thus the final decision result can be amended. Simulation results show that, the proposed improved EMS decoding algorithm heightens the bit error rate performance and reduces average number of iterations, meanwhile the additional computations are within acceptable range.

IEEE Asia-Pacific Conference on Antennas and Propagation•Aug 1, 2018•0 citations
To reduce the average number of decoding iterations in the region of low SNR(signal to noise ratio) and weaken the oscillation of the LLR(logarithm likelihood ratio),discovered the variation law of the check nodes'LLR and the checksum,in the error frame of the short and middle length LDPC codes.Based on the law,proposed an improved BP algorithm of LDPC decoding.In the algorithm,developed an early stopping criterion to reduce the average number of decoding iterations in the region of low SNR.And to improve the decoding performance by weakening the oscillation of the LLR,modified the update algorithm of check node.Simulation results show that,the algorithm reduces the number of iteration while the performance is not reduced in the region of low SNR,the decoding performance is improved while the number of iteration is not changed in the region of middle and high SNR.
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.
For short to moderate block-length LDPC codes, a large number of uncorrected error frames causes the increase of average number of iterations in the region of low SNR(Signal-to-Noise Ratio) and the oscillation of some variable nodes degrades the error performance in the region of medium to high SNR. In order to reduce the average number of iterations in the region of low SNR and improve error performance in the region of medium to high SNR, an iterative decoding algorithm with channel adaptation is proposed. The decoding method with pre-decision making based on error patterns of check-sum and weighted average message is adopted in this algorithm. Through the primary role of early decision method on reducing average iterations at low SNR and weighted average message on reducing error frames at medium to high SNR, iterative decoding with channel adaptation is realized and high efficient decoding is achieved. Simulation results show that, with the proposed algorithm, the average number of iterations is reduced in the region of low SNR without noticeable error performance degradation, and the error performance is improved in the region of medium to high SNR without obvious increase of the number of iterations compared with standard BP algorithm.
For short and middle length LDPC codes,the oscillation of LLR owing to cycles degrades the performance of BP algorithm.In order to minimize the oscillation of LLR during BP decoding process,an improved BP algorithm with serial update scheduling using weighted average message to update the message of check-to-variable node is proposed.Currently computed message of check-to-variable node and the message of old check-to-variable node are weighted and then added up to update the message of check-to-variable node.By higher weighted currently computed message of check-to-variable node than the message of old check-to-variable node,the improved algorithm effectively minimizes oscillation of LLR,at the same time,keeps normal BP message propagation and low compute complexity.Simulation results show that,for short and middle length LDPC codes,the improved algorithm achieves more noticeable error performance than CSBP algorithm at middle to high signal to noise ratio.
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.
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.
In comparison to the binary LDPC codes, the nonbinary low-density parity-check (NB-LDPC) codes have the advantage of solving burst errors. In order to improve the accuracy of the decoding results, an improved extended min-sum (EMS) algorithm is proposed in this paper. By adopting the feedback idea of joint iterative detection algorithm and introducing the reliability and stability parameters, the new algorithm can mitigate the influence of Log-likelihood ratio (LLR) oscillation on the decoding result and adjust the update information of the check node properly, thereby improving the decoding accuracy. This method can effectively restrain the LLR oscillation and speed up the convergence rate, thus the final decision result can be amended. Simulation results show that, the proposed improved EMS decoding algorithm heightens the bit error rate performance and reduces average number of iterations, meanwhile the additional computations are within acceptable range.