On downlink beamforming with greedy user selection: performance analysis and a simple new algorithm
University of Minnesota · Technical University of Crete
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.…
Citation impact
- FWCI
- 39.19
- Percentile
- 100%
- References
- 24
Authors
2Topics & keywords
- Beamforming
- Computer science
- Telecommunications link
- Precoding
- Rayleigh fading
- Greedy algorithm
- Throughput
- Computational complexity theory