On universally decodable matrices for space---time coding
Designs, Codes and Cryptography
Cooperative diversity schemes for asynchronous wireless networks
Wireless Personal Communications: An International Journal
Cyclic Division Algebras: A Tool for Space-Time Coding
Foundations and Trends in Communications and Information Theory
On source transmission over MIMO channels with limited feedback
IEEE Transactions on Signal Processing
To code in space and time or not in multihop relay channels
IEEE Transactions on Signal Processing
Asymptotic-information-lossless designs and the diversity-multiplexing tradeoff
IEEE Transactions on Information Theory
Space-time codes from structured lattices
IEEE Transactions on Information Theory
High-SNR analysis of outage-limited communications with bursty and delay-limited information
IEEE Transactions on Information Theory
Diversity gains of power control with noisy CSIT in MIMO channels
IEEE Transactions on Information Theory
Space-time codes achieving the DMD tradeoff of the MIMO-ARQ channel
IEEE Transactions on Information Theory
D-MG tradeoff and optimal codes for a class of AF and DF cooperative communication protocols
IEEE Transactions on Information Theory
Coding and decoding for the dynamic decode and forward relay protocol
IEEE Transactions on Information Theory
Cooperative multiplexing: toward higher spectral efficiency in multiple-antenna relay networks
IEEE Transactions on Information Theory
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Diversity-multiplexing tradeoff of the two-user interference channel
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Some properties of Alamouti-like MISO codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
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
The RF-chain limited MIMO system: part I: optimum diversity-multiplexing tradeoff
IEEE Transactions on Wireless Communications
Asymptotic analysis of outage region in CDMA MIMO systems
IEEE Transactions on Information Theory
DMT analysis of asynchronous OFDM decode-and-forward cooperative networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
RBG matching: an innovative combinatorial approach for OFDMA resource allocation
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
On the diversity gain in cooperative relaying channels with imperfect CSIT
IEEE Transactions on Communications
Rateless coding for MIMO fading channels: performance limits and code construction
IEEE Transactions on Wireless Communications
IEEE Transactions on Information Theory
Multigroup ML decodable collocated and distributed space-time block codes
IEEE Transactions on Information Theory
IEEE Transactions on Wireless Communications
IEEE Transactions on Information Theory
Efficient space-time codes from cyclic division algebras
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Separable Convex Optimization Problems with Linear Ascending Constraints
SIAM Journal on Optimization
| Hi-index | 755.56 |
Performance of reliable communication over a coherent slow-fading multiple-input multiple-output (MIMO) channel at high signal-to-noise ratio (SNR) is succinctly captured as a fundamental tradeoff between diversity and multiplexing gains. This paper studies the problem of designing codes that optimally tradeoff the diversity and multiplexing gains. The main contribution is a precise characterization of codes that are universally tradeoff-optimal, i.e., they optimally tradeoff the diversity and multiplexing gains for every statistical characterization of the fading channel. This characterization is referred to as approximate universality; the approximation is in the connection between error probability and outage capacity with diversity and multiplexing gains, respectively. The characterization of approximate universality is then used to construct new coding schemes as well as to show optimality of several schemes proposed in the space-time coding literature.