Reduced Complexity Window Decoding Schedules for Coupled LDPC Codes

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

Abstract

Window decoding schedules are very attractive for message passing decoding of spatially coupled LDPC codes. They take advantage of the inherent convolutional code structure and allow continuous transmission with low decoding latency and complexity. In this paper we show that the decoding complexity can be further reduced if suitable message passing schedules are applied within the decoding window. An improvement based schedule is presented that easily adapts to different ensemble structures, window sizes, and channel parameters. Its combination with a serial (on-demand) schedule is also considered. Results from a computer search based schedule are shown for comparison.

Details

Authors
  • Najeeb Ul Hassan
  • Ali Emre Pusane
  • Michael Lentmaier
  • Gerhard Fettweis
  • Daniel J. Costello Jr.
Organisations
External organisations
  • External Organization - Unknown
Research areas and keywords

Subject classification (UKÄ) – MANDATORY

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • spatial coupling, LDPC codes
Original languageEnglish
Title of host publication[Host publication title missing]
PublisherIEEE--Institute of Electrical and Electronics Engineers Inc.
Pages20-24
ISBN (Print)978-1-4673-0224-1
Publication statusPublished - 2012
Publication categoryResearch
Peer-reviewedYes
EventIEEE Information Theory Workshop (ITW), 2012 - Lausanne, Switzerland
Duration: 2012 Sep 32012 Sep 6

Workshop

WorkshopIEEE Information Theory Workshop (ITW), 2012
CountrySwitzerland
CityLausanne
Period2012/09/032012/09/06

Total downloads

No data available