IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)

Constructing Quasi-Cyclic LDPC codes Using a Search Algorithm

Gabofetswe Malema

Published Dec 1, 2007• 3 citations

Abstract

This article presents a search algorithm for constructing regular and irregular quasi-cyclic LDPC codes. Code rows and columns are divided into j (column weight) and k (row-weight) or more groups respectively. Rows or columns in a group are connected to the same group and in order of appearance. Grouping of rows and columns forms sub-matrices. The sequential row-column connections order creates a cyclic structure in sub-matrices. The row-column constraint is observed to avoid four-cycles. The proposed algorithm is flexible compared to other methods. It obtains codes over a wide range of girths, rates and lengths. Bit-error rate simulations show that obtained codes have good performance with randomly searched codes performing better that sequentially searched codes.

DOI: 10.1109/isspit.2007.4458089

Related papers

Quasi-Cyclic LDPC Codes of Column-Weight Two Using a Search Algorithm

Gabofetswe Malema, Michael John Liebelt

This article introduces a search algorithm for constructing quasi-cyclic LDPC codes of column-weight two. To obtain a submatrix structure, rows are divided into groups of equal sizes. Rows in a group are connected in their numerical order to obtain a cyclic structure. Two rows forming a column must be at a specified distance from each other to obtain a given girth. The search for rows satisfying the distance is done sequentially or randomly. Using the proposed algorithm regular and irregular column-weight-two codes are obtained over a wide range of girths, rates, and lengths. The algorithm, which has a complexity linear with respect to the number of rows, provides an easy and fast way to construct quasi-cyclic LDPC codes. Constructed codes show good bit-error rate performance with randomly shifted codes performing better than sequentially shifted ones.

EURASIP Journal on Advances in Signal ProcessingApr 19, 200712 citations

Constructing Quasi-Cyclic LDPCcodesUsinga Search Algorithm

Gabofetswe Malema

Thisarticle presents asearch algorithm forcon-proposed algorithm withsomeobtained codessizes, girths structing regular andirregular quasi-cyclic LDPCcodes. Code andrates. Section IIIevaluates bit-error rateperformances rowsandcolumns aredivided intoj (column weight) andk (row-weight) ormoregroupsrespectively. Rowsorcolumns in a groupareconnected tothesamegroupandinorderof Section IV. appearance. Grouping ofrowsandcolumns forms sub-matrices.II. PROPOSEDQC-LDPCSEARCHALGORITHM Thesequential row-column connections ordercreates a cyclic structure insub-matrices. Therow-column constraint isobservedIn(8)quasi-cyclic column-weight twocodesareconstructed toavoid four-cycles. Theproposed algorithm isflexible comparedbasedonadistance graph representation. A desired girth g,is toother methods. Itobtains codes overawiderangeofgirths, obtained bysearching andconnecting tworowsthatareata rates andlengths. Bit-error ratesimulations showthatobtained codeshavegoodperformance withrandomly searched codesdistance ofatleastg Weextend thesearch algorithmiproposed performing better thatsequentially searched codes. in(8)toconstruct QC-LDPCwithcolumn-weights higher than two.LDPCcoderowsandcolumns aredivided intogroups

Jan 1, 20070 citations

Very Large Girth Column-weight two Quasi-cyclic LDPC Codes

Gabofetswe Malema, Michael John Liebelt

In this paper a modified bit-filling algorithm is used for constructing column-weight two quasi-cyclic low-density parity-check codes with large girths. Code rows are divided into groups. A column is connected to two rows from different groups, which are apart by at least a specified minimum length. Rows that meet the minimum length are searched sequentially. Group rows are connected to consecutive columns resulting in a cyclic structure in the code matrix. Larger codes can be obtained by using larger row groups. Compared to other methods, the algorithm provides an easy and fast way to construct codes of a wide range of rates, girths and lengths. Constructed codes show good bit error rate performance. They are also easily implementable in hardware compared to those obtained using the original bit filling algorithm

Jan 1, 20061 citation

Flexible Construction of High-Girth QC-LDPC Codes

Gabofetswe Malema

This article presents a highly flexible method for constructing high-girth quasi-cyclic low-density parity-check (QC-LDPC) codes. The proposed algorithm constructs a Tanner graph formed by connecting groups of rows (check nodes) and columns (variable nodes) of the constructed code. To obtain a sub-matrix structure, rows and columns are divided into groups of equal sizes. Rows and columns in a group are connected in their numerical (positional) order to obtain a cyclic structure. Connected rows and columns must satisfy the desired minimum cycle length. We present conditions that guarantee desired girths. The proposed algorithm is by far more flexible in constructing a wide range (rates and lengths) of regular and irregular QC-LDPC codes compared to existing methods. The algorithm, which has linear complexity with respect to the number of rows or columns, provides an easy and fast way to construct QC-LDPC codes. Constructed codes show good bit error rate performances.

International journal of computer science and applicationsAug 1, 20122 citations

Generalized Construction of Quasi-Cyclic Regular LDPC Codes Based on Permutation Matrices

E.M. Gabidulin, Abdolhosein Moinian, Bahram Honary

A new approach is proposed for constructing regular low-density parity-check (LDPC) codes based on tensor product of matrices. In this paper, first a general construction method of regular LDPC codes exploiting permutation matrices is described. Constructed codes have a quasi-cyclic structure with no short cycles of length 4 in their Tanner graph, hence simple encoding while maintaining good performance is achieved. The paper also demonstrates a generalized design, which covers a large family of LDPC codes and number of other construction methods. The new generalized LDPC codes are defined by a small number of parameters and cover a large set of code lengths and rates. Using these codes, LDPC matrices of any column weight and row weight can be constructed. Performance of these codes under iterative decoding compares well with other well-structured as well as random LDPC codes

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

A graphical model and search algorithm based Quasi-Cyclic Low-Density Parity-Check codes scheme

Jun Lin, Peng Jia Shi, Yan Ge +2 more

A constant challenge in Quasi-Cyclic Low-Density Parity-Check (QC-LDP-C) codes lies on flexible code lengths and rates, conditioned by good error performance. This paper presents an optimal construction method of QC-LDPC codes on the basis of graphical model and search algorithm. Utilizing the proposed scheme, we can construct adaptable QC-LDPC codes whose girths are no less than 12, and column weights are 3. Comparing with any other QC-LDPC code construction approach, this method is much more flexible in block length and block rate. Furthermore, when construction parameters are selected, regular QC-LDPC codes can be constructed easily. Simulation results indicate that LDPC codes proposed in the method perform similarly to the classic Progressive Edge-Growth (PEG) based LDPC codes but outweigh in convenience of implementation and applications. © 2013 ICIC International.

Jan 1, 20130 citations