Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Reduced Complexity Window Decoding Schedules for Coupled LDPC Codes

In English

Författare

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

Publiceringsår

2012

Språk

Engelska

Sidor

20-24

Publikation/Tidskrift/Serie

2012 IEEE Information Theory Workshop

Dokumenttyp

Konferensbidrag

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Nyckelord

  • 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

Forskningsgrupp

  • Telecommunication Theory

ISBN/ISSN/Övrigt

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