Bulletin of Electrical Engineering and Informatics

EXIT chart analysis of regular and irregular LDPC convolutional codes on AWGN channel

Oulfa Laouar, Imed Amamra, Nadir Derouiche

Published Nov 22, 2024• 1 citation

Abstract

Low-density parity-check (LDPC) codes are widely recognized for their excellent forward error correction, near-Shannon-limit performance, and support for high data rates with effective hardware parallelization. Their convolutional counterpart, LDPC convolutional codes (LDPC-CCs), offer additional advantages such as variable codeword lengths, unlimited parity-check matrices, and simpler encoding and decoding. These features make LDPC-CCs particularly suitable for practical implementations with varying channel conditions and data frame sizes. This paper investigates the performance of LDPC-CCs using the extrinsic information transfer (EXIT) chart, a graphical tool for analyzing iterative decoding. EXIT charts visualize mutual information exchange and help predict convergence behavior, estimate performance thresholds, and optimize code design. Starting with the EXIT chart principles for LDPC codes, we derived the mutual information functions for variable and check nodes in regular and irregular LDPC-CC tanner graphs. This involved adapting existing EXIT functions to the periodic parity-check matrix of LDPC-CCs. We compare regular and irregular LDPC-CC constructions, examining the impact of degree distributions and the number of periods in the parity-check matrix on convergence behavior. Our simulations show that irregular LDPC-CCs consistently outperform regular ones, and the EXIT chart analysis confirms that LDPC-CCs demonstrate superior bit error rate (BER) performance compared to equivalent LDPC block codes.

DOI: 10.11591/eei.v14i1.8260

Related papers

On the EXIT chart analysis of low-density parity-check codes

S.R. Kollu, Hamid Jafarkhani

The extrinsic information transfer (EXIT) charts are used to analyze the sum-product decoding algorithm of low-density parity-check (LDPC) codes. The codes are optimized by performing curve fitting on EXIT charts. This technique is developed for binary erasure channels based on area property and is extended to other channels. We show that on channels where the area property is not valid, the curve fitting approach is a sub-optimal method of optimizing for the best convergence threshold. On Gaussian channels, the messages from variable nodes to check nodes are approximated by a symmetric Gaussian distribution. We prove that the check node detector mutual information transfer function derived using this approximation is an upper bound. So the EXIT chart analysis predicts an optimistic value for the convergence threshold. We give an empirical lower bound for the check node detector mutual information transfer function. For few irregular LDPC codes designed for AWGN channel using density evolution, we have examined the accuracy of convergence thresholds predicted by EXIT charts using these bounds for the check node transfer function. The analysis of EXIT chart technique presented in this paper can be extended to other channels for which the distribution of channel messages can be approximated by a symmetric Gaussian/Gaussian mixture distribution.

GlobecomJan 1, 200514 citations

EXIT charts for nonbinary LDPC codes

Yong Li

Non-binary low-density parity-check(LDPC) codes defined over the finite field GF(q=2p) are an extension of binary LDPC codes and have demonstrated improved performance over binary LDPC codes with the same frame length and rate.This paper introduces the principle of extrinsic information transfer(EXIT) charts,analyzes the convergence behavior of non-binary LDPC codes on AWGN channel,and confirms the thresholds of non-binary LDPC codes,which provides the foundation for analysis and design of real communication system using EXIT tool in future work.Simulation result shows that the performance of quaternary LDPC codes is better than that of binary LDPC codes in the same channel,and validates the superiority of using EXIT chart for iterative research.

Journal of Chongqing University of Posts and TelecommunicationsJan 1, 20080 citations

A comparison between BP, log-likelihood and max log-likelihood decoding algorithms of LDPC codes based on EXIT chart and EXIT trajectories methods

A. Refaey-Ahmed, Jean‐Yves Chouinard, Sébastien Roy +1 more

Low density parity check (LDPC) codes are known to achieve a performance very close to the Shannon capacity limit on Additive White Gaussian Noise (AWGN) and erasure channels. The extrinsic information transfer (EXIT) chart is a powerful method for analyzing iteratively decoded codes such as Turbo codes. EXIT charts were introduced as a method for representing how the mutual information between the decoder output and the transmitted bits changes over turbo decoding iterations. It is possible to apply the EXIT chart method to LDPC codes by treating the LDPC decoder as a concatenation of variable and check nodes. However the achieved convergence threshold values obtained with the EXIT charts are (plusmn0.1) dB away from the more precise results derived from the density evolution (DE) method. Subsequently, the EXIT trajectories method was proposed as an improved performance-analysis method for LDPC codes under belief propagation (BP) decoding and achieved more accurate convergence threshold values than the EXIT chart method. In this paper, the EXIT chart and the EXIT trajectories methods are proposed as analysis tools to compare between the BP, log likelihood and max log likelihood decoding algorithms for LDPC codes in terms of convergence thresholds. Furthermore, a comparison between EXIT chart, EXIT trajectories and DE methods is introduced for the mentioned LDPC codes. Simulations and numerical calculations on convergence thresholds for various ensembles of (dv, dc) regular LDPC codes for binary input AWGN channels are performed which results that the BP is the best decoding algorithm for LDPC code followed by the log likelihood and the max log likelihood algorithms, respectively. Also, the EXIT trajectory method yields more accurate results than EXIT charts which come very close to the DE method, while being more convenient numerically as a code research tool than the latter which require many Fourier transform operations.

International Conference on Advanced Technologies for CommunicationsOct 1, 20081 citation

EXIT charts for non-binary LDPC codes

G.J. Byers, Fambirai Takawira

In this paper extrinsic information transfer (EXIT) charts are proposed to design non-binary low-density parity-check (LDPC) codes for the AWGN channel. A new metric is presented to describe the mutual information of the non-binary messages. The a priori information is modelled using a Gaussian mixture distribution. Analytical expressions are given for the EXIT curves of the variable and check node decoders for both regular and irregular LDPC codes. The analytical expressions are shown to agree well with simulation results. Finally, by matching the variable and check node EXIT curves, it is shown that good nonbinary LDPC can be designed for the AWGN channel.

International Conference on CommunicationsAug 16, 200519 citations

Design and Analysis of LDPC Convolutional Codes

Arvind Sridharan

Low-density parity-check (LDPC) block codes invented by Gallager in 1962 achieve exceptional error performance on a wide variety of communication channels. LDPC convolutional codes are the convolutional counterparts of LDPC block codes. This dissertation describes techniques for the design of LDPC convolutional codes, and analyzes their distance properties and iterative decoding convergence thresholds. The construction of time invariant LDPC convolutional codes by unwrapping the Tanner graph of algebraically constructed quasi-cyclic LDPC codes is described. The convolutional codes outperform the quasi-cyclic codes from which they are derived. The design of parity-check matrices for time invariant LDPC convolutional codes by the polynomial extension of a base matrix is proposed. An upper bound on free distance, proving that time invariant LDPC codes are not asymptotically good, is obtained. The Tanner graph is used to describe a pipelined message passing based iterative decoder for LDPC convolutional codes that outputs decoding results continuously. The performance of LDPC block and convolutional codes are compared for fixed decoding parameters like computational complexity, processor complexity, and decoding delay. In each case, the LDPC convolutional code performance is at least as good as that of LDPC block codes. An analog circuit to implement pipelined decoding of LDPC convolutional codes is proposed. The distance properties of a permutation matrix based (time varying) ensemble of (J,K) regular LDPC convolutional codes is investigated. It is proved that these codes (for J > 2) have free distance increasing linearly with constraint length, i.e., they are asymptotically good. Further, the asymptotic free distance to constraint length ratio for the convolutional codes is several times larger than the minimum distance to block length ratio for corresponding LDPC block codes. Iterative decoding of terminated LDPC convolutional codes, based on the ensemble mentioned above, is analyzed, assuming transmission over a binary erasure channel. The structured irregularity of the codes leads to significantly better convergence thresholds compared to corresponding LDPC block codes. At the calculated thresholds, both the bit and block error probability can be made arbitrarily small. The results obtained suggest that the thresholds approach capacity with increasing J.

Sep 15, 202230 citations

Design of irregular LDPC codes with optimized performance-complexity tradeoff

Benjamin Smith, Masoud Ardakani, Wei Yu +1 more

The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a numerical approach for the minimization of decoding complexity for long-block-length irregular low-density parity-check (LDPC) codes. The proposed design methodology is applicable to any binary-input memoryless symmetric channel and any iterative message-passing decoding algorithm with a parallel-update schedule. A key feature of the proposed optimization method is a new complexity measure that incorporates both the number of operations required to carry out a single decoding iteration and the number of iterations required for convergence. This paper shows that the proposed complexity measure can be accurately estimated from a density-evolution and extrinsic-information transfer chart analysis of the code. A sufficient condition is presented for convexity of the complexity measure in the variable edge-degree distribution; when it is not satisfied, numerical experiments nevertheless suggest that the local minimum is unique. The results presented herein show that when the decoding complexity is constrained, the complexity-optimized codes significantly outperform threshold-optimized codes at long block lengths, within the ensemble of irregular codes.

IEEE Transactions on CommunicationsFeb 1, 201068 citations