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 Wireless Technologies, Embedded and Intelligent Systems (WITS)

Performance Analysis of Layered Normalized Min-Sum for LDPC Codes over Weibull Fading Channels

Nejwa El Maammar, Jaouad Foshi, Seddik Bri, Soufiane Oukili, Abdelhak Babaoui

Published Apr 1, 2019• 4 citations
Publisher

Abstract

Normalized Min-Sum Algorithms (NMSA) are extensively employed in trading LDPC (Low Density Parity Check) decoders due to their low complexity and reasonable performance close to the performance of sum product algorithm in terms of Error Rate. Our work is focused on the enhancement of error rate performances of NMS algorithm for the decoding of LDPC decoding. In this context we have proposed a Layered Normalized Min-Sum algorithm (LNMS), which employs an adaptive normalization factor to ameliorate the reliability of the information transmitted during the decoding process. To perform this analysis study LDPC coded communication system has been examined over Weibull fading channels and was analyzed for different decoding techniques by the help of comparative computer simulations. Simulation results indicate that the proposed decoding algorithm can achieve better Bit Error Rate (BER) performances closer to SP algorithm with the preservation of the principal characteristics of the MS algorithm.

DOI
10.1109/wits.2019.8723865

Related papers

Layered Offset Min-Sum Decoding for Low Density Parity Check Codes

Nejwa El Maammar, Seddik Bri, Jaouad Foshi

Offset Min-Sum Algorithm (OMSA) and Normalized Min-Sum Algorithm (NMSA) are widely used in commercial LDPC decoders due to low complexity and reasonable performance. In this paper we proposes an Adaptive Layered Offset min- sum algorithm for the decoding of LDPC codes, which utilizes an adaptive offset factor to improve the accuracy of the soft information transferred during the iterative decoding process, and it provides good performance accordingly. The performed simulations showed that the layered offset min-sum decoding for LDPC codes can provide significant improvement compared to existing MS based algorithm, OMSA and NMSA.

International Symposium on Advanced Electrical and Communication Technologies (ISAECT)•Nov 1, 2018•10 citations

Performance Analysis of Different Flexible Decoding Algorithms for NR-LDPC Codes

Layla Mahdi Salih, Thuraya Mahmood Qaradaghi, Jalal J. Hamad Ameen

Channel coding technique is a fundamental building block in any modern communication system to realize reliable, fast, and secure data transmission. At the same time, it is a challenging and crucial task, as the data transmission happens in a channel where noise, fading, and other impairments are present. The Low-Density Parity-Check (LDPC) codes give substantial results close to the Shannon limit when the complexity and processing delay time are unlimited. In this paper, the performance of the LDPC decoding with four algorithms was investigated. The investigated four algorithms were Belief Propagation (BP), Layered Belief Propagation (LBP), Normalized min-sum (NMS), and Offset min-sum (OMS). These algorithms were examined for code rates ranging from 1/3 to 9/10 and message block lengths (64, 512, 1024, and 5120) bits. The simulation results revealed the flexibility of these decoders in supporting these code rates and block lengths, which enables their usage in a wide range of applications and scenarios for fifth-generation (5G) wireless communication. In addition, the effect of the maximum number of decoding iterations on the error correction performance was investigated, and a gain of 5.6 dB can be obtained by using 32 decoding iterations at BER=2*10-3 instead of one decoding iteration. The results showed that the decoders performed better for longer message blocks than for short message blocks, and less power was required for transmitting longer messages. Finally, the comparison results of their performance in terms of bit error rate (BER) under the same conditions showed a gain of 0.8 dB using LBP at BER= 10-5 compared with the NMS decoding algorithm.

Tikrit Journal of Engineering Sciences•Dec 11, 2022•3 citations

Performance Enhancement of Low-Density Parity-Check Decoder Using Neural Network Optimized Parameters

Amany Sabah Hassan, Mohammed Abdullah Hussein ElSheikh

Low-density parity-check (LDPC) codes are of prime importance in achieving near-Shannon capacity in current communication systems. However, the optimal decoding process for LDPC codes is computationally intensive. This paper presents a neural normalized min-sum (NNMS) decoding network that improves error correction capabilities with minimal computational overhead. A weight-sharing approach is adopted in the NNMS model, in which the correction factors (α, β) are shared across nodes within a single layer. This approach decreases the total number of parameters in the model compared to traditional neural decoders, making it easier for hardware implementation. The NNMS model is tested using a (576, 432) LDPC code for an additive white Gaussian noise channel with binary phase shift keying modulation. Simulation results show that the NNMS model outperforms traditional normalized min-sum (NMS) decoders. At a signal-to-noise ratio of 5 dB, the NNMS model has a bit-error rate (BER) of 1.0 × 10−7, whereas traditional NMS models have a less steep slope. In particular, the NNMS model has a coding gain of 1.25 dB compared to the traditional NMS model at a BER threshold of 1.0 × 10−3. This shows that the NNMS model is an efficient solution for high-performance, real-time digital communication systems.

UHD Journal of Science and Technology•Jul 5, 2026•0 citations

Adaptive normalized min-sum algorithm for LDPC decoding

Liwen Fan, Changyong Pan, Kewu Peng +1 more

This paper proposes an adaptive normalized min-sum algorithm for the decoding of low-density parity check (LDPC) codes, which utilizes an adaptive normalization factor to improve the accuracy of the soft information transferred during the iterative decoding process, and provides superior performance accordingly. This adaptive normalization factor can be adjusted dynamically and adaptively at each decoding iteration according to a look-up table obtained via training and simulation. Its implementation facility and independence from the channel characteristics make the proposed adaptive normalized min-sum algorithm expect a wide application. Simulation results show that the proposed algorithm can achieve performance much closer to the sum-product algorithm and a coding gain of around 0.2dB compared to the conventional normalized min-sum algorithm for DVB-S2's rate 2/5 and 3/5 LDPC codes over the additive white Gaussian noise (AWGN) channel.

International Wireless Communications and Mobile Computing Conference (IWCMC)•Jul 1, 2013•23 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

A Modified Normalized Min - Sum Decoding Algorithm for Irregular LDPC Codes

Michaelraj Kingston Roberts, Ramesh Jayabalan

In this paper, a modified normalized Min-Sum algorithm (MNMSA) is proposed for decoding irregular Low Density Parity Check Codes (LDPC) with non-uniform degree distribution. The proposed algorithm provides an efficient decoding scheme to enhance the error performance of an irregular LDPC code without increasing the hardware complexity. An efficient 6- bit quantization scheme is utilized in the proposed algorithm with optimally combined normalization and down scaling factors to resolve the magnitude overestimation issue which occurs during iterative message passing process between the nodes. The simulation results demonstrate that the proposed algorithm achieves good decoding performance in terms of Frame Error Rate (FER) and Bit Error Rate (BER) without the requirement of complex arithmetic calculations. Compared to other min- sum based decoding algorithms the decoding process of the proposed MNMSA requires only fewer decoding iterations over wide range of signal- to- noise ratio (SNR) to achieve comparable decoding performance to that of Belief Propagation (BP) algorithm without increasing the hardware complexity.

•Jan 1, 2014•3 citations
Normalized Min-Sum Algorithms (NMSA) are extensively employed in trading LDPC (Low Density Parity Check) decoders due to their low complexity and reasonable performance close to the performance of sum product algorithm in terms of Error Rate. Our work is focused on the enhancement of error rate performances of NMS algorithm for the decoding of LDPC decoding. In this context we have proposed a Layered Normalized Min-Sum algorithm (LNMS), which employs an adaptive normalization factor to ameliorate the reliability of the information transmitted during the decoding process. To perform this analysis study LDPC coded communication system has been examined over Weibull fading channels and was analyzed for different decoding techniques by the help of comparative computer simulations. Simulation results indicate that the proposed decoding algorithm can achieve better Bit Error Rate (BER) performances closer to SP algorithm with the preservation of the principal characteristics of the MS algorithm.
Offset Min-Sum Algorithm (OMSA) and Normalized Min-Sum Algorithm (NMSA) are widely used in commercial LDPC decoders due to low complexity and reasonable performance. In this paper we proposes an Adaptive Layered Offset min- sum algorithm for the decoding of LDPC codes, which utilizes an adaptive offset factor to improve the accuracy of the soft information transferred during the iterative decoding process, and it provides good performance accordingly. The performed simulations showed that the layered offset min-sum decoding for LDPC codes can provide significant improvement compared to existing MS based algorithm, OMSA and NMSA.
Channel coding technique is a fundamental building block in any modern communication system to realize reliable, fast, and secure data transmission. At the same time, it is a challenging and crucial task, as the data transmission happens in a channel where noise, fading, and other impairments are present. The Low-Density Parity-Check (LDPC) codes give substantial results close to the Shannon limit when the complexity and processing delay time are unlimited. In this paper, the performance of the LDPC decoding with four algorithms was investigated. The investigated four algorithms were Belief Propagation (BP), Layered Belief Propagation (LBP), Normalized min-sum (NMS), and Offset min-sum (OMS). These algorithms were examined for code rates ranging from 1/3 to 9/10 and message block lengths (64, 512, 1024, and 5120) bits. The simulation results revealed the flexibility of these decoders in supporting these code rates and block lengths, which enables their usage in a wide range of applications and scenarios for fifth-generation (5G) wireless communication. In addition, the effect of the maximum number of decoding iterations on the error correction performance was investigated, and a gain of 5.6 dB can be obtained by using 32 decoding iterations at BER=2*10-3 instead of one decoding iteration. The results showed that the decoders performed better for longer message blocks than for short message blocks, and less power was required for transmitting longer messages. Finally, the comparison results of their performance in terms of bit error rate (BER) under the same conditions showed a gain of 0.8 dB using LBP at BER= 10-5 compared with the NMS decoding algorithm.
Low-density parity-check (LDPC) codes are of prime importance in achieving near-Shannon capacity in current communication systems. However, the optimal decoding process for LDPC codes is computationally intensive. This paper presents a neural normalized min-sum (NNMS) decoding network that improves error correction capabilities with minimal computational overhead. A weight-sharing approach is adopted in the NNMS model, in which the correction factors (α, β) are shared across nodes within a single layer. This approach decreases the total number of parameters in the model compared to traditional neural decoders, making it easier for hardware implementation. The NNMS model is tested using a (576, 432) LDPC code for an additive white Gaussian noise channel with binary phase shift keying modulation. Simulation results show that the NNMS model outperforms traditional normalized min-sum (NMS) decoders. At a signal-to-noise ratio of 5 dB, the NNMS model has a bit-error rate (BER) of 1.0 × 10−7, whereas traditional NMS models have a less steep slope. In particular, the NNMS model has a coding gain of 1.25 dB compared to the traditional NMS model at a BER threshold of 1.0 × 10−3. This shows that the NNMS model is an efficient solution for high-performance, real-time digital communication systems.
This paper proposes an adaptive normalized min-sum algorithm for the decoding of low-density parity check (LDPC) codes, which utilizes an adaptive normalization factor to improve the accuracy of the soft information transferred during the iterative decoding process, and provides superior performance accordingly. This adaptive normalization factor can be adjusted dynamically and adaptively at each decoding iteration according to a look-up table obtained via training and simulation. Its implementation facility and independence from the channel characteristics make the proposed adaptive normalized min-sum algorithm expect a wide application. Simulation results show that the proposed algorithm can achieve performance much closer to the sum-product algorithm and a coding gain of around 0.2dB compared to the conventional normalized min-sum algorithm for DVB-S2's rate 2/5 and 3/5 LDPC codes over the additive white Gaussian noise (AWGN) channel.
In this paper, a modified normalized Min-Sum algorithm (MNMSA) is proposed for decoding irregular Low Density Parity Check Codes (LDPC) with non-uniform degree distribution. The proposed algorithm provides an efficient decoding scheme to enhance the error performance of an irregular LDPC code without increasing the hardware complexity. An efficient 6- bit quantization scheme is utilized in the proposed algorithm with optimally combined normalization and down scaling factors to resolve the magnitude overestimation issue which occurs during iterative message passing process between the nodes. The simulation results demonstrate that the proposed algorithm achieves good decoding performance in terms of Frame Error Rate (FER) and Bit Error Rate (BER) without the requirement of complex arithmetic calculations. Compared to other min- sum based decoding algorithms the decoding process of the proposed MNMSA requires only fewer decoding iterations over wide range of signal- to- noise ratio (SNR) to achieve comparable decoding performance to that of Belief Propagation (BP) algorithm without increasing the hardware complexity.