Decoding Algorithms for Nonbinary LDPC Codes Over GF (q)

In this letter, we address the problem of decoding nonbinary low-density parity-check (LDPC) codes over finite fields GF(q), with reasonable complexity and good performance. In the first part of the letter, we recall the original belief propagation (BP) decoding algorithm and its Fourier domain impl...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on communications Jg. 55; H. 4; S. 633 - 643
Hauptverfasser:	Declercq, D., Fossorier, M.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY IEEE 01.04.2007 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Applied sciences Back propagation Belief propagation Codes Coding, codes Complexity reduction Computational complexity Computer simulation Decoders Decoding EMS Exact sciences and technology Fourier transforms Galois fields Information, signal and communications theory Iterative algorithms iterative decoder Iterative decoding Low density parity check codes Mathematical analysis Medical services nonbinary low-density parity-check (LDPC) codes Offsets Parity check codes Signal and communications theory Studies Table lookup Telecommunications and information theory Tensile stress Performance evaluation Finite field Error rate Correction factor iterative decoder Algorithm Binary code Iterative decoding Implementation nonbinary low-density parity-check (LDPC) codes Simulation Parity check codes Error correcting code Complexity reduction
ISSN:	0090-6778, 1558-0857
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!