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

Abstract : 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 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 √k, where k is the number of source symbols.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00506039
Contributor : Mathieu Cunche <>
Submitted on : Tuesday, July 27, 2010 - 3:36:21 AM
Last modification on : Monday, February 25, 2019 - 4:34:17 PM
Long-term archiving on : Tuesday, October 23, 2012 - 11:25:49 AM

File

QC_LDPC_over_BEC_camera-ready_...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00506039, version 1

Collections

Citation

Mathieu Cunche, Valentin Savin, Vincent Roca. Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel. IEEE International Symposium on Information Theory and its Applications (ISITA 2010), Oct 2010, Taichung, Taiwan. pp.Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel. ⟨hal-00506039⟩

Share

Metrics

Record views

677

Files downloads

608