A computationally efficient selective node updating scheme for decoding of LDPC codes

In this paper, we introduce a computationally efficient selective node update algorithm for the decoding of low-density parity check codes. Unlike the standard sum-product algorithm, where all bit and check nodes are updated at each decoding iteration, the developed algorithm only updates unreliable...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Cavus, E., Daneshrad, B.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Bit error rate Computer architecture Energy consumption Hardware Iterative decoding Parity check codes Performance gain Performance loss Standards development Sum product algorithm
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!