A Stopping Criterion for Low-Density Parity-Check Codes

Donghyuk SHIN  Jeongseok HA  Kyoungwoo HEO  Hyuckjae LEE  

IEICE TRANSACTIONS on Communications   Vol.E91-B   No.4   pp.1145-1148
Publication Date: 2008/04/01
Online ISSN: 1745-1345
DOI: 10.1093/ietcom/e91-b.4.1145
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Fundamental Theories for Communications
LDPC codes,  belief propagation,  stopping criterion,  

Full Text: PDF(298.5KB)>>
Buy this Article

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.