Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published June 1, 2002 | public
Journal Article Open

Multiple-antennas and isotropically random unitary inputs: the received signal density in closed form

Abstract

An important open problem in multiple-antenna communications theory is to compute the capacity of a wireless link subject to flat Rayleigh block-fading, with no channel-state information (CSI) available either to the transmitter or to the receiver. The isotropically random (i.r.) unitary matrix-having orthonormal columns, and a probability density that is invariant to premultiplication by an independent unitary matrix-plays a central role in the calculation of capacity and in some special cases happens to be capacity-achieving. We take an important step toward computing this capacity by obtaining, in closed form, the probability density of the received signal when transmitting i.r. unitary matrices. The technique is based on analytically computing the expectation of an exponential quadratic function of an i.r. unitary matrix and makes use of a Fourier integral representation of the constituent Dirac delta functions in the underlying density. Our formula for the received signal density enables us to evaluate the mutual information for any case of interest, something that could previously only be done for single transmit and receive antennas. Numerical results show that at high signal-to-noise ratio (SNR), the mutual information is maximized for M=min(N, T/2) transmit antennas, where N is the number of receive antennas and T is the length of the coherence interval, whereas at low SNR, the mutual information is maximized by allocating all transmit power to a single antenna.

Additional Information

© Copyright 2002 IEEE. Reprinted with permission. Manuscript received March 7, 2001; revised November 2, 2001. [Posted online: 2002-08-07] The material in this paper was presented in part at the IEEE International Symposium on Information Theory, Washington DC, June 2001. The authors would like to thank the editor and reviewers for useful comments that led to the improvement of this paper.

Files

HASieeetit02b.pdf
Files (498.6 kB)
Name Size Download all
md5:da4c68e9140f9d9689e8c82f67da5551
498.6 kB Preview Download

Additional details

Created:
August 21, 2023
Modified:
March 5, 2024