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.

Non-Uniform Windowed Decoding Schedules for Spatially Coupled Codes

På svenska

Author

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

Summary, in English

Low-density parity-check convolutional (LDPCC) codes, also known as spatially coupled LDPC codes, can be decoded using a message passing algorithm. In order to limit decoding latency and complexity, windowed decoding can be applied. Updates within the window can be performed either in parallel or serially. However, simulation results show that uniform updating schedules do not provide the expected reduction in complexity when applied within the window. Hence we propose non-uniform schedules for updating the nodes based on measured improvements in the bit error rate. Nodes within the window that stop showing any improvement are excluded from the update list for the next iteration. This results in a reduction of up to 50% in complexity compared to uniform window schedules.

Publishing year

2013

Language

English

Publication/Series

[Host publication title missing]

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
  • LDPC convolutional codes

Conference name

IEEE Global Communications Conference (GLOBECOM), 2013

Conference date

2013-12-09 - 2013-12-13

Conference place

Atlanta, GA, United States

Status

Published

Research group

  • Telecommunication Theory