In this paper, we answer several open questions related to diversity-multiplexing tradeoffs (DMTs) for point-to-point and multiple-access (MAC) MIMO channels. By analyzing the DMT performance of a simple code, we show that the optimal MAC-DMT holds even when the channel remains fixed for less than Kn t+n r-1 channel uses, where K is the number of users, n t is the number of transmit antennas of each user, and n r is the number of receive antennas at receiver. We also prove that the simple code isMAC-DMT optimal. A general code design criterion for constructing MAC-DMT optimal codes that is much more relaxed than the previously known design criterion is provided. Finally, by changing some design parameters, the simple code is modified for use in point-to-point MIMO channels. We show the modified code achieves the same DMT performance as the Gaussian random code.
|Number of pages||6|
|Journal||IEEE Transactions on Information Theory|
|State||Published - 1 Feb 2012|
- Diversity-multiplexing gain tradeoff (DMT)
- Multiple access channel (MAC)
- Multiple-input multiple-output (MIMO) channel
- Space-time block codes (STBCs)