Deterministic and Ensemble-Based Spatially-Coupled Product Codes
Paper i 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.

Iterative decoding

Information theory

Microcomputers

Inventory control

Författare

Christian Häger

Chalmers, Signaler och system, Kommunikationssystem, informationsteori och antenner, Kommunikationssystem

Henry D. Pfister

Duke University

Alexandre Graell i Amat

Chalmers, Signaler och system, Kommunikationssystem, informationsteori och antenner, Kommunikationssystem

Fredrik Brännström

Chalmers, Signaler och system, Kommunikationssystem, informationsteori och antenner, Kommunikationssystem

IEEE International Symposium on Information Theory - Proceedings

21578095 (ISSN)

2114-2118 7541672

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier

Telekommunikation

Kommunikationssystem

Signalbehandling

Infrastruktur

C3SE (Chalmers Centre for Computational Science and Engineering)

DOI

10.1109/ISIT.2016.7541672

ISBN

978-1-5090-1806-2

Mer information

Skapat

2017-10-08