Incremental decoding schedules for puncture-based rate-compatible LDPC codes

Huang Chang Lee, Yeong Luh Ueng

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

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.

Original languageEnglish
Title of host publication2016 IEEE 83rd Vehicular Technology Conference, VTC Spring 2016 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781509016983
DOIs
StatePublished - 05 07 2016
Externally publishedYes
Event83rd IEEE Vehicular Technology Conference, VTC Spring 2016 - Nanjing, China
Duration: 15 05 201618 05 2016

Publication series

NameIEEE Vehicular Technology Conference
Volume2016-July
ISSN (Print)1550-2252

Conference

Conference83rd IEEE Vehicular Technology Conference, VTC Spring 2016
Country/TerritoryChina
CityNanjing
Period15/05/1618/05/16

Bibliographical note

Publisher Copyright:
© 2016 IEEE.

Keywords

  • Belief propagation
  • Error-control codes
  • Low-density parity-check (LDPC) codes
  • Messages-passing schedule

Fingerprint

Dive into the research topics of 'Incremental decoding schedules for puncture-based rate-compatible LDPC codes'. Together they form a unique fingerprint.

Cite this