MU-MIMO系统中一种低复杂度的用户选择算法

In a downlink MUMIMO system with a large number of users, the base-station may select a subset of users to serve in order to maximize the total throughput. The brute-force search for the optimal user set, however, is computationally prohibitive. We propose a low complexity suboptimal users election arithmetic, based on orthogonal codebook. We show that the proposed algorithm achieves nearly the total throughput of the complete search method in simulations.