Quasi-cyclic LDPC codes of column-weight two using a search algorithm

Authors:
Gabofetswe Malema;Michael Liebelt
Affiliations:
School of Electrical and Electronic Engineering, The University of Adelaide, Adelaide, SA, Australia;School of Electrical and Electronic Engineering, The University of Adelaide, Adelaide, SA, Australia
Venue:
EURASIP Journal on Applied Signal Processing
Year:
2007

Citing 6
Cited 2

Some Classes of Quasi-Cyclic LDPC Codes: Properties and Efficient Encoding Method*This paper was presented in part at the 26th Symposium on Information Theory and Its Applications, Higashiura, Hyogo, Japan, December 15--18, 2003 and at IEEE International Symposium on Information Theory, Chicago, IL USA, June 27--July 2, 2004.

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Fast generation of regular graphs and construction of cages

Journal of Graph Theory
Low-density parity-check codes based on finite geometries: a rediscovery and new results

IEEE Transactions on Information Theory
Quasicyclic low-density parity-check codes from circulant permutation matrices

IEEE Transactions on Information Theory
Regular and irregular progressive edge-growth tanner graphs

IEEE Transactions on Information Theory
Algebraic construction of sparse matrices with large girth

IEEE Transactions on Information Theory

Short quasi-cyclic LDPC codes from convolutional codes

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Graph-based convolutional and block LDPC codes

Problems of Information Transmission

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.