Quasi-Cyclic Asymptotically Regular LDPC Codes

Details Quasi-Cyclic Asymptotically Regular LDPC Codes Quasi-Cyclic Asymptotically Regular LDPC Codes

2010-07-02

arxiv.org/abs/1007.0404v1

Computer Science

Information Theory

To be presented at the 2010 IEEE Information Theory Workshop, Dublin, Ireland

Scientific paper

Families of "asymptotically regular" LDPC block code ensembles can be formed by terminating (J,K)-regular protograph-based LDPC convolutional codes. By varying the termination length, we obtain a large selection of LDPC block code ensembles with varying code rates, minimum distance that grows linearly with block length, and capacity approaching iterative decoding thresholds, despite the fact that the terminated ensembles are almost regular. In this paper, we investigate the properties of the quasi-cyclic (QC) members of such an ensemble. We show that an upper bound on the minimum Hamming distance of members of the QC sub-ensemble can be improved by careful choice of the component protographs used in the code construction. Further, we show that the upper bound on the minimum distance can be improved by using arrays of circulants in a graph cover of the protograph.

Affiliated with

Also associated with

No associations

Rating

Quasi-Cyclic Asymptotically Regular LDPC Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quasi-Cyclic Asymptotically Regular LDPC Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quasi-Cyclic Asymptotically Regular LDPC Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-727568