Multidimensional Coded Modulation in Block-Fading Channels

From MaRDI portal
Publication:3604580

DOI10.1109/TIT.2008.920244zbMATH Open1328.94046arXiv0705.3555OpenAlexW2056766826WikidataQ63957507 ScholiaQ63957507MaRDI QIDQ3604580FDOQ3604580

Giuseppe Caire, Albert Guillen i Fabregas

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: We study the problem of constructing coded modulation schemes over multidimensional signal sets in Nakagami-m block-fading channels. In particular, we consider the optimal diversity reliability exponent of the error probability when the multidimensional constellation is obtained as the rotation of classical complex-plane signal constellations. We show that multidimensional rotations of full dimension achieve the optimal diversity reliability exponent, also achieved by Gaussian constellations. Multidimensional rotations of full dimension induce a large decoding complexity, and in some cases it might be beneficial to use multiple rotations of smaller dimension. We also study the diversity reliability exponent in this case, which yields the optimal rate-diversity-complexity tradeoff in block-fading channels with discrete inputs.


Full work available at URL: https://arxiv.org/abs/0705.3555











This page was built for publication: Multidimensional Coded Modulation in Block-Fading Channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604580)