Performance of MIMO space-time coding with discrete modulations.

*(English)*Zbl 1071.94006
Blaum, Mario (ed.) et al., Information, coding and mathematics. Proceedings of workshop honoring Professor Bob McEliece on his 60th birthday, Pasadena, CA, USA, May 24–25, 2002. Boston, MA: Kluwer Academic Publishers (ISBN 1-4020-7079-9/hbk). The Kluwer International Series in Engineering and Computer Science 687, 165-181 (2002).

Summary: We consider the maximum-likelihood (ML) decoding performance of concatenated space-time (ST) random coded communication utilizing multiple input and multiple output (MIMO) antennas on quasi-static fading channels. The ensemble-averaged frame error rates of such systems can be upper bounded by the outage probabilities of the corresponding conditional cutoff rates. We refer to these as the information cutoff probabilities and evaluate them numerically for a wide range of ST coding schemes. The slope behaviors of these cutoff probabilities are found to be consistent with the maximum achievable diversity orders given by a new unified bound. With simulations of a class of ST coding schemes based on bit-interleaved coded modulations and iterative spatial/temporal decoders, we further show these cutoff probabilities can provide accurate predictions of total performance gains. We then present numerical results of the \(p\%\) cutoff capacities, which are defined as the highest supportable rates for target cutoff probabilities at \(p\%\). Our discussion shows how this new notion can provide a unified view of all the three main theoretic results of MIMO space-time coding: rate enhancements, achievable diversity gains, and performance of specific codes. As a result, this analysis of cutoff capacities reveals the relative strengths and weaknesses of several space-time coding schemes in interesting and surprising ways.

For the entire collection see [Zbl 1054.94001].

For the entire collection see [Zbl 1054.94001].