Low complexity virtual antenna arrays using cooperative relay selection
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Efficient sequence detection of multicarrier transmissions over doubly dispersive channels
EURASIP Journal on Applied Signal Processing
MIMO transceiver design via majorization theory
Foundations and Trends in Communications and Information Theory
Cyclic Division Algebras: A Tool for Space-Time Coding
Foundations and Trends in Communications and Information Theory
Efficient maximum-likelihood decoding of sphericallattice codes
IEEE Transactions on Communications
Dynamic linear precoding for the exploitation of known interference in MIMO broadcast systems
IEEE Transactions on Wireless Communications
Code rate-diversity-multiplexing tradeoff
IEEE Transactions on Information Theory
Asymptotic-information-lossless designs and the diversity-multiplexing tradeoff
IEEE Transactions on Information Theory
Asymptotic performance of linear receivers in MIMO fading channels
IEEE Transactions on Information Theory
Space-time codes from structured lattices
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
High-SNR analysis of outage-limited communications with bursty and delay-limited information
IEEE Transactions on Information Theory
Space-time codes achieving the DMD tradeoff of the MIMO-ARQ channel
IEEE Transactions on Information Theory
Coding and decoding for the dynamic decode and forward relay protocol
IEEE Transactions on Information Theory
Transmit antenna selection for partially precoded MIMO systems
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
LR-aided MMSE lattice decoding is DMT optimal for all approximately universal codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
A simple distributed antenna processing scheme for cooperative diversity
IEEE Transactions on Communications
The RF-chain limited MIMO system: part I: optimum diversity-multiplexing tradeoff
IEEE Transactions on Wireless Communications
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Selective channel inversion precoding for the downlink of MIMO wireless systems
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Multi-hop MIMO relay networks: diversity-multiplexing trade-off analysis
IEEE Transactions on Wireless Communications
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Finite-SNR diversity-multiplexing tradeoff via asymptotic analysis of large MIMO systems
IEEE Transactions on Information Theory
On the limitations of the naive lattice decoding
IEEE Transactions on Information Theory
Efficient space-time codes from cyclic division algebras
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Cognitive radio with partial channel state information at the transmitter
IEEE Transactions on Wireless Communications
On the number of lattice points in a small sphere and a recursive lattice decoding algorithm
Designs, Codes and Cryptography
Hi-index | 755.56 |
This paper considers communication over coherent multiple-input multiple-output (MIMO) flat-fading channels where the channel is only known at the receiver. For this setting, we introduce the class of LAttice Space-Time (LAST) codes. We show that these codes achieve the optimal diversity-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-Lambda scheme to the MIMO case. In our construction the scalar "scaling" of Erez-Zamir and Costa Gaussian "dirty-paper" schemes is replaced by the minimum mean-square error generalized decision-feedback equalizer (MMSE-GDFE). 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-multiplexing tradeoff. Moreover, our results shed more light on the structure of optimal coding/decoding techniques in delay-limited MIMO channels, and hence, open the door for novel approaches for space-time code constructions. In particular, 1) we show that MMSE-GDFE plays a fundamental role in approaching the limits of delay-limited MIMO channels in the high signal-to-noise ratio (SNR) regime, unlike the additive white Gaussian noise (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.