Sciweavers

Share
CORR
2010
Springer

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

8 years 8 months ago
Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel
In this paper, we show that over the binary erasure channel, Quasi-Cyclic LDPC codes can efficiently accommodate the hybrid iterative/ML decoding. We demonstrate that the quasicyclic 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 k, where k is the number of source symbols. I. PROBLEM POSITION AND RELATED WORKS In modern communication systems, data is often transmitted as independent packets. These packets can be subject to losses (erasures) caused by bad channel conditions, intermittent connectivity, congested routers, or failures. If solutions based on the retransmission of lost packets are possible (ARQ, Au...
Mathieu Cunche, Valentin Savin, Vincent Roca
Added 01 Mar 2011
Updated 01 Mar 2011
Type Journal
Year 2010
Where CORR
Authors Mathieu Cunche, Valentin Savin, Vincent Roca
Comments (0)
books