Check‐node lazy scheduling approach for layered belief propagation decoding algorithm

Abstract

A novel check‐node lazy scheduling (CLS) approach is presented for the layered belief propagation (LBP) decoding algorithm in low‐density parity‐check (LDPC) applications. In the cases where the check nodes are highly reliable, this proposed CLS approach skips the check nodes in the belief propagation processes, and thus it clearly reduces the iteration times of LDPC decoding. Simulations show that, when this CLS approach is integrated into the classical LBP decoding algorithm, the needed maximum iterations is improved by nearly 30%.