2016/04/22 by Christian Häger, Häger, Christian, Alexandre Graell i Amat +5
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Cellular Automata and Applications #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.1604.06553
openalex publication_date 2016/04/22 · openalex created_date 2022/10/01 · openalex updated_date 2026/07/28
Generalized product codes (GPCs) are extensions of product codes (PCs) where\ncoded bits are protected by two component codes but not necessarily arranged in\na rectangular array. It has recently been shown that there exists a large class\nof deterministic GPCs (including, e.g., irregular PCs, half-product codes,\nstaircase codes, and certain braided codes) for which the asymptotic\nperformance under iterative bounded-distance decoding over the binary erasure\nchannel (BEC) can be rigorously characterized in terms of a density evolution\nanalysis. In this paper, the analysis is extended to the case where\ntransmission takes place over parallel BECs with different erasure\nprobabilities. We use this model to predict the code performance in a coded\nmodulation setup with higher-order signal constellations. We also discuss the\ndesign of the bit mapper that determines the allocation of the coded bits to\nthe modulation bits of the signal constellation.\n