Performance Analysis of Optimum Zero-Forcing Beamforming with Greedy User Selection
arXiv:1307.5240 · doi:10.1109/LCOMM.2012.022112.112036
Abstract
In this letter, an exact performance analysis is presented on the sum rate of zero-forcing beamforming with a greedy user scheduling algorithm in a downlink system. Adopting water-filling power allocation, we derive a compact form for the joint probability density function of the scheduled users' squared subchannel gains when a transmitter with multiple antennas sends information to at most two scheduled users with each having a single antenna. The analysis is verified by numerical results.
4 pages, 2 figures