40 research outputs found
Hierarchical and High-Girth QC LDPC Codes
We present a general approach to designing capacity-approaching high-girth
low-density parity-check (LDPC) codes that are friendly to hardware
implementation. Our methodology starts by defining a new class of
"hierarchical" quasi-cyclic (HQC) LDPC codes that generalizes the structure of
quasi-cyclic (QC) LDPC codes. Whereas the parity check matrices of QC LDPC
codes are composed of circulant sub-matrices, those of HQC LDPC codes are
composed of a hierarchy of circulant sub-matrices that are in turn constructed
from circulant sub-matrices, and so on, through some number of levels. We show
how to map any class of codes defined using a protograph into a family of HQC
LDPC codes. Next, we present a girth-maximizing algorithm that optimizes the
degrees of freedom within the family of codes to yield a high-girth HQC LDPC
code. Finally, we discuss how certain characteristics of a code protograph will
lead to inevitable short cycles, and show that these short cycles can be
eliminated using a "squashing" procedure that results in a high-girth QC LDPC
code, although not a hierarchical one. We illustrate our approach with designed
examples of girth-10 QC LDPC codes obtained from protographs of one-sided
spatially-coupled codes.Comment: Submitted to IEEE Transactions on Information THeor
An Efficient Algorithm for Counting Cycles in QC and APM LDPC Codes
In this paper, a new method is given for counting cycles in the Tanner graph
of a (Type-I) quasi-cyclic (QC) low-density parity-check (LDPC) code which the
complexity mainly is dependent on the base matrix, independent from the
CPM-size of the constructed code. Interestingly, for large CPM-sizes, in
comparison of the existing methods, this algorithm is the first approach which
efficiently counts the cycles in the Tanner graphs of QC-LDPC codes. In fact,
the algorithm recursively counts the cycles in the parity-check matrix
column-by-column by finding all non-isomorph tailless backtrackless closed
(TBC) walks in the base graph and enumerating theoretically their corresponding
cycles in the same equivalent class. Moreover, this approach can be modified in
few steps to find the cycle distributions of a class of LDPC codes based on
Affine permutation matrices (APM-LDPC codes). Interestingly, unlike the
existing methods which count the cycles up to , where is the girth,
the proposed algorithm can be used to enumerate the cycles of arbitrary length
in the Tanner graph. Moreover, the proposed cycle searching algorithm improves
upon various previously known methods, in terms of computational complexity and
memory requirements.Comment: 18 pages, 4 figure
New Classes of Partial Geometries and Their Associated LDPC Codes
The use of partial geometries to construct parity-check matrices for LDPC
codes has resulted in the design of successful codes with a probability of
error close to the Shannon capacity at bit error rates down to . Such
considerations have motivated this further investigation. A new and simple
construction of a type of partial geometries with quasi-cyclic structure is
given and their properties are investigated. The trapping sets of the partial
geometry codes were considered previously using the geometric aspects of the
underlying structure to derive information on the size of allowable trapping
sets. This topic is further considered here. Finally, there is a natural
relationship between partial geometries and strongly regular graphs. The
eigenvalues of the adjacency matrices of such graphs are well known and it is
of interest to determine if any of the Tanner graphs derived from the partial
geometries are good expanders for certain parameter sets, since it can be
argued that codes with good geometric and expansion properties might perform
well under message-passing decoding.Comment: 34 pages with single column, 6 figure
Algebraic Design and Implementation of Protograph Codes using Non-Commuting Permutation Matrices
Random lifts of graphs, or equivalently, random permutation matrices, have been used to construct good families of codes known as protograph codes. An algebraic analog of this approach was recently presented using voltage graphs, and it was shown that many existing algebraic constructions of graph-based codes that use commuting permutation matrices may be seen as special cases of voltage graph codes. Voltage graphs are graphs that have an element of a finite group assigned to each edge, and the assignment determines a specific lift of the graph. In this paper we discuss how assignments of permutation group elements to the edges of a base graph affect the properties of the lifted graph and corresponding codes, and present a construction method of LDPC code ensembles based on noncommuting permutation matrices. We also show encoder and decoder implementations for these codes
Algebraic Design and Implementation of Protograph Codes using Non-Commuting Permutation Matrices
Random lifts of graphs, or equivalently, random permutation matrices, have been used to construct good families of codes known as protograph codes. An algebraic analog of this approach was recently presented using voltage graphs, and it was shown that many existing algebraic constructions of graph-based codes that use commuting permutation matrices may be seen as special cases of voltage graph codes. Voltage graphs are graphs that have an element of a finite group assigned to each edge, and the assignment determines a specific lift of the graph. In this paper we discuss how assignments of permutation group elements to the edges of a base graph affect the properties of the lifted graph and corresponding codes, and present a construction method of LDPC code ensembles based on noncommuting permutation matrices. We also show encoder and decoder implementations for these codes
Deriving Good LDPC Convolutional Codes from LDPC Block Codes
Low-density parity-check (LDPC) convolutional codes are capable of achieving
excellent performance with low encoding and decoding complexity. In this paper
we discuss several graph-cover-based methods for deriving families of
time-invariant and time-varying LDPC convolutional codes from LDPC block codes
and show how earlier proposed LDPC convolutional code constructions can be
presented within this framework. Some of the constructed convolutional codes
significantly outperform the underlying LDPC block codes. We investigate some
possible reasons for this "convolutional gain," and we also discuss the ---
mostly moderate --- decoder cost increase that is incurred by going from LDPC
block to LDPC convolutional codes.Comment: Submitted to IEEE Transactions on Information Theory, April 2010;
revised August 2010, revised November 2010 (essentially final version).
(Besides many small changes, the first and second revised versions contain
corrected entries in Tables I and II.