Low Complexity MIMO Scheduling with Block Diagonalization Using Capacity Lower-Bound

This letter presents a low complexity user scheduling algorithm based on the capacity lower-bound in the downlink of MU-MIMO systems. The basic principle is to make sure that the maximal capacity lower-bound can be achieved. Furthermore, it relies mainly on matrix multiplication operation to schedule users, thus with lower complexity. Simulation results show that the new technique can effectively increase the sum capacity.