Abstract
This paper shows that the decoding convergence of the punctured low-density parity-check (LDPC) codes can be significantly increased using edge wise scheduling belief-propagation. If rate- compatible (RC)-LDPC codes constructed based on puncturing are considered, the maximum mutual information increase (M^2I^2)-based algorithm can be used to arrange fixed schedules for incremental decoding, and further reduce the required number of iterations. With the assistance of the proposed decoding schedules, the puncture-based RC-LDPC codes can be a potential solution for delay- sensitive HARQ (Hybrid-Automatic Repeat reQuest) applications.