A Stopping Criterion for Low-Density Parity-Check Codes

We propose a new stopping criterion for decoding LDPC codes which consists of a measure of decoder behaviors and a decision rule to predict decoding failure. We will show that the proposed measure, the number of satisfied check nodes, does not need (or minimizes) additional complexity, and the decis...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEICE Transactions on Communications 2008/04/01, Vol.E91.B(4), pp.1145-1148
Hauptverfasser:	SHIN, Donghyuk, HA, Jeongseok, HEO, Kyoungwoo, LEE, Hyuckjae
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences belief propagation Channels Coding, codes Complexity Criteria Decoders Decoding Exact sciences and technology Failure Information, signal and communications theory LDPC codes Signal and communications theory stopping criterion Telecommunications and information theory
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We propose a new stopping criterion for decoding LDPC codes which consists of a measure of decoder behaviors and a decision rule to predict decoding failure. We will show that the proposed measure, the number of satisfied check nodes, does not need (or minimizes) additional complexity, and the decision rule is efficient and more importantly channel independent, which was not possible in the previous work.
ISSN:	0916-8516 1745-1345 1745-1345
DOI:	10.1093/ietcom/e91-b.4.1145