FFT-Based BP Decoding of General LDPC Codes Over Abelian Groups

FFT-Based BP Decoding of General LDPC Codes Over Abelian Groups

We introduce a wide class of low-density parity-check (LDPC) codes, large enough to include LDPC codes over finite fields, rings, or groups, as well as some nonlinear codes. A belief-propagation decoding procedure with the same complexity as for the decoding of LDPC codes over finite fields is also...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on communications 2007-04, Vol.55 (4), p.644-649
Hauptverfasser: Goupil, A., Colas, M., Gelle, G., Declercq, D.
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Back propagation
Belief propagation
Coding, codes
Communications Society
Complexity
Computer Science
Decoding
Encoding
Equations
Exact sciences and technology
Fourier transform (FT)
Galois fields
generalized low-density parity-check (LDPC) codes
group
Information Theory
Information, signal and communications theory
Linear code
Mathematical analysis
Mathematics
Nonlinearity
Parity check codes
Signal and communications theory
Telecommunications and information theory
Turbo codes
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We introduce a wide class of low-density parity-check (LDPC) codes, large enough to include LDPC codes over finite fields, rings, or groups, as well as some nonlinear codes. A belief-propagation decoding procedure with the same complexity as for the decoding of LDPC codes over finite fields is also presented. Moreover, an encoding procedure is developed
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2007.894089