arXiv:1010.1911

On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes

Iryna Andriyanova, Jean–Pierre Tillich

Published Oct 10, 2010• 0 citations

Abstract

This paper addresses the issue of design of low-rate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which needs to be satisfied when the linear minimum distance is to be ensured. The condition is formulated in terms of degree-1 and degree-2 variable nodes and of low-weight codewords of the underlying code, and it generalizies results known for turbo codes [8] and LDPC codes. Then, we present a new ensemble of low-rate codes, which itself is a subclass of TLDPC codes [4], [5], and which is designed under this necessary condition. The asymptotic analysis of the ensemble shows that its iterative threshold is situated close to the Shannon limit. In addition to the linear minimum distance property, it has a simple structure and enjoys a low decoding complexity and a fast convergence.

DOI: 10.48550/arxiv.1010.1911

Related papers

On the Minimum Distance of Generalized LDPC Codes

Ayoub Otmani, Jean–Pierre Tillich, Iryna Andriyanova

Abstract — We study necessary conditions which have to be satisfied in order to have LDPC codes with linear minimum distance. We give two conditions of this kind in this paper. These conditions are not met for several interesting code families: this shows that they are not asymptotically good. The second one concerns LDPC codes that have a Tanner graph in which there are cycles linking variable nodes of degree 2 together and provides some insight about the combinatorial structure of some low-weight codewords in such a case. When the LDPC code family is obtained from the lifts of a given protograph and if there are such cycles in the protograph, the second condition seems to capture really well the linear minimum distance character of the code. This is illustrated by a code family which is asymptotically good for which there is a cycle linking all the variable nodes of degree 2 together. Surprisingly, this family is only a slight modification of a family which does not satisfy the second condition. I.

Jun 24, 20070 citations

On the Minimum Distance of Generalized LDPC Codes

Ayoub Otmani, Jean–Pierre Tillich, Iryna Andriyanova

We study necessary conditions which have to be satisfied in order to have LDPC codes with linear minimum distance. We give two conditions of this kind in this paper. These conditions are not met for several interesting code families: this shows that they are not asymptotically good. The second one concerns LDPC codes that have a Tanner graph in which there are cycles linking variable nodes of degree 2 together and provides some insight about the combinatorial structure of some low-weight codewords in such a case. When the LDPC code family is obtained from the lifts of a given protograph and if there are such cycles in the protograph, the second condition seems to capture really well the linear minimum distance character of the code. This is illustrated by a code family which is asymptotically good for which there is a cycle linking all the variable nodes of degree 2 together. Surprisingly, this family is only a slight modification of a family which does not satisfy the second condition.

IEEE International Symposium on Information Theory (ISIT)Jun 1, 200710 citations

On the typical minimum distance of protograph-based generalized LDPC codes

Shadi Abu‐Surra, D. Divsalar, W.E. Ryan

Protograph-based generalized LDPC (GLDPC) codes have the advantages of a simple design procedure and highly structured encoders and decoders. Recently, a technique for computing ensemble weight enumerators for GLDPC codes has been published. In the current paper, we investigate the existence of typical minimum distance for protograph-based GLDPC codes. That is, we first upper bound the ensemble weight enumerators for finite-length GLDPC codes based on protographs, and then we consider the sum of weight enumerators. The results allow us to determine whether or not the typical minimum distance in the ensemble grows linearly with codeword length. We provide conditions on the connections of degree-2 variable nodes to constraint nodes (short block codes) to have typical minimum distance. These conditions are related to the minimum distances of the constraint nodes.

IEEE International Symposium on Information Theory (ISIT)Jun 1, 20102 citations

Protograph based LDPC codes with minimum distance linearly growing with block size

D. Divsalar, C. Jones, Samuel J. Dolinar +1 more

We propose several LDPC code constructions that simultaneously achieve good threshold and error floor performance. Minimum distance is shown to grow linearly with block size (similar to regular codes of variable degree at least 3) by considering ensemble average weight enumerators. Our constructions are based on projected graph, or protograph, structures that support high-speed decoder implementations. As with irregular ensembles, our constructions are sensitive to the proportion of degree-2 variable nodes. A code with too few such nodes tends to have an iterative decoding threshold that is far from the capacity threshold. A code with too many such nodes tends to not exhibit a minimum distance that grows linearly in block length. In this paper we also show that preceding can be used to lower the threshold of regular LDPC codes. The decoding thresholds of the proposed codes, which have linearly increasing minimum distance in block size, outperform that of regular LDPC codes. Furthermore, a family of low to high rate codes, with thresholds that adhere closely to their respective channel capacity thresholds, is presented. Simulation results for a few example codes show that the proposed codes have low error floors as well as good threshold SNR performance.

GlobecomJan 1, 2005120 citations

Ensemble Weight Enumerators for Protograph LDPC Codes

D. Divsalar

Recently, LDPC codes with projected graph, or protograph structures have been proposed. In this paper, finite length ensemble weight enumerators for LDPC codes with protograph structures are obtained. Asymptotic results are derived as the block size goes to infinity. In particular, we are interested in obtaining ensemble average weight enumerators for protograph LDPC codes which have typical minimum distance that grows linearly with block size. As with irregular ensembles, linear minimum distance property is sensitive to the proportion of degree-2 variable nodes. In this paper, the derived results on ensemble weight enumerators show that linear minimum distance condition on degree distribution of unstructured irregular LDPC codes is a sufficient but not a necessary condition for protograph LDPC codes

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

On the Minimum Distance of Non Binary LDPC Codes

Rethnakaran Pulikkoonattu

Minimum distance is an important parameter of a linear error correcting code. For improved performance of binary Low Density Parity Check (LDPC) codes, we need to have the minimum distance grow fast with n, the codelength. However, the best we can hope for is a linear growth in dmin with n. For binary LDPC codes, the necessary and sufficient conditions on the LDPC ensemble parameters, to ensure linear growth of minimum distance is well established. In the case of non-binary LDPC codes, the structure of logarithmic weight codewords is different from that of binary codes. We have carried out a preliminary study on the logarithmic bound on the the minimum distance of non-binary LDPC code ensembles. In particular, we have investigated certain configurations which would lead to low weight codewords. A set of simulations are performed to identify some of these configurations. Finally, we have provided a bound on the logarithmic minimum distance of nonbinary codes, using a strategy similar to the girth bound for binary codes. This bound has the same asymptotic behaviour as that of binary codes.

arXiv:0906.2061Jun 11, 20090 citations