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

International Conference on Graphics and Image Processing (ICGIP)

An improved normalized min-sum decoding algorithm for regular LDPC

Peng Jiang, Zheng Dou

Published Jan 3, 2020• 0 citations
Publisher

Abstract

Low-density parity-check code (LDPC) is a kind of better error correction code which is played an important role in the reliability transmission of communication systems. In the aspect of decoding algorithm, the NMS algorithm becomes the mainstream algorithm dues to its lower complexity. what’s more, the Semi-serial decoding algorithm was put forward to reduce decoding iterations. However, the compensation factor of NMS algorithm is a fixed value and the Semi-serial decoding algorithm only considers one aspect of reducing iterations. In the actual decoding process, this value varies with the degree of the check node and the number of iterations. in order to solve the problems of these algorithms, this paper will propose a new improved algorithm. Firstly, we will adopt a dynamic compensation factor to improve performance of NMS algorithm on regular LDPC code. Then combined with the idea of Semi-serial decoding algorithm to reduce the number of iterations. The dynamic factor is firstly analyzed theoretically by density evolution theory. Then through the Monte Carlo experiment and the true LLR, the suitable dynamic compensation factors can be obtained which is changes with the number of iterations.

DOI
10.1117/12.2557619

Related papers

Modified Normalized Min-Sum decoding of LDPC codes

Rong Chen, Yiming Wang

In this paper, we present an improvement on the normalized min-sum (NMS) decoding algorithm for low density parity check codes. The modified NMS (M-NMS) algorithm introduces a more efficient adjustment for check node update computation. Taking the sub-minimum value among extrinsic information from the variable nodes into consideration, we make the correction factor varies with different iterations. Results show that, compared with standard min-sum (MS) and NMS decoding algorithms, the proposed method not only offers a better performance but also achieves a lower error floor in the high SNR region.

International Conference on Signal Processing•Oct 1, 2008•3 citations

A Hybrid Decoding Algorithm for Low-Rate LDPC codes in 5G

Kaifei Sun, Ming Jiang

A hybrid decoding algorithm for low-density parity-check codes is presented. The proposed algorithm applies different updating schemes, such as the normalized min-sum (NMS) simplification and linear approximation, to the check-node based on its degree. Meanwhile, to eliminate the dependence on the channel variance estimation, the proposed algorithm adopts a multiplicative factor to initialize the channel input and a fixed linear functions for check-node updating. From the iterative thresholds and decoding simulations, our proposed algorithm can be shown to achieve improved performance (much closer to that of the belief propagation decoding) at the expense of a slight increase in complexity to NMS algorithm.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 1, 2018•13 citations

An improved normalized min-sum algorithm for LDPC codes

Jinlei Chen, Yan Zhang, Ruiyi Sun

An improved normalized min-sum (IN-MS) algorithm is proposed for decoding low-density parity-check (LDPC) codes. In this algorithm, two normalized factors are used in check node computing, one for the minimum data and another for the second minimum data, and this algorithm achieves a better approximation to the BP algorithm. Simulation results show that the decoding performance of IN-MS algorithm is better than that of the normalized min-sum (NMS) algorithm.

IEEE/ACIS International Conference on Computer and Information Science (ICIS)•Jun 1, 2013•9 citations

Improved LDPC decoding algorithms based on min-sum algorithm

Y.V. A. C. Kumara, Chandika Bandara Wavegedara

Low-Density Parity check (LDPC) codes offer high-performance error correction near the Shannon limit which employs large code lengths and some iterations in the decoding process. The conventional decoding algorithm of LDPC is the Log Likelihood Ratio based Belief Propagation (LLR BP) which is also known as the `Sum-Product algorithm' which gives the best decoding performance and requires the most computational complexity and implementations with increased hardware complexity. Another simpler variant of this algorithm is used which is known as `min-sum algorithm' which reduces computational complexity as well as hardware complexity but with reduced accuracy. This paper analyzes the reason min-sum algorithm is more prone to errors when compared to the sum-product algorithm, and puts forward two improved algorithms which improve the performance of the min-sum algorithm with comparable algorithmic complexity.

Moratuwa Engineering Research Conference (MERCon)•Apr 1, 2016•8 citations

Joint SB/NMS and Genetic Optimization for High Performance LDPC Decoding

Junhao Ding, Honghao Shi, Zhiyong Luo

In recent years, many communication standards have adopted the LDPC (Low-Density Parity Check) code due to its excellent error correction performance, but it also induces some problems. For example, the use of 5G in mobile phones dramatically reduces battery life. Therefore, it is particularly significant for LDPC code to design a decoding algorithm that does not increase hardware implementation complexity but has superior error correction performance and iteration speed faster than traditional decoding algorithms. Inspired by several network structures in artificial intelligence, bias is used to improve the performance and robustness of the network. In order to enhance decoding algorithm robustness and accuracy, a method is shown by changing the offset in OMSA to the bias and combining NMSA in the near-zero range in this paper. It significantly avoids the log-likelihood ratio information loss when less than the offset value and diminishes too quickly or sluggishly. A Segmented Bias/Normalize Min-Sum(SB/NMS) LDPC decoding algorithm is proposed with a layered structure. This algorithm can avoid the impact of the problems mentioned above and significantly improve the performance and iteration speed of the decoding process. Compared with the BLER (resp. BER) performance the traditional BP, NMS and OMS algorithm achieves a gain of 0.04, 0.11, and 0.15dB (resp. 0.035dB, 0.06, and 0.13dB). Meanwhile, the minimum SNR requirements of BLER =0.001 can be reduced by 0.02 dB compared with the BP algorithm. The parameters of SN/NMSA can be pre-processed on the computer, so there will be no additional increase in the overhead in resources and get better performance while getting faster iteration speed, while greatly guaranteeing the reliability and effectiveness of data transmission.

International Symposium on Networks, Computers and Communications (ISNCC)•Jul 19, 2022•2 citations

Adaptive-normalized min-sum algorithm

Xiaofu Wu, Yue Song, Long Cui +2 more

An adaptive-normalized min-sum (AN-MS) algorithm for decoding low-density parity-check (LDPC) codes is proposed. Unlike the normalized min-sum (NMS) algorithm, the normalization factor is adaptively adjusted according to the state of check nodes in each iteration. Simulation results show that the proposed AN-MS algorithm can perform better than the NMS algorithm while still preserving the low complexity of the min-sum algorithm.

International Conference on Future Computer and Communication•Jan 1, 2010•11 citations
Low-density parity-check code (LDPC) is a kind of better error correction code which is played an important role in the reliability transmission of communication systems. In the aspect of decoding algorithm, the NMS algorithm becomes the mainstream algorithm dues to its lower complexity. what’s more, the Semi-serial decoding algorithm was put forward to reduce decoding iterations. However, the compensation factor of NMS algorithm is a fixed value and the Semi-serial decoding algorithm only considers one aspect of reducing iterations. In the actual decoding process, this value varies with the degree of the check node and the number of iterations. in order to solve the problems of these algorithms, this paper will propose a new improved algorithm. Firstly, we will adopt a dynamic compensation factor to improve performance of NMS algorithm on regular LDPC code. Then combined with the idea of Semi-serial decoding algorithm to reduce the number of iterations. The dynamic factor is firstly analyzed theoretically by density evolution theory. Then through the Monte Carlo experiment and the true LLR, the suitable dynamic compensation factors can be obtained which is changes with the number of iterations.
In this paper, we present an improvement on the normalized min-sum (NMS) decoding algorithm for low density parity check codes. The modified NMS (M-NMS) algorithm introduces a more efficient adjustment for check node update computation. Taking the sub-minimum value among extrinsic information from the variable nodes into consideration, we make the correction factor varies with different iterations. Results show that, compared with standard min-sum (MS) and NMS decoding algorithms, the proposed method not only offers a better performance but also achieves a lower error floor in the high SNR region.
A hybrid decoding algorithm for low-density parity-check codes is presented. The proposed algorithm applies different updating schemes, such as the normalized min-sum (NMS) simplification and linear approximation, to the check-node based on its degree. Meanwhile, to eliminate the dependence on the channel variance estimation, the proposed algorithm adopts a multiplicative factor to initialize the channel input and a fixed linear functions for check-node updating. From the iterative thresholds and decoding simulations, our proposed algorithm can be shown to achieve improved performance (much closer to that of the belief propagation decoding) at the expense of a slight increase in complexity to NMS algorithm.
Low-Density Parity check (LDPC) codes offer high-performance error correction near the Shannon limit which employs large code lengths and some iterations in the decoding process. The conventional decoding algorithm of LDPC is the Log Likelihood Ratio based Belief Propagation (LLR BP) which is also known as the `Sum-Product algorithm' which gives the best decoding performance and requires the most computational complexity and implementations with increased hardware complexity. Another simpler variant of this algorithm is used which is known as `min-sum algorithm' which reduces computational complexity as well as hardware complexity but with reduced accuracy. This paper analyzes the reason min-sum algorithm is more prone to errors when compared to the sum-product algorithm, and puts forward two improved algorithms which improve the performance of the min-sum algorithm with comparable algorithmic complexity.
In recent years, many communication standards have adopted the LDPC (Low-Density Parity Check) code due to its excellent error correction performance, but it also induces some problems. For example, the use of 5G in mobile phones dramatically reduces battery life. Therefore, it is particularly significant for LDPC code to design a decoding algorithm that does not increase hardware implementation complexity but has superior error correction performance and iteration speed faster than traditional decoding algorithms. Inspired by several network structures in artificial intelligence, bias is used to improve the performance and robustness of the network. In order to enhance decoding algorithm robustness and accuracy, a method is shown by changing the offset in OMSA to the bias and combining NMSA in the near-zero range in this paper. It significantly avoids the log-likelihood ratio information loss when less than the offset value and diminishes too quickly or sluggishly. A Segmented Bias/Normalize Min-Sum(SB/NMS) LDPC decoding algorithm is proposed with a layered structure. This algorithm can avoid the impact of the problems mentioned above and significantly improve the performance and iteration speed of the decoding process. Compared with the BLER (resp. BER) performance the traditional BP, NMS and OMS algorithm achieves a gain of 0.04, 0.11, and 0.15dB (resp. 0.035dB, 0.06, and 0.13dB). Meanwhile, the minimum SNR requirements of BLER =0.001 can be reduced by 0.02 dB compared with the BP algorithm. The parameters of SN/NMSA can be pre-processed on the computer, so there will be no additional increase in the overhead in resources and get better performance while getting faster iteration speed, while greatly guaranteeing the reliability and effectiveness of data transmission.