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 quasi-cyclic structure of the parity-check matrix can be advantageously used in order to significantly reduce the complexity of t...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Cunche, M, Savin, V, Roca, V
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Complexity theory Helium Iron Iterative decoding Maximum likelihood decoding
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!