A stopping criterion for low-density parity-check codes

Abstract

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.