A Deterministic Construction and Density Evolution Analysis for Generalized Product Codes
Övrigt konferensbidrag, 2016

Generalized product codes (GPCs) are extensions of product codes (PCs) where code symbols are protected by two component codes but not necessarily arranged in a rectangular array. In this tutorial paper, we review a deterministic construction for GPCs that has been previously proposed by the authors together with an accompanying density evolution (DE) analysis. The DE analysis characterizes the asymptotic performance of the resulting GPCs under iterative bounded-distance decoding of the component codes over the binary erasure channel. As an application, we discuss the analysis and design of three different classes of GPCs: spatially-coupled PCs, symmetric GPCs, and GPCs based on component code mixtures.

bounded-distance decoding

braided codes

random graphs

spatially-coupled codes

Deterministic generalized product codes

staircase codes

Författare

Christian Häger

Chalmers, Signaler och system, Kommunikationssystem, informationsteori och antenner

Henry D. Pfister

Alexandre Graell i Amat

Chalmers, Signaler och system, Kommunikationssystem, informationsteori och antenner

Fredrik Brännström

Chalmers, Signaler och system, Kommunikationssystem, informationsteori och antenner

Erik Agrell

Chalmers, Signaler och system, Kommunikationssystem, informationsteori och antenner

Proc. Int. Zurich Seminar on Communications (IZS)

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier (SSIF 2011)

Telekommunikation

Kommunikationssystem

Mer information

Skapat

2017-10-07