On the Information Loss of the Max-Log Approximation in BICM Systems

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Ivanov, Mikhail, Häger, Christian, Brännström, Fredrik, Amat, Alexandre Graell i, Alvarado, Alex, Agrell, Erik
Formato: Preprint
Publicado: 2014
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866913205976039424
author Ivanov, Mikhail
Häger, Christian
Brännström, Fredrik
Amat, Alexandre Graell i
Alvarado, Alex
Agrell, Erik
author_facet Ivanov, Mikhail
Häger, Christian
Brännström, Fredrik
Amat, Alexandre Graell i
Alvarado, Alex
Agrell, Erik
contents We present a comprehensive study of the information rate loss of the max-log approximation for $M$-ary pulse-amplitude modulation (PAM) in a bit-interleaved coded modulation (BICM) system. It is widely assumed that the calculation of L-values using the max-log approximation leads to an information loss. We prove that this assumption is correct for all $M$-PAM constellations and labelings with the exception of a symmetric 4-PAM constellation labeled with a Gray code. We also show that for max-log L-values, the BICM generalized mutual information (GMI), which is an achievable rate for a standard BICM decoder, is too pessimistic. In particular, it is proved that the so-called "harmonized" GMI, which can be seen as the sum of bit-level GMIs, is achievable without any modifications to the decoder. We then study how bit-level channel symmetrization and mixing affect the mutual information (MI) and the GMI for max-log L-values. Our results show that these operations, which are often used when analyzing BICM systems, preserve the GMI. However, this is not necessarily the case when the MI is considered. Necessary and sufficient conditions under which these operations preserve the MI are provided.
format Preprint
id arxiv_https___arxiv_org_abs_1408_2214
institution arXiv
publishDate 2014
record_format arxiv
spellingShingle On the Information Loss of the Max-Log Approximation in BICM Systems
Ivanov, Mikhail
Häger, Christian
Brännström, Fredrik
Amat, Alexandre Graell i
Alvarado, Alex
Agrell, Erik
Information Theory
We present a comprehensive study of the information rate loss of the max-log approximation for $M$-ary pulse-amplitude modulation (PAM) in a bit-interleaved coded modulation (BICM) system. It is widely assumed that the calculation of L-values using the max-log approximation leads to an information loss. We prove that this assumption is correct for all $M$-PAM constellations and labelings with the exception of a symmetric 4-PAM constellation labeled with a Gray code. We also show that for max-log L-values, the BICM generalized mutual information (GMI), which is an achievable rate for a standard BICM decoder, is too pessimistic. In particular, it is proved that the so-called "harmonized" GMI, which can be seen as the sum of bit-level GMIs, is achievable without any modifications to the decoder. We then study how bit-level channel symmetrization and mixing affect the mutual information (MI) and the GMI for max-log L-values. Our results show that these operations, which are often used when analyzing BICM systems, preserve the GMI. However, this is not necessarily the case when the MI is considered. Necessary and sufficient conditions under which these operations preserve the MI are provided.
title On the Information Loss of the Max-Log Approximation in BICM Systems
topic Information Theory
url https://arxiv.org/abs/1408.2214