Signal Processing and Communications Applications Conference (SIU)

On the design of a superior irregular LDPC code

Tolga Mataracioglu, Ümit Aygölü

Published Apr 1, 2008• 1 citation

Abstract

In this paper, low density parity check (LDPC) codes are considered. Design techniques are examined and new LDPC codes with improved error performance are proposed for irregular LDPC codes. Especially for BPSK modulation and AWGN channel, superior LDPC codes are successfully designed for R = 0.5 and N = 1000. For the designed superior irregular codes, it can be said that not only the performance of the codes is good when the code block length goes to infinity, but also they approach to the channel capacity and for code rate R = 0.5, they perform better than their counterparts given in the literature, when the code block length is finite (N = 1000). For irregular codes, when the degree of the bit node that possess the maximum number of branches is large, then that code approaches to the channel capacity. During the optimization of the encoder and decoder blocks, a combination of differential evolution technique, bit filling and message passing algorithms are considered to reach superior codes. The best superior code proposed in the paper is an irregular LDPC code with rate R = 0.5 which is only 0.02 dB away from the channel capacity.

DOI: 10.1109/siu.2008.4632538

Related papers

Performance analysis of finite-length LDPC codes

Yingjian Xue, Haige Xiang

In this paper, we are concerned with the finite-length analysis of low-density parity-check (LDPC) codes when used over additive white Gaussian noise (AWGN) channels. We present the iterative decoding algorithm of LDPC codes, and we also discuss the encoding methods and the bipartite graph representation of LDPC codes ensemble. Finite-length LDPC code performances are investigated, and the influence of cycle is pointed out. Simulation results show that irregular LDPC codes with variable and check node degree distribution optimized for infinite-length codes are not optimal for finite-length LDPC codes, and the error patterns of both regular and irregular codes are investigated as an effort to improve the performance and design methodology of finite-length LDPC codes.

IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)Jan 1, 20035 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

Construction of irregular LDPC codes based on Balanced Incomplete Block Designs

Siddarama R. Patil, Sant Saran Pathak

In this paper, we present a method to design irregular structured low-density parity-check (LDPC) codes based on balanced incomplete block designs (BIBD). The problem of designing irregular structured LDPC codes that have good overall error performance for a wide range of code rates and block sizes with attractive storage requirements is attempted. The proposed codes are well structured and unlike random codes can lend themselves to a very low-complexity implementation. The codes constructed by this method have the girth at least 6 and they perform well with the sum-product iterative decoding algorithm. Furthermore, the codes are compared with known random LDPC codes, in order to assess their relative achievable performance. The proposed LDPC codes demonstrate performance that is better than an average random LDPC code of similar block length, code rate and parity check matrix sparsity.

IEEE International Conference on Industrial and Information Systems (ICIIS)Jan 1, 20070 citations

On the Design of Block Lengths for Irregular LDPC Codes Based on the Maximum Variable Degree

Kyuhyuk Chung

This paper presents the design of block lengths for irregular low-density parity-check (LDPC) codes based on the maximum variable degree d v,max . To design a block length, the performance degradation of belief-propagation (BP) decoding performance from upper bounds on the maximum likelihood (ML) decoding performance is used as an important factor. Since for large block lengths, the performance of irregular LDPC codes is very close to the Shannon limit, we focus on moderate block lengths (5×10²≤N≤4×10³). Given degree distributions, the purpose of our paper is to find proper block lengths based on the maximum variable degree d v,max . We also present some simulation results which show how a block length can be optimized.

한국통신학회논문지Nov 1, 20100 citations

On Lowering the Error Floor of Short-to-Medium Block Length Irregular Low Density Parity Check Codes

Umar-Faruk Abdu-Aguye

Gallager proposed and developed low density parity check (LDPC) codes in the early 1960s. LDPC codes were rediscovered in the early 1990s and shown to be capacity approaching over the additive white Gaussian noise (AWGN) channel. Subsequently, density evolution (DE) optimized symbol node degree distributions were used to significantly improve the decoding performance of short to medium length irregular LDPC codes. Currently, the short to medium length LDPC codes with the lowest error floor are DE optimized irregular LDPC codes constructed using progressive edge growth (PEG) algorithm modifications which are designed to increase the approximate cycle extrinsic message degrees (ACE) in the LDPC code graphs constructed. The aim of the present work is to find efficient means to improve on the error floor performance published for short to medium length irregular LDPC codes over AWGN channels in the literature. An efficient algorithm for determining the girth and ACE distributions in short to medium length LDPC code Tanner graphs has been proposed. A cyclic PEG (CPEG) algorithm which uses an edge connections sequence that results in LDPC codes with improved girth and ACE distributions is presented. LDPC codes with DE optimized/’good’ degree distributions which have larger minimum distances and stopping distances than previously published for LDPC codes of similar length and rate have been found. It is shown that increasing the minimum distance of LDPC codes lowers their error floor performance over AWGN channels; however, there are threshold minimum distances values above which there is no further lowering of the error floor performance. A minimum local girth (edge skipping) (MLG (ES)) PEG algorithm is presented; the algorithm controls the minimum local girth (global girth) connected in the Tanner graphs of LDPC codes constructed by forfeiting some edge connections. A technique for constructing optimal low correlated edge density (OED) LDPC codes based on modified DE optimized symbol node degree distributions and the MLG (ES) PEG algorithm modification is presented. OED rate-½ (n, k)=(512, 256) LDPC codes have been shown to have lower error floor over the AWGN channel than previously published for LDPC codes of similar length and rate. Similarly, consequent to an improved symbol node degree distribution, rate ½ (n, k)=(1024, 512) LDPC codes have been shown to have lower error floor over the AWGN channel than previously published for LDPC codes of similar length and rate. An improved BP/SPA (IBP/SPA) decoder, obtained by making two simple modifications to the standard BP/SPA decoder, has been shown to result in an unprecedented generalized improvement in the performance of short to medium length irregular LDPC codes under iterative message passing decoding. The superiority of the Slepian Wolf distributed source coding model over other distributed source coding models based on LDPC codes has been shown.

Jan 1, 20180 citations

A More Accurate One-Dimensional Analysis and Design of Irregular LDPC Codes

Masoud Ardakani, Frank R. Kschischang

We introduce a new one-dimensional (1-D) analysis of low-density parity-check (LDPC) codes on additive white Gaussian noise channels which is significantly more accurate than similar 1-D methods. Our method assumes a Gaussian distribution in message-passing decoding only for messages from variable nodes to check nodes. Compared to existing work, which makes a Gaussian assumption both for messages from check nodes and from variable nodes, our method offers a significantly more accurate estimate of convergence behavior and threshold of convergence. Similar to previous work, the problem of designing irregular LDPC codes reduces to a linear programming problem. However, our method allows irregular code design in a wider range of rates without any limit on the maximum variable-node degree. We use our method to design irregular LDPC codes with rates greater than 1/4 that perform within a few hundredths of a decibel from the Shannon limit. The designed codes perform almost as well as codes designed by density evolution.

IEEE Transactions on CommunicationsDec 1, 2004119 citations