Title :
Spatially coupled sparse codes on graphs: theory and practice
Author :
Costello, Daniel J. ; Dolecek, Lara ; Fuja, Thomas ; Kliewer, Joerg ; Mitchell, David ; Smarandache, Roxana
Author_Institution :
Univ. of Notre Dame, Notre Dame, IN, USA
Abstract :
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.
Keywords :
channel coding; decoding; graph theory; parity check codes; turbo codes; Shannon limit; channel coding; code designers; coding standards; coding techniques; complexity constraints; decoded error rate requirements; decoding complexity; deep space communication; encoding complexity; graphs; low-density parity check codes; satellite TV; spatially coupled sparse codes; turbo codes; wireless mobile transmission; Block codes; Convolutional codes; Decoding; Iterative decoding; Sparse matrices;
Journal_Title :
Communications Magazine, IEEE
DOI :
10.1109/MCOM.2014.6852099