The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Reduced Complexity Window Decoding Schedules for Coupled LDPC Codes

På svenska

Author

  • Najeeb Ul Hassan
  • Ali Emre Pusane
  • Michael Lentmaier
  • Gerhard Fettweis
  • Daniel J. Costello Jr.

Summary, in English

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.

Publishing year

2012

Language

English

Pages

20-24

Publication/Series

2012 IEEE Information Theory Workshop

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • spatial coupling
  • LDPC codes

Conference name

IEEE Information Theory Workshop (ITW), 2012

Conference date

2012-09-03 - 2012-09-06

Conference place

Lausanne, Switzerland

Status

Published

Research group

  • Telecommunication Theory

ISBN/ISSN/Other

  • ISBN: 978-1-4673-0224-1