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

张天瑜

Published Jan 1, 2010• 0 citations
OpenAlex

Abstract

为了弥补UMPBP—Based译码算法相对于LLRBP译码算法的性能缺陷,提出一种改进型UMPBP—Based译码算法。该算法中的参数是在最小均方误差准则下确定的,对所有的LDPC码的译码具有通用性。仿真结果表明,在相同误码率的情。况下,改进型UMPBP—Based译码算法比UMPBP—Based译码算法、NormalizedBP—Based译码算法以及OffsetBP—Based译码算法具有更好的LDPC译码性能。

Related papers

一种低复杂度的LDPC码改进型UMP BP-Based译码算法

侯宁, 曲桦

为了弥补UMP BP-Based相对于LLR BP译码算法的性能缺陷,提出一种改进型UMP BP-Based译码算法。通过将Normalized BP-Based和O ffset BP-Based译码算法的优点相结合,并利用最小均方误差准则来计算该算法中的参数。仿真结果表明,在相同误码率的情况下,改进型UMP BP-Based译码算法比UMP BP-Based、Nor-malized BP-Based以及O ffset BP-Based具有更好的LDPC译码性能。

Jisuanji yingyong yanjiu•Jan 1, 2009•0 citations

Improved Normalized BP-Based decoding algorithm for low density parity check code

张小花, 李艳萍

为了提高Normalized BP-Based算法的译码性能,提出了一种改进的Normalized BP-Based算法。根据校验节点传向变量节点的信息的大小来动态地改变校正因子,实现对BP-Based算法的非线性补偿。仿真结果表明:在误码率低于0.5×10^-2时,与Normalized BP-Based算法相比,改进算法均可以获得约0.1 dB的增益,而只增加少量运算,并且不增加迭代次数。

Journal of Computer Applications•Jan 1, 2012•0 citations

The Generalized UMP BP-Based Algorithm and its Modifications for Non-binary LDPC Codes

Jaebum Kim, Namshik Kim, Hyuncheol Park

International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC)•Jul 1, 2005•0 citations

Irregular LDPC 부호용 적응 정규화 UMP-BP 복호 알고리즘

김용준, 김남식, 박현철

•Nov 20, 2004•2 citations

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

Modified Belief Propagation Decoding Algorithm for Low-Density Parity Check Code Based on Oscillation

Satoshi Gounai, Tomoaki Otsuki Ohtsuki, T. Kaneko

A low-density parity check (LDPC) code with the belief propagation (BP) or the log-likelihood ratio belief propagation (LLR-BP) can achieve good bit error rate (BER) performance approaching the Shannon limit. When a parity check matrix of the LDPC code has the cycle, the BP and LLR-BP decoding algorithms achieve approximate maximum a posterior probability (MAP) decoding. Although the decoding algorithms are approximate MAP decoding, LDPC codes can achieve very good BER. For the short and middle length LDPC codes, BER and block error rate (BLER) performances are affected by cycle largely. In each iteration, the magnitudes of a posterior LLRs of some bits oscillate owing to cycles. The oscillation is the dominant error factor in the high Eb/Noregion for short and middle length LDPC codes. In this paper, we extend the definition of oscillation to extrinsic LLR (ex-LLR) derived in the bit node process and propose the modified LLR-BP and the modified UMP-BP decoding algorithms. To reduce effects of oscillating ex-LLRs on decoding, for oscillating ex-LLRs, we add the previous ex-LLR to the current ex-LLR. From the computer simulation, we show that for short and middle length LDPC codes, with a simple modification, our proposed decoding algorithms can improve the conventional LLR-BP and UMP-BP decoding algorithms. In particular, we show that the modified UMP-BP decoding algorithm with low complexity can achieve better BER and BLER than the conventional LLR-BP decoding algorithm

IEEE Vehicular Technology Conference•Sep 8, 2006•16 citations
为了弥补UMPBP—Based译码算法相对于LLRBP译码算法的性能缺陷,提出一种改进型UMPBP—Based译码算法。该算法中的参数是在最小均方误差准则下确定的,对所有的LDPC码的译码具有通用性。仿真结果表明,在相同误码率的情。况下,改进型UMPBP—Based译码算法比UMPBP—Based译码算法、NormalizedBP—Based译码算法以及OffsetBP—Based译码算法具有更好的LDPC译码性能。
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.
A low-density parity check (LDPC) code with the belief propagation (BP) or the log-likelihood ratio belief propagation (LLR-BP) can achieve good bit error rate (BER) performance approaching the Shannon limit. When a parity check matrix of the LDPC code has the cycle, the BP and LLR-BP decoding algorithms achieve approximate maximum a posterior probability (MAP) decoding. Although the decoding algorithms are approximate MAP decoding, LDPC codes can achieve very good BER. For the short and middle length LDPC codes, BER and block error rate (BLER) performances are affected by cycle largely. In each iteration, the magnitudes of a posterior LLRs of some bits oscillate owing to cycles. The oscillation is the dominant error factor in the high Eb/Noregion for short and middle length LDPC codes. In this paper, we extend the definition of oscillation to extrinsic LLR (ex-LLR) derived in the bit node process and propose the modified LLR-BP and the modified UMP-BP decoding algorithms. To reduce effects of oscillating ex-LLRs on decoding, for oscillating ex-LLRs, we add the previous ex-LLR to the current ex-LLR. From the computer simulation, we show that for short and middle length LDPC codes, with a simple modification, our proposed decoding algorithms can improve the conventional LLR-BP and UMP-BP decoding algorithms. In particular, we show that the modified UMP-BP decoding algorithm with low complexity can achieve better BER and BLER than the conventional LLR-BP decoding algorithm