Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

Reduced Complexity Window Decoding Schedules for Coupled LDPC Codes

Ul Hassan, Najeeb ; Pusane, Ali Emre ; Lentmaier, Michael LU ; Fettweis, Gerhard and Costello Jr., Daniel J. (2012) IEEE Information Theory Workshop (ITW), 2012 p.20-24
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.
Please use this url to cite or link to this publication:
author
; ; ; and
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
spatial coupling, LDPC codes
host publication
2012 IEEE Information Theory Workshop
pages
20 - 24
publisher
IEEE - Institute of Electrical and Electronics Engineers Inc.
conference name
IEEE Information Theory Workshop (ITW), 2012
conference location
Lausanne, Switzerland
conference dates
2012-09-03 - 2012-09-06
external identifiers
  • scopus:84873163562
ISBN
978-1-4673-0224-1
DOI
10.1109/ITW.2012.6404660
language
English
LU publication?
no
id
63f01460-a9ce-4977-8a54-8a25c03d4eca (old id 3731057)
date added to LUP
2016-04-04 11:38:15
date last changed
2022-01-29 22:09:34
@inproceedings{63f01460-a9ce-4977-8a54-8a25c03d4eca,
  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.}},
  author       = {{Ul Hassan, Najeeb and Pusane, Ali Emre and Lentmaier, Michael and Fettweis, Gerhard and Costello Jr., Daniel J.}},
  booktitle    = {{2012 IEEE Information Theory Workshop}},
  isbn         = {{978-1-4673-0224-1}},
  keywords     = {{spatial coupling; LDPC codes}},
  language     = {{eng}},
  pages        = {{20--24}},
  publisher    = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
  title        = {{Reduced Complexity Window Decoding Schedules for Coupled LDPC Codes}},
  url          = {{https://lup.lub.lu.se/search/files/5820214/3731058.pdf}},
  doi          = {{10.1109/ITW.2012.6404660}},
  year         = {{2012}},
}