On the optimality of lattice space-time (LAST) coding

Damen, Mohamed Oussama;El Gamal, Hesham;Caire, Giuseppe
ISIT 2004, IEEE International Symposium on Information Theory, June 27-July 2, 2004, Chicago, USA

In this paper, we introduce the class of lattice space-time (LAST) codes. We show that these codes achieve the optimal diversity-vs-multiplexing tradeoff defined by Zheng and Tse under generalized minimum Euclidean distance lattice decoding. Our scheme is based on a generalization of Erez and Zamir mod-/spl Lambda/ scheme to the MIMO case. This result settles the open problem posed by Zheng and Tse on the construction of explicit coding and decoding schemes that achieve the optimal diversity-vs-multiplexing tradeoff. Moreover, our results shed more light on the structure of optimal coding/decoding techniques in delay limited MIMO channels. In particular: 1) we show that MMSE-GDFE plays a fundamental role in approaching the limits of delay limited MIMO channels in the high SNR regime, unlike the AWGN channel case and 2) our random coding arguments represent a major departure from traditional space-time code designs based on the rank and/or mutual information design criteria.

Communication systems
Eurecom Ref:
© 2004 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
See also:

PERMALINK : https://www.eurecom.fr/publication/1601