On downlink beamforming with greedy user selection: performance analysis and a simple new algorithm

  • Authors:

  • G. Dimic;N.D. Sidiropoulos

  • Affiliations:

  • Minnesota Univ., Minneapolis, MN, USA;-

  • Venue:
  • IEEE Transactions on Signal Processing - Part I
  • Year:
  • 2005

Quantified Score

Hi-index 0.14

Visualization

Abstract

This paper considers the problem of simultaneous multiuser downlink beamforming. The idea is to employ a transmit antenna array to create multiple "beams" directed toward the individual users, and the aim is to increase throughput, measured by sum capacity. In particular, we are interested in the practically important case of more users than transmit antennas, which requires user selection. Optimal solutions to this problem can be prohibitively complex for online implementation at the base station and entail so-called Dirty Paper (DP) precoding for known interference. Suboptimal solutions capitalize on multiuser (selection) diversity to achieve a significant fraction of sum capacity at lower complexity cost. We analyze the throughput performance in Rayleigh fading of a suboptimal greedy DP-based scheme proposed by Tu and Blum. We also propose another user-selection method of the same computational complexity based on simple zero-forcing beamforming. Our results indicate that the proposed method attains a significant fraction of sum capacity and throughput of Tu and Blum's scheme and, thus, offers an attractive alternative to DP-based schemes.