Incremental Decoding Schedules for Puncture-Based Rate-Compatible LDPC Codes

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 incre...

Full description

Saved in:
Bibliographic Details
Published in2016 IEEE 83rd Vehicular Technology Conference (VTC Spring) pp. 1 - 5
Main Authors Huang-Chang Lee, Yeong-Luh Ueng
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.05.2016
Subjects
Convergence
Decoding
Heuristic algorithms
Iterative decoding
Mutual information
Schedules
Online AccessGet full text
DOI10.1109/VTCSpring.2016.7504285

Cover

More Information
Summary: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.
DOI:10.1109/VTCSpring.2016.7504285