International Symposium on Advanced Electrical and Communication Technologies (ISAECT)

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

Nejwa El Maammar, Seddik Bri, Jaouad Foshi

Published Nov 1, 2018• 10 citations

Abstract

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.

DOI: 10.1109/isaect.2018.8618780

Related papers

Offset and Normalized Min-Sum Algorithms for ATSC 3.0 LDPC Decoder

Seho Myung, Sung-Ik Park, Kyung-Joong Kim +3 more

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 provide optimized offset and scaling values for those LDPC decoders based on Advanced Television Systems Committee (ATSC) 3.0 LDPC codes. Furthermore, according to extensive computer simulations, it is shown that the performance of the OMSA and NMSA with the obtained values is close to that of sum-product algorithm, even though the NMSA-based decoder may show a serious error floor due to a channel mismatch effect. Consequently, we recommend that the ATSC 3.0 transmitters use a concatenation of BCH outer code and LDPC inner code as channel coding, considering the use of NMSA for LDPC decoder in ATSC 3.0 receivers.

IEEE Transactions on BroadcastingApr 12, 201743 citations

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

Nejwa El Maammar, Jaouad Foshi, Seddik Bri +2 more

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.

International Conference on Wireless Technologies, Embedded and Intelligent Systems (WITS)Apr 1, 20194 citations

An Adaptation of Min-Sum Decoder for 5G Low-Density Parity-Check Codes

Khoa Le, Fakhreddine Ghaffari, David Declercq

This paper presents an adaptation of the Min-Sum decoders for the Low-Density Parity-Check (LDPC) used in the enhanced mobile broadband (eMBB) scenario in the 5th generation mobile networks (5G). Starting from the structure of the proposed LDPC codes for 5G where a significant part of the Variable Nodes (VNs) is with degree-1 and is sensitively to be erroneous in the traditional Offset Min-Sum decoder, we adapt the Min-Sum decoding principle to decode these 5G LDPC codes, targeting to improve the error correction performance. The proposed decoder, named Adapted Min-Sum (AMS), processes the core and the extension parts of the code differently using different offset factors. By doing that, the error probability of degree-1 VN is significantly depressed. We show through the simulation performance that the proposed decoder, with small number of quantization bits, can even surpass the floating-point counterpart and approaches the performance of the Sum-Product decoder for several 5G LDPC code lengths and code rates, with negligible additional complexity.

IEEE International Symposium on Circuits and Systems proceedingsMay 1, 201922 citations

A Modified Min-Sum Algorithm for Quantized LDPC Decoders

Homayoon Hatami, David G. M. Mitchell, Daniel J. Costello +1 more

It is well known that for decoding low-density parity-check (LDPC) codes, the attenuated min-sum algorithm (AMSA) and the offset min-sum algorithm (OMSA) can outperform the conventional min-sum algorithm (MSA) at low signal-to-noise-ratios (SNRs). In this paper, we demonstrate that, for quantized LDPC decoders, although the MSA achieves better high SNR performance than the AMSA and OMSA, each of the MSA, AMSA, and OMSA all suffer from a relatively high error floor. Therefore, we propose a novel modification of the MSA for decoding quantized LDPC codes with the aim of lowering the error floor. Compared to the quantized MSA, the proposed modification is also helpful at low SNRs, where it matches the waterfall performance of the quantized AMSA and OMSA. The new algorithm is designed based on the assumption that trapping/absorbing sets (or other problematic graphical objects) are the major cause of the error floor for quantized LDPC decoders, and it aims to reduce the probability that these problematic objects lead to decoding errors.

IEEE International Symposium on Information Theory (ISIT)Jul 1, 20192 citations

A Modified Min Sum Decoding Algorithm based on Approximation Enhancement for LDPC Codes

Nam Il Kim, Seung-Que Lee, Jin-Up Kim

Min-sum algorithm(MSA) and its modification are used in LDPC decoder implementations because of its error performance and low computation complexity. In this paper a modified min-sum LDPC decoding algorithm through approximation enhancement using the smallest three minimum values is presented. The proposed algorithm improves error performance and reduces decoder iterations. From the simulation results for 5G NR LDPC codes, we show that the proposed algorithm can achieve about 1.6dB improvement of FER compared to the min-sum decoding algorithm and provide about 10% reduction of the average iteration numbers compare to NMSA with optimum normalization factor.

International Conference on Information and Communication Technology Convergence (ICTC)Oct 21, 20206 citations

An optimized min-sum variable node layering for LDPC decoding

Nassib Laouini, Larbi Ben Hadj Slama, Ammar Bouallègue

Layered decoding is well appreciated in Low-Density Parity-Check (LDPC) decoder implementation since it provides efficient and high-throughput implementation of LDPC decoders. Variable-Node Layered Belief Propagation (VL-BP) algorithm and their reduced-complexity derivatives for LDPC codes are presented. The VL-BP algorithm is a modification of Belief Propagation algorithm (BP), where the variable nodes are divided in subgroups called layers and each iteration is broken into multiple sub-iterations. Some simplifications can also be made to lower the complexity of both BP and CL-BP algorithms, and particularly the complexity of the check node update rule. In this paper, we consider Variable Node Layered BP (VL-BP) algorithm and propose an optimized min-sum VL-BP (MS VL-BP) algorithm for decoding LDPC code which has better performance not only from MS VL-BP algorithm but also from BP algorithm. In this decoding method, unlike other layered algorithms, we consider for the first layer a set of variable nodes that has a low value of the intrinsic information. Simulation results show that good performance can be achieved, and which can even be improved by the addition of either a normalization term or an additive offset term.

Apr 1, 20141 citation