Non-Uniform Window Decoding Schedules for Spatially Coupled LDPC Codes

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

Research output: Contribution to journalArticlepeer-review

17 Citations (SciVal)
167 Downloads (Pure)


Spatially coupled low-density parity-check codes can be decoded using a graph-based message passing algorithm applied across the total length of the coupled graph. However, considering practical constraints on decoding latency and complexity, a sliding window decoding approach is normally preferred. In order to reduce decoding complexity compared with standard parallel decoding schedules, serial schedules can be applied within a decoding window. However, uniform serial schedules within a window do not provide the expected reduction in complexity. Hence, we propose non-uniform schedules (parallel and serial) based on measured improvements in the estimated bit error rate (BER). We show that these non-uniform schedules result in a significant reduction in complexity without any loss in performance. Furthermore, based on observations made using density evolution, we propose a non-uniform pragmatic decoding schedule (parallel and serial) that does not require any additional calculations (e.g., BER estimates) within the decoding process.

Original languageEnglish
Article number7762121
Pages (from-to)501-510
Number of pages10
JournalIEEE Transactions on Communications
Issue number2
Publication statusPublished - 2017 Feb 1

Subject classification (UKÄ)

  • Telecommunications


  • decoding schedules
  • iterative decoding
  • LDPC codes
  • LDPC convolutional codes
  • spatially coupled codes
  • window decoding


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

Cite this