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

Science Technology and Engineering

A Modified BP Decoding Algorithm of LDPC Codes

Zhan Yi

Published Jan 1, 2013• 0 citations
OpenAlex

Abstract

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.

Related papers

Modified UMP BP-Based decoding algorithm of LDPC codes with low complexity

Hua Qu

In order to make up for the performance defects of UMP BP-Based decoding algorithm relative to LLR BP decoding algorithm,this paper proposed a modified decoding algorithm.Parameters of the proposed algorithm which combined the advantage of Normalized BP-Based decoding algorithm and Offset BP-Based decoding algorithm were calculated according to minimum mean square error rule.The simulation results show that the LDPC decoding performance of modified UMP BP-Based decoding algorithm is more effective than that of UMP BP-Based decoding algorithm,Normalized BP-Based decoding algorithm and Offset BP-Based decoding algorithm under the same condition of bit error rate.

Jisuanji yingyong yanjiu•Jan 1, 2009•0 citations

Research on LDPC Decoding Based on Modified Min-sum Algorithm

Mei Jin-jie

In order to make up for the performance defects of Min-sum decoding algorithm relative to LLR BP decoding algorithm and reduce implementation complexity of LLR-BP algorithm,a modified Min-sum decoding algorithm is proposed.When the check nodes process the message,parameters of the proposed algorithm are confirmed according to minimum mean square error rule,and the normalized BP-based decoding algorithm and the offset BP-based decoding algorithm are integrated effectively.At the same time,we introduce the correction factor and the offset factor into this algorithm reasonably.The simulation results show that decoding performance of modified Min-sum decoding algorithm is more effective than that of Min-sum decoding algorithm,normalized BP-based decoding algorithm and offset BP-based decoding algorithm under the same condition of bit error rate,and it approaches to the performance of LLR-BP decoding algorithm.

Radio and communications technology•Jan 1, 2012•1 citation

Research of LDPC Decoding Based on Modified LLR BP Algorithm

Hua Qu

The Tanner graph of long LDPC codes usually has no loops and LLR BP algorithm is the best soft-decision decoding algorithm.But the Tanner graph of short LDPC codes usually has loops,so information within variable nodes doesn't satisfy the condition of independent identical distribution and the decoding performance of LLR BP algorithm will decrease.In this paper,a modified LLR BP algorithm is proposed,which can reduce the relativity of information within variable nodes by adjusting the iterative process of variable nodes information.Simulation results show that the LDPC decoding performance of the modified LLR BP algorithm is more effective than that of LLR BP algorithm,Normalized BP algorithm and offset BP algorithm.

Journal of Southwest University•Jan 1, 2009•3 citations

An improved BP-based concatenation algorithm of short LDPC codes

Feng Guang-zeng

This paper analyses the ordered statistic decoding(OSD) algorithm of short LDPC codes and investigates BP-OSD concatenation algorithm and LLR accumulation algorithm.Considering the tradeoff between the complexity and performance of decoding,the min-sum algorithm was used instead of the BP algorithm,and it was concatenated with LLR accumulation algorithm.Simulation results show that compared with the original BP algorithm,the performance of the improved concatenation algorithm has been greatly raised,and compared with the BP-OSD concatenation algorithm,its decoding complexity has been reduced and the performance is nearly the same.

Journal of Chongqing University of Posts and Telecommunications•Jan 1, 2010•0 citations

Revised Hard-decision Decoding of LDPC Codes

Hongwei Li

Bit-flipping decoding algorithm and its improved version weighted bit-flipping decoding algorithm are usually used to realize the hard-decision decoding of LDPC codes.But the performance of BF decoding algorithm is not good enough,and WBF decoding algorithm is complicated.A revised hard-decision decoding of LDPC codes to have a good tradeoff between complexity and decoding performance is introduced in this paper.The algorithm can make multiple bits flip in the first two iteration.The simulation results demonstrate the revised algorithm supplies a slightly inferior BER performance,but a significant reduction of the complexity.

Video Engineering•Jan 1, 2013•0 citations

An improved LDPC decoding algorithm based on min-sum algorithm

Yue Cao

Low density parity check code is a kind of high-performance linear block code. It has excellent performance which is near the Shannon limit. LDPC has low decoding complexity, free structure and receives extensive attention. The typical decoding algorithm of LDPC is LLR BP algorithm, which is also called “sum-product algorithm”. LLR BP algorithm is the best algorithm at present. But it needs complex computation, which causes great difficulty in its hardware design. To solve this problem, an algorithm that gets approximation of LLR BP algorithm is put forward, which is called min-sum algorithm. Min-sum algorithm greatly reduces the computation and makes the hardware design simpler, but its accuracy has a wide gap with BP algorithm. This article analyzes the reason why min-sum algorithm has errors, and puts forward an improved algorithm called min-sum linear approximation algorithm based on min-sum algorithm.

International Symposium on Communications and Information Technologies•Oct 1, 2011•9 citations
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.
In order to make up for the performance defects of UMP BP-Based decoding algorithm relative to LLR BP decoding algorithm,this paper proposed a modified decoding algorithm.Parameters of the proposed algorithm which combined the advantage of Normalized BP-Based decoding algorithm and Offset BP-Based decoding algorithm were calculated according to minimum mean square error rule.The simulation results show that the LDPC decoding performance of modified UMP BP-Based decoding algorithm is more effective than that of UMP BP-Based decoding algorithm,Normalized BP-Based decoding algorithm and Offset BP-Based decoding algorithm under the same condition of bit error rate.
In order to make up for the performance defects of Min-sum decoding algorithm relative to LLR BP decoding algorithm and reduce implementation complexity of LLR-BP algorithm,a modified Min-sum decoding algorithm is proposed.When the check nodes process the message,parameters of the proposed algorithm are confirmed according to minimum mean square error rule,and the normalized BP-based decoding algorithm and the offset BP-based decoding algorithm are integrated effectively.At the same time,we introduce the correction factor and the offset factor into this algorithm reasonably.The simulation results show that decoding performance of modified Min-sum decoding algorithm is more effective than that of Min-sum decoding algorithm,normalized BP-based decoding algorithm and offset BP-based decoding algorithm under the same condition of bit error rate,and it approaches to the performance of LLR-BP decoding algorithm.
The Tanner graph of long LDPC codes usually has no loops and LLR BP algorithm is the best soft-decision decoding algorithm.But the Tanner graph of short LDPC codes usually has loops,so information within variable nodes doesn't satisfy the condition of independent identical distribution and the decoding performance of LLR BP algorithm will decrease.In this paper,a modified LLR BP algorithm is proposed,which can reduce the relativity of information within variable nodes by adjusting the iterative process of variable nodes information.Simulation results show that the LDPC decoding performance of the modified LLR BP algorithm is more effective than that of LLR BP algorithm,Normalized BP algorithm and offset BP algorithm.
This paper analyses the ordered statistic decoding(OSD) algorithm of short LDPC codes and investigates BP-OSD concatenation algorithm and LLR accumulation algorithm.Considering the tradeoff between the complexity and performance of decoding,the min-sum algorithm was used instead of the BP algorithm,and it was concatenated with LLR accumulation algorithm.Simulation results show that compared with the original BP algorithm,the performance of the improved concatenation algorithm has been greatly raised,and compared with the BP-OSD concatenation algorithm,its decoding complexity has been reduced and the performance is nearly the same.
Bit-flipping decoding algorithm and its improved version weighted bit-flipping decoding algorithm are usually used to realize the hard-decision decoding of LDPC codes.But the performance of BF decoding algorithm is not good enough,and WBF decoding algorithm is complicated.A revised hard-decision decoding of LDPC codes to have a good tradeoff between complexity and decoding performance is introduced in this paper.The algorithm can make multiple bits flip in the first two iteration.The simulation results demonstrate the revised algorithm supplies a slightly inferior BER performance,but a significant reduction of the complexity.
Low density parity check code is a kind of high-performance linear block code. It has excellent performance which is near the Shannon limit. LDPC has low decoding complexity, free structure and receives extensive attention. The typical decoding algorithm of LDPC is LLR BP algorithm, which is also called “sum-product algorithm”. LLR BP algorithm is the best algorithm at present. But it needs complex computation, which causes great difficulty in its hardware design. To solve this problem, an algorithm that gets approximation of LLR BP algorithm is put forward, which is called min-sum algorithm. Min-sum algorithm greatly reduces the computation and makes the hardware design simpler, but its accuracy has a wide gap with BP algorithm. This article analyzes the reason why min-sum algorithm has errors, and puts forward an improved algorithm called min-sum linear approximation algorithm based on min-sum algorithm.