Optimal overlapped message passing decoding for quasi-cyclic low-density parity-check codes

In this paper, we first present a general scheduling model for the overlapped message passing (OMP) decoding of LDPC codes, and show that maximizing the throughput amounts to minimizing the intra- and inter-iteration waiting times. Then we focus on maximizing the throughput for OMP decoders of quasi-cyclic (QC) LDPC codes using a partly parallel hardware structure, which can be modelled as a data dependency and hardware constrained optimization problem. Finally, we propose a scheduling scheme, which gives the optimal solution to the optimization problem under certain conditions. In comparison to previously proposed scheduling schemes, our new scheduling scheme leads to both higher hardware utilization efficiency (HUE) and greater throughput gain