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

IEEE Transactions on Communications

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

Jinghu Chen, M.P.C. Fossorier

Published Mar 1, 2002• 661 citations
Publisher

Abstract

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.

DOI
10.1109/26.990903

Related papers

Near optimum universal belief propagation based decoding of LDPC codes and extension to turbo decoding

J. Chen, M.P.C. Fossorier

In this paper, we propose a normalized belief propagation-based algorithm which utilizes normalization to improve the accuracy of the soft values delivered by a previously proposed simplified belief propagation-based algorithm, and can achieve an error performance very close to that of belief propagation. We also extend the principle of normalization to improve the performance of the Max-Log-MAP algorithm in turbo decoding.

IEEE International Symposium on Information Theory (ISIT)•Nov 13, 2002•12 citations

Belief-Propagation-Approximated Decoding of Low-Density Parity-Check Codes

Ping Zhang

In this paper, we propose a new reduced-complexity decoding algorithm of Low-Density Parity-Check (LDPC) codes, called Belief-Propagation-Approximated (BPA) algorithm, which utilizes the idea of normalization and translates approximately the intricate nonlinear operation in the check nodes of the original BP algorithm to only one operation of looking up the table. The normalization factors can be obtained by simulation, or theoretically. Simulation results demonstrate that BPA algorithm exhibits fairly satisfactory bit error performance on the Additive White Gaussian Noise (AWGN) channel.

中国邮电高校学报：英文版•Jan 1, 2004•1 citation

Belief-Propagation-Approximated Decoding of Low-Density Parity-Check Codes

SONGHui-shi, ZHANGPing

In this paper, we propose a new reduced-complexity decoding algorithm of Low-Density Parity-Check (LDPC) codes, called Belief-Propagation-Approximated (BPA) algorithm, which utilizes the idea of normaliza-tion and translates approximately the intricate nonlinear operation in the check nodes of the original BP algorithm to only one operation of looking up the table. The normalization factors can be obtained by simulation, or theoretically. Simulation results demonstrate that BPA algorithm exhibits fairly satisfactory bit error performance on the Additive White Gaussian Noise (AWGN) channel.

中国邮电高校学报：英文版•Jan 1, 2004•1 citation

Very-low-complexity decoding algorithm for low-density parity-check codes

Hui-Shi Song, Ping Zhang

In this paper, we propose a new very-low-complexity (VLC) decoding algorithm for low-density parity-check (LDPC) codes. This new algorithm only need subtract a correcting factor to improve the accuracy of the soft message values delivered by a previously proposed simplified belief-propagation (BP)-based algorithm called uniformly most powerful (UMP) algorithm. However, the VLC algorithm outperforms the UMP algorithm greatly. The correcting factor can be obtained by simulation or theoretical derivation. This new VLC algorithm is much simpler to implement than BP algorithm, and also simpler than previously proposed normalized BP-based algorithm in which the operation of dividing a normalization factor is needed. However, the performance of the VLC algorithm is slightly better than that of the normalized BP-based algorithm. Also, the VLC algorithm is universal in that the decoding is independent of the channel characteristics. Simulation results demonstrate that the performance of the new VLC algorithm can nearly approach that of BP on the additive white Gaussian noise (AWGN) channel.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Jul 8, 2004•2 citations

A high‐performance belief propagation decoding algorithm for codes with short cycles

Ali Karimi-lenji, Monireh Houshmand, Fahimeh Zarmehi

Summary The simplicity of decoding is one of the most important characteristics of the low density parity check (LDPC) codes. Belief propagation (BP) decoding algorithm is a well‐known decoding algorithm for LDPC codes. Most LDPC codes with long lengths have short cycles in their Tanner graphs, which reduce the performance of the BP algorithm. In this paper, we present 2 methods to improve the BP decoding algorithm for LDPC codes. In these methods, the calculation of the variable nodes is controlled by using “multiplicative correction factor” and “additive correction factor.” These factors are obtained for 2 separate channels, namely additive white Gaussian noise (AWGN) and binary symmetric channel (BSC), as 2 functions of code and channel parameters. Moreover, we use the BP‐based method in the calculation of the check nodes, which reduces the required resources. Simulation results show the proposed algorithm has better performance and lower decoding error as compared to BP and similar methods like normalized‐BP and offset‐BP algorithms.

International Journal of Communication Systems•Feb 28, 2017•2 citations

Study on near optimum simplified belief propagation based decoding of low-density parity check codes

Xie Wei

In this paper,the log-likehood-ratio-based belief-propagation(LLR-BP) decoding algorithm and its two simplified versions which utilize offset term and polyfit for low-density parity check codes are discussed.The key parameters of the two simplified algorithms are obtained by simulation.The simulation results show that both simplified decoding algorithms not only may be efficiently implemented in hardware but also achieve a performance of very close to that of the BP algorithm.

Information technology newsletter•Jan 1, 2007•0 citations
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.
In this paper, we propose a new reduced-complexity decoding algorithm of Low-Density Parity-Check (LDPC) codes, called Belief-Propagation-Approximated (BPA) algorithm, which utilizes the idea of normalization and translates approximately the intricate nonlinear operation in the check nodes of the original BP algorithm to only one operation of looking up the table. The normalization factors can be obtained by simulation, or theoretically. Simulation results demonstrate that BPA algorithm exhibits fairly satisfactory bit error performance on the Additive White Gaussian Noise (AWGN) channel.
In this paper, we propose a new reduced-complexity decoding algorithm of Low-Density Parity-Check (LDPC) codes, called Belief-Propagation-Approximated (BPA) algorithm, which utilizes the idea of normaliza-tion and translates approximately the intricate nonlinear operation in the check nodes of the original BP algorithm to only one operation of looking up the table. The normalization factors can be obtained by simulation, or theoretically. Simulation results demonstrate that BPA algorithm exhibits fairly satisfactory bit error performance on the Additive White Gaussian Noise (AWGN) channel.
In this paper, we propose a new very-low-complexity (VLC) decoding algorithm for low-density parity-check (LDPC) codes. This new algorithm only need subtract a correcting factor to improve the accuracy of the soft message values delivered by a previously proposed simplified belief-propagation (BP)-based algorithm called uniformly most powerful (UMP) algorithm. However, the VLC algorithm outperforms the UMP algorithm greatly. The correcting factor can be obtained by simulation or theoretical derivation. This new VLC algorithm is much simpler to implement than BP algorithm, and also simpler than previously proposed normalized BP-based algorithm in which the operation of dividing a normalization factor is needed. However, the performance of the VLC algorithm is slightly better than that of the normalized BP-based algorithm. Also, the VLC algorithm is universal in that the decoding is independent of the channel characteristics. Simulation results demonstrate that the performance of the new VLC algorithm can nearly approach that of BP on the additive white Gaussian noise (AWGN) channel.
Summary The simplicity of decoding is one of the most important characteristics of the low density parity check (LDPC) codes. Belief propagation (BP) decoding algorithm is a well‐known decoding algorithm for LDPC codes. Most LDPC codes with long lengths have short cycles in their Tanner graphs, which reduce the performance of the BP algorithm. In this paper, we present 2 methods to improve the BP decoding algorithm for LDPC codes. In these methods, the calculation of the variable nodes is controlled by using “multiplicative correction factor” and “additive correction factor.” These factors are obtained for 2 separate channels, namely additive white Gaussian noise (AWGN) and binary symmetric channel (BSC), as 2 functions of code and channel parameters. Moreover, we use the BP‐based method in the calculation of the check nodes, which reduces the required resources. Simulation results show the proposed algorithm has better performance and lower decoding error as compared to BP and similar methods like normalized‐BP and offset‐BP algorithms.