A recent result of Zheng and Tse states that over a quasi-static channel, there exists a fundamental tradeoff, referred to as the diversity-multiplexing gain (D-MG) tradeoff, between the spatial multiplexing gain and the diversity gain that can be simultaneously achieved by a space-time (ST) block code. This tradeoff is precisely known in the case of i.i.d. Rayleigh-fading, for T ≥ nt + nr − 1 where T is the number of time slots over which coding takes place and nt, nr are the number of transmit and receive antennas respectively. For T < nt + nr − 1, only upper and lower bounds on the D-MG tradeoff are available.In this paper, we present a complete solution to the problem of explicitly constructing D-MG optimal ST codes, i.e., codes that achieve the D-MG tradeoff for any number of receive antennas. We do this by showing that for the square minimum-delay case when T = nt = n, cyclic-division-algebra (CDA) based ST codes having the non-vanishing determinant property are D-MG optimal. While constructions of such codes were previously known for restricted values of n, we provide here a construction for such codes that is valid for all n.For the rectangular, T > nt case, we present two general techniques for building D-MG-optimal rectangular ST codes from their square counterparts. A byproduct of our results establishes that the D-MG tradeoff for all T ≥ nt is the same as that previously known to hold for T ≥ nt + nr − 1.
Linear receivers are an attractive low-complexity alternative to optimal
processing for multi-antenna MIMO communications. In this paper we characterize
the information-theoretic performance of MIMO linear receivers in two different
asymptotic regimes. For fixed number of antennas, we investigate the limit of
error probability in the high-SNR regime in terms of the Diversity-Multiplexing
Tradeoff (DMT). Following this, we characterize the error probability for fixed
SNR in the regime of large (but finite) number of antennas.
As far as the DMT is concerned, we report a negative result: we show that
both linear Zero-Forcing (ZF) and linear Minimum Mean-Square Error (MMSE)
receivers achieve the same DMT, which is largely suboptimal even in the case
where outer coding and decoding is performed across the antennas. We also
provide an approximate quantitative analysis of the markedly different behavior
of the MMSE and ZF receivers at finite rate and non-asymptotic SNR, and show
that while the ZF receiver achieves poor diversity at any finite rate, the MMSE
receiver error curve slope flattens out progressively, as the coding rate
increases.
When SNR is fixed and the number of antennas becomes large, we show that the
mutual information at the output of a MMSE or ZF linear receiver has
fluctuations that converge in distribution to a Gaussian random variable, whose
mean and variance can be characterized in closed form. This analysis extends to
the linear receiver case a well-known result previously obtained for the
optimal receiver. Simulations reveal that the asymptotic analysis captures
accurately the outage behavior of systems even with a moderate number of
antennas.Comment: 48 pages, Submitted to IEEE Transactions on Information Theor
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.