On Beamforming with Finite Rate Feedback in Multiple Antenna Systems
Mukkavilli, Krishna Kiran; Sabharwal, Ashutosh; Erkip, Elza; Aazhang, Behnaam
In this paper, we study a multiple antenna system where the transmitter is equipped with quantized information about instantaneous channel realizations. Assuming that the transmitter uses the quantized information for beamforming, we derive a universal lower bound on the outage probability for any finite set of beamformers. The universal lower bound provides a concise characterization of the gain with each additional bit of feedback information regarding the channel. Using the bound, it is shown that finite information systems approach the perfect information case as (t-1)2<sup>-B/(t-1)</sup>, where <i>B</i> is the number of feedback bits and <i>t</i> is the number of transmit antennas. The geometrical bounding technique, used in the proof of the lower bound, also leads to a design criterion for good beamformers, whose outage performance approaches the lower bound. The design criterion minimizes the maximum inner product between any two beamforming vectors in the beamformer codebook, and is equivalent to the problem of designing unitary space time codes under certain conditions. Finally, we show that good beamformers are good packings of 2-dimensional subspaces in a 2<i>t</i>-dimensional real Grassmannian manifold with chordal distance as the metric.