The total throughput of the communication system can be maximized by allocating the common radio resource to the user or the user group having the best channel quality at a given time and the multiuser diversity gain can be obtained when multiple users share the same channel at one time. The object to select the users is to select the users with the maximum sum capacity. As for a scheduling algorithm, exhaustive algorithm can get the largest capability of the system by multi-user scheduling. However, this algorithm is quite complex hence the cost of operation to a base station has substantial increased. We compare the multiuser performance of two fast user selection algorithms with low complexity in MIMO-MRC systems with co-channel interferences. From the simulation results, these two algorithms not only decrease the computational complexity of the scheduling algorithm but also retain large capability of the MIMO system.
Sum-capacity of multiple-write noisy memory