Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel

Details Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel

2010-04-29

arxiv.org/abs/1004.5217v1

Computer Science

Information Theory

6 pages, ISITA10

Scientific paper

In this paper, we show that Quasi-Cyclic LDPC codes can efficiently accommodate the hybrid iterative/ML decoding over the binary erasure channel. We demonstrate that the quasi-cyclic structure of the parity-check matrix can be advantageously used in order to significantly reduce the complexity of the ML decoding. This is achieved by a simple row/column permutation that transforms a QC matrix into a pseudo-band form. Based on this approach, we propose a class of QC-LDPC codes with almost ideal error correction performance under the ML decoding, while the required number of row/symbol operations scales as $k\sqrt{k}$, where $k$ is the number of source symbols.

Affiliated with

Also associated with

No associations

Rating

Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel 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 Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-284653