Performance of space-time codes for a large number of antennas
We study the asymptotic behavior of space-time codes when the number of transmit and receive antennas grows to infinity. Specifically, we determine the behavior of pairwise error probabilities with maximum-likelihood (AIL) decoding and with three types of receiver interfaces: the NIL interface, the linear zero-forcing (ZF) interface, and the linear minimum-mean-square-error (MMSE) interface. Two situations are studied: when the number of receiving antennas grows to infinity while the number of transmitting antennas is finite, and when both numbers grow to infinity but their ratio remains constant. We show that with NIL or linear interfaces the asymptotic performance of space-time codes is determined by the Euclidean distances between codewords. Moreover, with the two linear interfaces examined here the number r of receive antennas must be much larger than the number t of transmit antennas to avoid a sizeable loss of performance; on the other hand, when r much greater than t, the performance of these linear interfaces comes close to that of NIL. The dependence of error probabilities on Euclidean distance is valid for intermediate signal-to-noise ratios (SNRs) even when the number of antennas is small. Simulations validate our theoretical findings, and show how asymptotic results may be substantially valid even in a nonasymptotic regime: thus, even for few antennas, off-the-shelf codes may outperform space-time codes designed ad hoc.
space-time codes coding fading channels multiple antennas