A message-passing decoding algorithm for q-ary LDPC codes with low-complexity

This paper presents a novel low-complexity iterative reliability-based decoding algorithm for LDPC codes over q-ary finite fields. This proposed algorithm has low complexity and hence provides an effective trade-off between error performance and decoding complexity compared to q-ary sum product algo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2010 International Symposium on Information Theory and Its Applications S. 501 - 506
Hauptverfasser: Chao-Yu Chen, Qin Huang, Chi-chao Chao, Shu Lin
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.10.2010
Schlagworte:
Complexity theory
Decoding
Iterative decoding
Null space
Reliability
Variable speed drives
ISBN:9781424460168, 1424460166
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper presents a novel low-complexity iterative reliability-based decoding algorithm for LDPC codes over q-ary finite fields. This proposed algorithm has low complexity and hence provides an effective trade-off between error performance and decoding complexity compared to q-ary sum product algorithm. This decoding algorithm is devised based on simple orthogonal concept of one-step majority-logic decoding for q-ary linear block codes. It requires only integer and finite field operations and converges very fast in decoding. It is particularly effective for decoding LDPC codes constructed based on finite geometries and finite fields.
ISBN:9781424460168
1424460166
DOI:10.1109/ISITA.2010.5650154