Deterministic and Ensemble-Based Spatially-Coupled Product Codes
Paper in proceeding, 2016

Several authors have proposed spatially-coupled (or convolutional-like) variants of product codes (PCs). In this paper, we focus on a parametrized family of generalized PCs that recovers some of these codes (e.g., staircase and block-wise braided codes) as special cases and study the iterative decoding performance over the binary erasure channel. Even though our code construction is deterministic (and not based on a randomized ensemble), we show that it is still possible to rigorously derive the density evolution (DE) equations that govern the asymptotic performance. The obtained DE equations are then compared to those for a related spatially-coupled PC ensemble. In particular, we show that there exists a family of (deterministic) braided codes that follows the same DE equation as the ensemble, for any spatial length and coupling width.

Inventory control

Information theory

Microcomputers

Iterative decoding

Author

Christian Häger

Chalmers, Signals and Systems, Communication, Antennas and Optical Networks

Henry D. Pfister

Duke University

Alexandre Graell i Amat

Chalmers, Signals and Systems, Communication, Antennas and Optical Networks

Fredrik Brännström

Chalmers, Signals and Systems, Communication, Antennas and Optical Networks

IEEE International Symposium on Information Theory - Proceedings

21578095 (ISSN)

Vol. 2016-August 2114-2118 7541672

Signal Recovery: Compressed Sensing meets Coding Theory

Swedish Research Council (VR) (2011-5961), 2012-01-01 -- 2015-12-31.

Areas of Advance

Information and Communication Technology

Subject Categories

Telecommunications

Communication Systems

Signal Processing

Infrastructure

C3SE (Chalmers Centre for Computational Science and Engineering)

DOI

10.1109/ISIT.2016.7541672

More information

Latest update

4/5/2022 6