Limiting performance of block-fading channels with multiple antennas

Biglieri, Ezio;Caire, Giuseppe;Taricco, Giorgio
"IEEE Transactions on Information Theory", Volume 47, N°4, May 2001

We derive the performance limits of a radio system consisting of a transmitter with t antennas and a receiver with r antennas, a block-fading channel with additive white Gaussian noise, delay and transmit-power constraints, and perfect channel-state information available at both transmitter and receiver. Because of a delay constraint, the transmission of a code word is assumed to span a finite (and typically small) number M of independent channel realizations; therefore, the relevant performance limits are the information outage probability and the “delay-limited” (or “non-ergodic”) capacity [11, 16, 35]. We derive the coding scheme that minimizes the information outage probability. This scheme can be interpreted as the concatenation of an optimal code for the AWGN channel without fading to an optimal beamformer. For this optimal scheme we evaluate minimum-outage-probability and delay-limited capacity. Among other results, we prove that, for the fairly general class of regular fading channels, the asymptotic delay-limited capacity slope, expressed in bit/s/Hz per dB of transmit SNR, is proportional to min(t; r) and independent of the number of fading blocks M. Since M is a measure of the time diversity (induced by interleaving) or of the frequency diversity of the system, this result shows that, if channel-state information is available also to the transmitter, very high rates with asymptotically small error probabilities are achievable without need of deep interleaving or high frequency diversity. Moreover, for a large number of antennas the delay-limited capacity approaches the ergodic capacity.

Systèmes de Communication
Eurecom Ref:
© 2001 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
See also: