A Novel Graph Expansion and a Decoding Algorithm for NB-LDPC Codes

Non-binary low-density parity-check (NB-LDPC) codes are known to offer several advantages over their binary counterparts, but the higher complexity, and the resource-hungry nature of decoding algorithms have so far restricted their practical usage. In this paper, we propose a new decoding algorithm...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on communications 2020-03, Vol.68 (3), p.1358-1369
Hauptverfasser:	Wijekoon, V. B., Viterbo, Emanuele, Hong, Yi, Micheloni, Rino, Marelli, Alessia
Format:	Artikel
Sprache:	eng
Schlagworte:	Additives Algorithms Binary codes Binary system Codes Complexity Complexity theory Computer simulation Decoding Error correcting codes Fields (mathematics) graph expansion Hardware Iterative decoding Low density parity check codes Non-binary LDPC codes Simulation
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!