Spatially coupled sparse codes on graphs: Theory and practice

Daniel J. Costello, Lara Dolecek, Thomas E. Fuja, Jörg Kliewer, David G.M. Mitchell, Roxana Smarandache

Research output: Contribution to journalArticlepeer-review

65 Scopus citations


Since the discovery of turbo codes 20 years ago and the subsequent rediscovery of low-density parity check codes a few years later, the field of channel coding has experienced a number of major advances. Until that time, code designers were usually happy with performance that came within a few decibels of the Shannon Limit, primarily due to implementation complexity constraints, whereas the new coding techniques now allow performance within a small fraction of a decibel of capacity with modest encoding and decoding complexity. Due to these significant improvements, coding standards in applications as varied as wireless mobile transmission, satellite TV, and deep space communication are being updated to incorporate the new techniques. In this article, we review a particularly exciting new class of low-density parity check codes called spatially coupled codes, which promise excellent performance over a broad range of channel conditions and decoded error rate requirements.

Original languageEnglish (US)
Article number6852099
Pages (from-to)168-176
Number of pages9
JournalIEEE Communications Magazine
Issue number7
StatePublished - Jul 2014

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Spatially coupled sparse codes on graphs: Theory and practice'. Together they form a unique fingerprint.

Cite this