Non-binary LDPC decoding using truncated messages in the Walsh-Hadamard domain
The Extended Min-Sum (EMS) algorithm for non-binary low-density parity-check (LDPC) defined over an alphabet of size $q$ operates on truncated messages of length $q'$ to achieve a complexity of the order $q'^2$. In contrast, Walsh-Hadamard (WH) transform based iterative decoders achieve a...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | The Extended Min-Sum (EMS) algorithm for non-binary low-density parity-check
(LDPC) defined over an alphabet of size $q$ operates on truncated messages of
length $q'$ to achieve a complexity of the order $q'^2$. In contrast,
Walsh-Hadamard (WH) transform based iterative decoders achieve a complexity of
the order $q\log q$, which is much larger for $q' |
|---|---|
| DOI: | 10.48550/arxiv.1407.4342 |