A Fast Scheduling Algorithm for Multiple User MIMO-MRC System

Abstract

When multiple users share the same channel at one time, 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. The object to select the users in the best group is to select the users with the maximum sum capacity. Because of the co-channel interferences among the users, user in the best group is often not the user with the best channel quality when only does it transmit to the base station. As for a scheduling algorithm, exhaustive algorithm is to search the whole possibilities of the user group and is an approach that can get the largest capability of the system by multi-user scheduling. However, this algorithm is quite complex and usually brings huge workload to a base station with multiple antennas, hence the cost of operation to a base station has substantially increased. We propose a fast user selection algorithm with low complexity to reduce the computational complexity of the scheduling algorithm. From the simulation results, this algorithm not only decreases the computational complexity of the scheduling algorithm but also retains large capability of the MIMO system.