International Conference on Telecommunications

Designing near Shannon limit LDPC codes using particle swarm optimization algorithm

Fatma A. Newagy, Yasmine A. H. Fahmy, Magdi S. El-Soudani

Published Jan 1, 2007• 5 citations

Abstract

This paper presents a new design methodology/process for low-density parity-check codes (LDPC). To minimize the gap to Shannon limit, the particle swarm optimizer is applied to optimize the variable and check node degree distribution lambda and p respectively in case of irregular LDPC codes. discrete fast density evolution (FDE) is used (as the analysis technique) to compute the threshold value of LDPC code and the Shannon limit is evaluated based on Butman and McEliece formula. The results conducted show that, our proposed distributions with low degrees of (lambda, p) outperform other comparable distributions.

DOI: 10.1109/ictmicc.2007.4448612

Related papers

Design of degree sequence for irregular LDPC codes on PSO

Linhua Ma

The algorithm of threshold calculation for low-density parity-check(LDPC) codes is investigated.The design steps of degree-sequence which has higher threshold and the process of constrained problem are discussed in detail.A method of degree-sequence design for LDPC on particle swarm optimization(PSO) is presented.The analysis and comparison of estimation result and some capacity-approaching degree-sequences are also given.

Systems engineering and electronicsJan 1, 20100 citations

Discrete density evolution and LDPC codes designwith asymmetric channels

涛袁, 征马, 琦珂庞 +1 more

To design low-density parity-check (LDPC) codes with asymmetric channels and analyze their performance, an achievable asymmetric discrete density evolution method is proposed, which is based on offset min-sum decoding. First, the iterative formula of low-complexity asymmetric channel discrete density evolution is derived by means of combinatorics, difference method and the binomial theorem. The iterative formula is applied to further optimize the design of the LDPC codes using the offset min-sum decoding, and the optimal degree distributions and performance of the LDPC codes under different quantization ranges and step sizes are obtained under the asymmetric channel. Finally, the optimal offset values under high-precision quantization are obtained. The results show that under the asymmetric channel, the complexity of the proposed asymmetric density evolution method based on the offset min-sum decoding is reduced by an order of magnitude than that using the original method. For a fixed code rate, the smaller the variable node degree of the regular codes, the better the performance and the smaller the optimal offset value. For irregular LDPC codes, the optimal degree distributions and offset values are determined according to the differential evolution algorithm. For a fixed code rate, the larger the maximum variable node degree, the better the performance of irregular codes.

Scientia Sinica InformationisAug 29, 20221 citation

Studies on Lowering the Error Floors of Finite Length LDPC codes

Huanlin Li

Low-density parity-check (LDPC) codes can approach the Shannon limit performance closely, and are becoming one of the most promising channel codes in the Error Control Coding area.The performance of an LDPC code with given length is mainly affected by the sizes of some combinatorial characteristics of its corresponding bipartite graph and the distribution of variable degrees and check node degrees.With the help of the density evolution algorithm, randomly designed LDPC codes, with carefully chosen degree distribution pairs, have been shown to achieve better Shannon capacity performance than their regular counterparts when decoded using the iterative belief propagation (BP) decoding algorithm.However, regular LDPC codes outperform their irregular counterparts in term of their error floors.Therefore, construction of LDPC codes which have both attractive error rate performance and low error floor performance has become an attractive topic.Currently, optimization of variable node degree distribution and check node degree distribution for an LDPC code with given length, which could help the code to achieve good Shannon limit performance, has been extensively studied.In this dissertation, we demonstrate some approaches of improving the error floor performance for a given LDPC code with desired degree distribution pair.The contribution mainly includes three parts.In the first part, the relationship between cycles and unfavorable combinatorial

Jan 1, 20110 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

On the design of LDPC code ensembles for BIAWGN channels

Hamid Saeedi, Amir H. Banihashemi

Existing design methods for irregular Low-Density Parity-Check (LDPC) codes over the additive white Gaussian noise channel are based on using asymptotic analysis tools such as density evolution in an optimization process. Such a process is computationally expensive particularly when a large number of constituent variable node degrees are involved in the design. In this paper, we propose a systematic approach for the design of irregular LDPC codes. The proposed method, which is based on a pre-computed upper bound on the fraction of edges connected to variable nodes of degree 3, is considerably less complex than the conventional optimization approach. Through a number of examples, we demonstrate that using our method, ensembles with performance very close to those devised based on optimization, can be designed. In addition to having very good performance, the number of constituent variable node degrees in the designed ensembles is only three or four. This, in some cases, is much smaller than the corresponding number for optimization-based designs with similar performance.

IEEE Transactions on CommunicationsMay 1, 20108 citations

Statistical-Based Density Evolution Algorithm for Nonbinary Low-Density Parity-Check Codes

Jie Wu, Minjian Zhao, Jie Zhong +2 more

A statistical-based density evolution algorithm is proposed for nonbinary low-density parity-check (LDPC) codes. It is applicable to both regular and irregular codes under study. The algorithm proposed serves as a tool to analyze the performance limit for iterative decoding of nonbinary LDPC codes, which in turn guides code design. Specifically, it provides approximated evaluations of convergence thresholds for codes given specific degree distributions. It is shown that, for a class of quasi-cyclic (QC) structured extended irregular repeat-accumulate (SeIRA) nonbinary LDPC codes, degree distributions can be optimized via the algorithm proposed. Simulation results exhibit that the nonbinary LDPC codes designed outperform the optimized binary LDPC codes on the AWGN channel with similar code length and rate in terms of bits. Performance gap between the binary and nonbinary LDPC codes is larger in the scenario of higher order modulation.

IEEE Vehicular Technology ConferenceSep 1, 20111 citation