Indonesian Journal of Electrical Engineering and Computer Science

Girth aware normalized min sum decoding algorithm for shorter length low density parity check codes

Abdelilah Kadi, Hajar El Ouakili, Rachid El Alami, Saïd Najah

Published Jun 1, 2022• 2 citations

Abstract

Recently, short block codes are in great demand due to the emergent applications requiring the transmission of a short data unit and can guarantee speedy communication, with a minimum of latency and complexity which are among the technical challenges in today’s wireless services and systems. In the context of channel coding using low density parity check (LDPC) codes, the shorter length LDPC block codes are more likely to have short cycles with lengths of 4 and 6. The effect of the cycle with the minimum size is that this one prevents the propagation of the information in the Tanner graph during the iterative process. Therefore, the message decoded by short block code is assumed to be of poor quality due to short cycles. In this work, we present a study of the evolution of the messages on check nodes during the iterative decoding process when using the LDPC decoding algorithm normalized min sum (NMS), to see the destructive effect of short cycles and justify the effectiveness of the girth aware normalized min sum (GA-NMS) decoding LDPC codes algorithm in terms of correction of the errors, particularly for the codes with short cycles 4 and 6. In addition to this, the GA-NMS algorithm is evaluated in terms of bit error rate performance and convergence behavior, using wireless regional area networks (WRAN) LDPC code, which is considered as a short block code.

DOI: 10.11591/ijeecs.v26.i3.pp1692-1700

Related papers

Novel method for improving performances of normalized MS decoder using WIMAX code

Abdelilah Kadi, Mostafa Mrabti, Saïd Najah +1 more

LDPC code is a powerful error correcting code used in many communication systems. Efficient decoding algorithm and hardware implementation of LDPC code is an important issue. The paper proposes an improved version of the Normalized Min-Sum (NMS) decoding algorithm named “Girth-Aware NMS”. The principle of the GA-NMS is to determine “offline” the optimal normalisation factor of the extrinsic message using the structure property of the Tanner Graph associated to the LDPC matrix. The idea can be expressed simply: a check node implied in one, or more, cycle of minimum size (the so-called Girth) in the Tanner Graph is more subjected to self-confirmation than other check nodes. Thus, the extrinsic messages generated by this type of check nodes should be more aggressively “normalized” (or attenuated) than other check nodes. In the context of the IEEE P802.16e standard (WIFI standard), simulation results of the GA-NMS shows both improved decoding performance and reduced average number of decoding iterations.

International Conference on Advanced Communication Systems and Information Security (ACOSIS)Oct 1, 20161 citation

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.

Oct 1, 20083 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 SciencesDec 11, 20223 citations

Two-Way Normalization of Min-Sum Decoding Algorithm for Medium and Short Length Low Density Parity Check Codes

Waheed Ullah, Tao Jiang, Fengfan Yang +1 more

This paper proposes a new technique to improve bit error performance of the min-sum decoding algorithm for low density parity check codes. The proposed technique is based on two way normalization of min-sum LDPC decoding algorithm. The variable message is modified by two normalization factors to achieve the optimum approximation for the magnitude overestimation at the check node processing. This new method does not need exhaustive search for the optimum normalization factor when there is a change in code length and code rate. The performance has been evaluated for medium and short length codes using a small number of iterations. The results show improved performance of the proposed method, which makes it attractive for many practical applications.

International Conference on Wireless Communications, Networking and Mobile ComputingSep 1, 201111 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

Short-length Low-density Parity-check Codes: Construction and Decoding Algorithms

Cornelius T. Healy

Error control coding is an essential part of modern communications systems. LDPC codes have been demonstrated to offer performance near the fundamental limits of channels corrupted by random noise. Optimal maximum likelihood decoding of LDPC codes is too complex to be practically useful even at short block lengths and so a graph-based message passing decoder known as the belief propagation algorithm is used instead. In fact, on graphs without closed paths known as cycles the iterative message passing decoding is known to be optimal and may converge in a single iteration, although identifying the message update schedule which allows single-iteration convergence is not trivial. At finite block lengths graphs without cycles have poor minimum distance properties and perform poorly even under optimal decoding. LDPC codes with large block length have been demonstrated to offer performance close to that predicted for codes of infinite length, as the cycles present in the graph are quite long. In this thesis, LDPC codes of shorter length are considered as they offer advantages in terms of latency and complexity, at the cost of performance degradation from the increased number of short cycles in the graph. For these shorter LDPC codes, the problems considered are: \n \nFirst, improved construction of structured and unstructured LDPC code graphs of short length with a view to reducing the harmful effects of the cycles on error rate performance, based on knowledge of the decoding process. Structured code graphs are particularly interesting as they allow benefits in encoding and decoding complexity and speed. Secondly, the design and construction of LDPC codes for the block fading channel, a particularly challenging scenario from the point of view of error control code design. Both established and novel classes of codes for the channel are considered. Finally the decoding of LDPC codes by the belief propagation algorithm is considered, in particular the scheduling of messages passed in the iterative decoder. A knowledge-aided approach is developed based on message reliabilities and residuals to allow fast convergence and significant improvements in error rate performance.

Jul 1, 20144 citations