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

Microcomputer & its Applications

Research on LDPC decoding based on modified UMP BP-Based algorithm

Tian Zhang

Published Jan 1, 2010• 0 citations
OpenAlex

Abstract

In order to make up for the performance defects of UMP BP-Based decoding algorithm relative to LLR BP decoding algorithm, a modified UMP BP-Based decoding algorithm is proposed. Parameters of the proposed algorithm are confirmed according to minimum mean square error rule and it has the generality for decoding of all LDPC codes. 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.

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

An improved UMP BP-based decoding algorithm for irregular LDPC codes

Chuan Zhang

In order to reduce the performance loss of UMP BP-based decoding algorithm relative to LLR-BP decoding algorithm,an improved UMP BP-based decoding algorithm is proposed.When the check nodes process the message,the normalized BP-based decoding algorithm and offset BP-based decoding algorithm are integrated effectively by setting a correction factor and an offset factor reasonably.When the variable nodes process the message,an oscillation compensation algorithm based on LLR-BP decoding algorithm is introduced.Simulation results show that based on the irregular LDPC codes and under the condition of the same bit error rate within a certain range,the improved UMP BP-based decoding algorithm improves the decoding performance greatly compared with the three decoding algorithms which are based on UMP BP,normalized BP and offset BP decoding algorithms,respectively,and therefore quite efficiently approaches to the LLR-BP decoding algorithm which has excellent performance.

Applied science and technology•Jan 1, 2010•1 citation

An Improved Decoding Algorithm for LDPC Codes

XU Yong-tai

An improved decoding algorithm based on minimum mean square error(MMSE) for low-density parity-check(LDPC) codes is proposed.The new algorithm combines processing methods of two modified uniformly most powerful(UMP) BP-based algorithms(normalized UMP BP-based algorithm and offset UMP BP-based algorithm) and attains the corresponding normalization factor and offset factor according to MMSE criterion.Simulations indicate that,compared with the two above-mentioned algorithms,a gain of 0.03 dB can be achieved at bit error rate(BER) of 10-6 with the proposed algorithm when a(3,6) regular LDPC code of code length 1 008 and code rate 1/2 is used.

Beijing Youdian Xueyuan xuebao•Jan 1, 2007•0 citations

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

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
In order to make up for the performance defects of UMP BP-Based decoding algorithm relative to LLR BP decoding algorithm, a modified UMP BP-Based decoding algorithm is proposed. Parameters of the proposed algorithm are confirmed according to minimum mean square error rule and it has the generality for decoding of all LDPC codes. 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 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.
In order to reduce the performance loss of UMP BP-based decoding algorithm relative to LLR-BP decoding algorithm,an improved UMP BP-based decoding algorithm is proposed.When the check nodes process the message,the normalized BP-based decoding algorithm and offset BP-based decoding algorithm are integrated effectively by setting a correction factor and an offset factor reasonably.When the variable nodes process the message,an oscillation compensation algorithm based on LLR-BP decoding algorithm is introduced.Simulation results show that based on the irregular LDPC codes and under the condition of the same bit error rate within a certain range,the improved UMP BP-based decoding algorithm improves the decoding performance greatly compared with the three decoding algorithms which are based on UMP BP,normalized BP and offset BP decoding algorithms,respectively,and therefore quite efficiently approaches to the LLR-BP decoding algorithm which has excellent performance.
An improved decoding algorithm based on minimum mean square error(MMSE) for low-density parity-check(LDPC) codes is proposed.The new algorithm combines processing methods of two modified uniformly most powerful(UMP) BP-based algorithms(normalized UMP BP-based algorithm and offset UMP BP-based algorithm) and attains the corresponding normalization factor and offset factor according to MMSE criterion.Simulations indicate that,compared with the two above-mentioned algorithms,a gain of 0.03 dB can be achieved at bit error rate(BER) of 10-6 with the proposed algorithm when a(3,6) regular LDPC code of code length 1 008 and code rate 1/2 is used.
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.
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.