Fast decoding of low density parity check codes

The Layered Belief Propagation L-BP algorithm is is a modified Belief Propagation BP algorithm, where the check nodes are divided in subgroups called layers and each iteration is broken into multiple sub-iterations. In this paper, we consider layered belief propagation decoding and propose an efficient variable node layering for decoding LDPC codes that performs well. We compare the performance of the first introduced LDPC decoding algorithm BP and Layered BP using check node layering with Layered BP using variable node layering in terms of bit error rate (BER). We show that the convergence for decoding LDPC codes is increasing by using a simple and efficient layering strategy.