A Low Complexity Capacity-Greedy User Selection Scheme for Zero-Forcing Beamforming
The authors address the user selection scheme in multi-user wireless communication system, utilizing zero-forcing beamforming for spatial division multiple access. Recently, it has been shown that multi-user scheduling can help to achieve significant throughput gain in addition to the MIMO spatial multiplexing gain. And the capacity-greedy user selection algorithm can achieve near-optimal performance with much lower complexity compared with exhaustive search, due to reduced trial times of possible user combinations. However, the computational complexity may be still too high for feasible applications, which depends on the system bandwidth, the number of active users and the number of antennas.