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 Physics Conference Series

Performance analysis of LDPC decoding algorithm

Fan Zhou, Linlin Niu, Binghe Tian

Published Jan 1, 2020• 3 citations
Publisher

Abstract

Abstract The LDPC code is the guarantee of reliable information transmission channel coding technology, compared with other coding technology, LDPC code has excellent performance, LDPC decoding algorithm performance is a key, in order to find out the performance of decoding algorithm, compare the BF algorithm and WBF algorithm, BP algorithm and BP algorithm LLR, MS algorithm, NMS algorithm performance, the results show that NMS algorithm has lower complexity and better performance.

DOI
10.1088/1742-6596/1453/1/012026

Related papers

A High Quality Communication Channel Coding Method Based on LDPC Code

Xiaojun Wang

This paper mainly studies the LDPC code high quality communication channel coding technology.In the traditional BP algorithm,LLR BP decoding algorithm based on the minimum,and algorithm in the test node update process exist the problem of large external information,this paper proposes an improved LDPC decoding algorithm. Algorithm based on BP algorithm is scaling,to make it more close to the actual value,the simulation results show that,the improved algorithm improves the LDPC code and the decoding algorithm for minimum error correction performance.

Microelectronics & Computer•Jan 1, 2012•0 citations

Research and Improvement of LPDC Decoding Algorithm

Tingting Chen, Riuan Liu, Lirong Diao

Low Density Parity Check(LDPC) code itself has a good performance and the application of LDPC in the communication field is extensive.LDPC codes have the characteristics of low bit error rate, easy adjustment, low decoding complexity and excellent decoding performance.LDPC is considered to be the "best performance" in the field of coding and decoding [1] .In this paper, we mainly introduce the theory of LDPC codes.And the use of the method of the LDPC code to do a further explanation.Several simple decoding schemes of LDPC are studied.Finally, using the method of function approximation to replace the confidence function to improve the BP LLR algorithm, and simulation experiments are carried out.

International Conference on Mechatronics Engineering and Information Technology (ICMEIT)•Jan 1, 2016•0 citations

A Modified BP Decoding Algorithm of LDPC Codes

Zhan Yi

LLR BP decoding algorithm and its improved version Minimum-Sum decoding algorithm are usually used to realize the decoding of LDPC codes.But the calculation of LLR BP decoding algorithm is too complicated,and the performance of Minimum-Sum decoding algorithm is not good enough because of the approximation.A modified BP decoding algorithm is proposed by using some parameters in order to have a good tradeoff between complexity and decoding performance.The simulation results demonstrate that the modified algorithm keeps good decoding performance,and supplies a significant reduction of the complexity compared to LLR BP decoding algorithm and minimum-sum decoding algorithm.

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

LLR Distribution Characteristics Based Hybrid Decoding Algorithm for LDPC Codes

Renzhi Wang, Kegang Pan, Xinting Wang

To improve the decoding speed and reduce the complexity of low-density parity-check (LDPC) codes, this paper proposes a hybrid LDPC decoding algorithm that combined with the distribution characteristics of log-likelihood ratio (LLR) of all variable node information before each iteration. During the process of decoding, there is a judgment based on an interval value and a threshold value to select the Belief Propagation (BP) algorithm or the Minimal Sum (MS) algorithm to decode, so the proposed hybrid algorithm effectively combines the excellent performance of BP algorithm and the simple operation of MS algorithm. The simulation results show that the algorithm can greatly reduce the computational complexity and achieve similar decoding performance compared with the BP algorithm.

IEEE International Conference on Communication Technology (ICCT)•Oct 28, 2020•1 citation

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

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
Abstract The LDPC code is the guarantee of reliable information transmission channel coding technology, compared with other coding technology, LDPC code has excellent performance, LDPC decoding algorithm performance is a key, in order to find out the performance of decoding algorithm, compare the BF algorithm and WBF algorithm, BP algorithm and BP algorithm LLR, MS algorithm, NMS algorithm performance, the results show that NMS algorithm has lower complexity and better performance.
This paper mainly studies the LDPC code high quality communication channel coding technology.In the traditional BP algorithm,LLR BP decoding algorithm based on the minimum,and algorithm in the test node update process exist the problem of large external information,this paper proposes an improved LDPC decoding algorithm. Algorithm based on BP algorithm is scaling,to make it more close to the actual value,the simulation results show that,the improved algorithm improves the LDPC code and the decoding algorithm for minimum error correction performance.
Low Density Parity Check(LDPC) code itself has a good performance and the application of LDPC in the communication field is extensive.LDPC codes have the characteristics of low bit error rate, easy adjustment, low decoding complexity and excellent decoding performance.LDPC is considered to be the "best performance" in the field of coding and decoding [1] .In this paper, we mainly introduce the theory of LDPC codes.And the use of the method of the LDPC code to do a further explanation.Several simple decoding schemes of LDPC are studied.Finally, using the method of function approximation to replace the confidence function to improve the BP LLR algorithm, and simulation experiments are carried out.
LLR BP decoding algorithm and its improved version Minimum-Sum decoding algorithm are usually used to realize the decoding of LDPC codes.But the calculation of LLR BP decoding algorithm is too complicated,and the performance of Minimum-Sum decoding algorithm is not good enough because of the approximation.A modified BP decoding algorithm is proposed by using some parameters in order to have a good tradeoff between complexity and decoding performance.The simulation results demonstrate that the modified algorithm keeps good decoding performance,and supplies a significant reduction of the complexity compared to LLR BP decoding algorithm and minimum-sum decoding algorithm.
To improve the decoding speed and reduce the complexity of low-density parity-check (LDPC) codes, this paper proposes a hybrid LDPC decoding algorithm that combined with the distribution characteristics of log-likelihood ratio (LLR) of all variable node information before each iteration. During the process of decoding, there is a judgment based on an interval value and a threshold value to select the Belief Propagation (BP) algorithm or the Minimal Sum (MS) algorithm to decode, so the proposed hybrid algorithm effectively combines the excellent performance of BP algorithm and the simple operation of MS algorithm. The simulation results show that the algorithm can greatly reduce the computational complexity and achieve similar decoding performance compared with the BP algorithm.
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 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.