Density evolution for deterministic generalized product codes with higher-order modulation

Conference Paper

Generalized product codes (GPCs) are extensions of product codes (PCs) where coded bits are protected by two component codes but not necessarily arranged in a rectangular array. It has recently been shown that there exists a large class of deterministic GPCs (including, e.g., irregular PCs, half-product codes, staircase codes, and certain braided codes) for which the asymptotic performance under iterative bounded-distance decoding over the binary erasure channel (BEC) can be rigorously characterized in terms of a density evolution analysis. In this paper, the analysis is extended to the case where transmission takes place over parallel BECs with different erasure probabilities. We use this model to predict the code performance in a coded modulation setup with higher-order signal constellations. We also discuss the design of the bit mapper that determines the allocation of the coded bits to the modulation bits of the signal constellation.

Full Text

Duke Authors

Cited Authors

  • Hager, C; Amat, AGI; Pfister, HD; Brannstrom, F

Published Date

  • October 17, 2016

Published In

Volume / Issue

  • 2016-October /

Start / End Page

  • 236 - 240

Electronic International Standard Serial Number (EISSN)

  • 2165-4719

International Standard Serial Number (ISSN)

  • 2165-4700

International Standard Book Number 13 (ISBN-13)

  • 9781509034017

Digital Object Identifier (DOI)

  • 10.1109/ISTC.2016.7593112

Citation Source

  • Scopus