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 Computer Applications

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

张小花, 李艳萍

Published Jan 1, 2012• 0 citations
Publisher

Abstract

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

DOI
10.3724/sp.j.1087.2012.00150

Related papers

Simulation-Based Validation of Improved BP-Based Decoding Algorithms of LDPC codes

Manel Abdelhedi, Fethi Tlili, Larbi Ben Hadj Slama

Low-density parity-check (LDPC) codes deliver very good performance when decoded with the BP algorithm. Unfortunately, this algorithm has the disadvantage to be complex for implementation. In this paper, we investigate the BP algorithm and its simplifications (BP-Based, normalized BP-Based, offset BP-Based). Previous works on normalized and offset BP-Based proposed theoretical values for the offset and normalization factors, we perform simulations which allow to validate these theoretical results.

International Symposium on Communications, Control and Signal Processing•Mar 1, 2008•4 citations

A comprehensive Study of Decoding Algorithms for Low Density Parity-Check(LDPC)

C S Anil Kumar, M Vedhashri, L Vanditha +2 more

The near-capacity performance and effective decoding algorithms of Low-Density Parity-Check (LDPC) codes have made them a mainstay of contemporary error correction. With an emphasis on iterative techniques like the Belief Propagation (BP) algorithm, the Min-Sum algorithm, and their variations, this paper offers a thorough analysis of decoding algorithms for LDPC codes. We investigate the trade-offs between various algorithmic techniques’ computational complexity, decoding latency, and error correction performance. Particular focus is placed on new methods and hardware-friendly algorithms that are tailored for next-generation communication systems, such 5 G and beyond.

International Conference on Knowledge Engineering and Communication Systems (ICKECS)•Apr 28, 2025•0 citations

Decoding low-density parity check codes with normalized APP-based algorithm

Jinghu Chen, M.P.C. Fossorier

We propose a normalized a posteriori probability (APP) based algorithm for the decoding of low-density parity check (LDPC) codes. The normalized APP-based algorithm utilizes normalization to improve the accuracy of the soft values delivered by the simplified APP-based algorithm from one iteration to another during the iterative decoding, and can achieve very good tradeoff between decoding complexity and performance.

Globecom•Nov 13, 2002•55 citations

Near optimum universal belief propagation based decoding of low-density parity check codes

Jinghu Chen, M.P.C. Fossorier

In this paper, we propose a belief-propagation (BP)-based decoding algorithm which utilizes normalization to improve the accuracy of the soft values delivered by a previously proposed simplified BP-based algorithm. The normalization factors can be obtained not only by simulation, but also, importantly, theoretically. This new BP-based algorithm is much simpler to implement than BP decoding as it requires only additions of the normalized received values and is universal, i.e., the decoding is independent of the channel characteristics. Some simulation results are given, which show this new decoding approach can achieve an error performance very close to that of BP on the additive white Gaussian noise channel, especially for low-density parity check (LDPC) codes whose check sums have large weights. The principle of normalization can also be used to improve the performance of the max-log-MAP algorithm in turbo decoding, and some coding gain can be achieved if the code length is long enough.

IEEE Transactions on Communications•Mar 1, 2002•672 citations

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

张天瑜

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

Microcomputer & its Applications•Jan 1, 2010•0 citations

LDPC碼的位元翻轉解碼的改進; Improved Bit-Flipping Decoding of Low-Density Parity-Check Codes

張書瑋, Shuwei Zhang

•Jun 25, 2007•0 citations
为了提高Normalized BP-Based算法的译码性能,提出了一种改进的Normalized BP-Based算法。根据校验节点传向变量节点的信息的大小来动态地改变校正因子,实现对BP-Based算法的非线性补偿。仿真结果表明:在误码率低于0.5×10^-2时,与Normalized BP-Based算法相比,改进算法均可以获得约0.1 dB的增益,而只增加少量运算,并且不增加迭代次数。
Low-density parity-check (LDPC) codes deliver very good performance when decoded with the BP algorithm. Unfortunately, this algorithm has the disadvantage to be complex for implementation. In this paper, we investigate the BP algorithm and its simplifications (BP-Based, normalized BP-Based, offset BP-Based). Previous works on normalized and offset BP-Based proposed theoretical values for the offset and normalization factors, we perform simulations which allow to validate these theoretical results.
The near-capacity performance and effective decoding algorithms of Low-Density Parity-Check (LDPC) codes have made them a mainstay of contemporary error correction. With an emphasis on iterative techniques like the Belief Propagation (BP) algorithm, the Min-Sum algorithm, and their variations, this paper offers a thorough analysis of decoding algorithms for LDPC codes. We investigate the trade-offs between various algorithmic techniques’ computational complexity, decoding latency, and error correction performance. Particular focus is placed on new methods and hardware-friendly algorithms that are tailored for next-generation communication systems, such 5 G and beyond.
In this paper, we propose a belief-propagation (BP)-based decoding algorithm which utilizes normalization to improve the accuracy of the soft values delivered by a previously proposed simplified BP-based algorithm. The normalization factors can be obtained not only by simulation, but also, importantly, theoretically. This new BP-based algorithm is much simpler to implement than BP decoding as it requires only additions of the normalized received values and is universal, i.e., the decoding is independent of the channel characteristics. Some simulation results are given, which show this new decoding approach can achieve an error performance very close to that of BP on the additive white Gaussian noise channel, especially for low-density parity check (LDPC) codes whose check sums have large weights. The principle of normalization can also be used to improve the performance of the max-log-MAP algorithm in turbo decoding, and some coding gain can be achieved if the code length is long enough.