On the throughput of opportunistic beamforming with imperfect CSI

  • Authors:
  • Ali Vakili;Amir F. Dana;Babak Hassibi

  • Affiliations:
  • California Institute of Technology (Caltech), Pasadena, CA;California Institute of Technology (Caltech), Pasadena, CA;California Institute of Technology (Caltech), Pasadena, CA

  • Venue:
  • IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The throughput of a multiple-antenna broadcast channel highly depends on the channel state information (CSI) at the transmitter side. However, due to the time variant nature of wireless channels, having perfect knowledge of the underlying links appears to be a questionable assumption, especially when the number of users and/or antennas increases. Although it can become computationally prohibitive in practice, theoretically any point on the capacity region of a Gaussian broadcast channel is achievable using dirty paper coding (DPC) if full CSI is available. The aforementioned drawbacks of DPC have motivated the development of simpler transmission strategies that require little CSI and yetcan deliver a large portion of the capacity. One such scheme is opportunistic beam-forming that is shown to be able to achieve the same throughput scaling as that of DPC for the regime of large number of users. In this paper we investigate the performance of opportunistic beam-forming when the perfect channel state information is not available; i.e., the channel estimation is erroneous. We will show that in order to maximize the throughput (sum rate capacity), the transmitter needs to back off the rate than what is suggested by the estimated channel state. We obtain the optimal back off and show that by using this modified opportunistic scheme, the same multiuser gain can be achieved.