Conference on Cloud and Internet of Things (CIoT)

An Adaptive Exponential Min Sum Decoding Algorithm

Weijia Zhang, Dushantha Nalin K. Jayakody

Published Mar 20, 2023• 3 citations

Abstract

The belief propagation (BP) algorithm for low density parity check (LDPC) codes has proven to have excellent performance and is close to the Shannon limit. However, the high computational complexity is not conducive to realistic use. Although the min sum algorithm (MSA) improves the computational convenience and applicability. It also weakens its decoding capability. In order to improve the decoding performance of MSA and exploit the potential, this paper propose an adaptive exponential correction factor. This can improve the decoding performance of MSA. Adaptive exponential min sum algorithm (AEMSA) demonstrate a noticeable improvement over the normalized min sum algorithm (NMSA) and the BP algorithm in high signal to noise ratio (SNR). AEMSA is also a simple, efficient, low power consuming and highly potential decoding algorithm that can be applied in hardware implementations.

DOI: 10.1109/ciot57267.2023.10084886

Related papers

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, 20168 citations

Development of adaptive exponential min sum decoding algorithm

Wenbin Zhang, M. Ibrahem, V.M. Saklakov

This paper presents an optimized min sum (MS) decoding algorithm with low complexity and high decoding performance for LDPC short codes. The MS algorithm has low computational complexity and is simple to deploy. The MS decoding algorithm, while demonstrating a performance gap compared to the belief propagation (BP) and likelihood ratio BP (LLR-BP) decoding algorithms, shows significant potential for optimization. To improve the decoding performance of traditional MS algorithm, secondary external information is introduced into the control node (CNs) update operations of MS algorithm and optimized as adaptive exponential correction factor (AECF). The optimized MS algorithm is named as adaptive exponential exponential MS decoding algorithm (AEMS). The decoding efficiency of the AEMS algorithm for regular, irregular and LDPC codes of the Consultative Committee on Space Data Systems (CCSDS) was extensively tested, then the complexity of the AEMS algorithm was analyzed and compared with other decoding algorithms. The results show that the AEMS algorithm outperforms the offset MS (OMS) and normalized MS (NMS) algorithms in decoding performance, and outperforms the BP algorithm as the signal-to-noise ratio (SNR) gradually increases. В статье представлен оптимизированный алгоритм декодирования минимальной суммы (MS) с низкой сложностью и высокой производительностью декодирования для коротких кодов LDPC. Алгоритм MS имеет низкую вычислительную сложность и прост в развертывании. По сравнению с алгоритмом декодирования распространения убеждения (BP) и отношения правдоподобия BP (LLR-BP) он показывает разрыв в производительности декодирования, но алгоритм декодирования MS имеет высокий потенциал оптимизации. Для улучшения производительности декодирования традиционного алгоритма MS в операции обновления контрольных узлов (CN) алгоритма MS вводится вторичная внешняя информация и оптимизируется как адаптивный экспоненциальный поправочный коэффициент (AECF). Оптимизированный алгоритм MS назван адаптивным экспоненциальным алгоритмом декодирования MS (AEMS). Эффективность декодирования алгоритма AEMS для обычных, нерегулярных и LDPC-кодов консультативного комитета по системам космических данных (CCSDS) была всесторонне протестирована, затем был проведен анализ и сравнение сложности алгоритма AEMS с другими алгоритмами декодирования. Результаты показывают, что алгоритм AEMS превосходит алгоритмы смещенного MS (OMS) и нормализованного MS (NMS) по производительности декодирования, а также превосходит алгоритм BP по мере постепенного увеличения отношения сигнал/шум (SNR).

Modelirovanie, optimizaciâ i informacionnye tehnologii.Oct 8, 20240 citations

Single-Step Adaptive Offset Min-Sum Algorithm for Decoding LDPC Codes

Xiaoju Lin, Gansuren Baasantseren, Hae-Kee Lee +1 more

Low-density parity-check (LDPC) codes with belief-propagation (BP) algorithm achieve a remarkable performance close to the Shannon limit at reasonable decoding complexity. Conventionally, each iteration in decoding process contains two steps, the horizontal step and the vertical step. In this paper, an efficient implementation of the adaptive offset min-sum (AOMS) algorithm for decoding LDPC codes using the single-step method is proposed. Furthermore, the performances of the AOMS algorithm compared with belief-propagation (BP) algorithm are investigated. The algorithms using the single-step method reduce the implementation complexity, speed up the decoding process and have better efficiency in terms of memory requirements.

The Transactions of The Korean Institute of Electrical EngineersJan 1, 20100 citations

Different perspective and approach to implement adaptive normalised belief propagation-based decoding for low-density parity check codes

Panupat Poocharoen, Mario Edgardo Magana

In this study, the authors propose an improved version of the min-sum algorithm for low-density parity check code decoding, which the authors call ‘adaptive normalised BP-based’ algorithm. Their decoder provides a compromise solution between belief propagation and the min-sum algorithms by adding an exponent offset to each variable node's intrinsic information in the check node update equation. The extrinsic information from the min-sum decoder is then adjusted by applying a negative power of the two scale factor, which can be easily implemented by right shifting the min-sum extrinsic information. The difference between their approach and other adaptive normalised min-sum decoders is that the authors select the normalisation scale factor using a clear analytical approach based on the underlying principles. The simulation results show that the proposed decoder outperforms the min-sum decoder and performs very close to the BP decoder with lower complexity.

IET CommunicationsOct 16, 20125 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, 20143 citations

New Min-sum LDPC Decoding Algorithm Using SNR-Considered Adaptive Scaling Factors

Yongmin Jung, Yunho Jung, Seongjoo Lee +1 more

This paper proposes a new min-sum algorithm for low-density parity-check decoding. In this paper, we first define the negative and positive effects of the received signal-to-noise ratio (SNR) in the min-sum decoding algorithm. To improve the performance of error correction by considering the negative and positive effects of the received SNR, the proposed algorithm applies adaptive scaling factors not only to extrinsic information but also to a received log-likelihood ratio. We also propose a combined variable and check node architecture to realize the proposed algorithm with low complexity. The simulation results show that the proposed algorithm achieves up to 0.4 dB coding gain with low complexity compared to existing min-sum-based algorithms.

ETRI JournalMar 19, 20147 citations