Deterministic and ensemble-based spatially-coupled product codes

Published

Conference Paper

© 2016 IEEE. 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.

Full Text

Duke Authors

Cited Authors

  • Hager, C; Pfister, HD; Graell I Amat, A; Brannstrom, F

Published Date

  • August 10, 2016

Published In

Volume / Issue

  • 2016-August /

Start / End Page

  • 2114 - 2118

International Standard Serial Number (ISSN)

  • 2157-8095

International Standard Book Number 13 (ISBN-13)

  • 9781509018062

Digital Object Identifier (DOI)

  • 10.1109/ISIT.2016.7541672

Citation Source

  • Scopus