Non-Uniform Windowed Decoding Schedules for Spatially Coupled Codes

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

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingpeer-review

248 Downloads (Pure)

Abstract

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.
Original languageEnglish
Title of host publication[Host publication title missing]
PublisherIEEE - Institute of Electrical and Electronics Engineers Inc.
Publication statusPublished - 2013
EventIEEE Global Communications Conference (GLOBECOM), 2013 - Atlanta, GA USA, Atlanta, GA, United States
Duration: 2013 Dec 92013 Dec 13

Conference

ConferenceIEEE Global Communications Conference (GLOBECOM), 2013
Country/TerritoryUnited States
CityAtlanta, GA
Period2013/12/092013/12/13

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering

Free keywords

  • spatial coupling
  • LDPC codes
  • LDPC convolutional codes

Fingerprint

Dive into the research topics of 'Non-Uniform Windowed Decoding Schedules for Spatially Coupled Codes'. Together they form a unique fingerprint.

Cite this