Title :
Low Complexity MIMO Scheduling with Block Diagonalization Using Capacity Lower-Bound
Author :
Yang, Yang ; Luo, Xun ; Li, Shaoqian
Author_Institution :
Nat. Key Lab. of Sci. & Technol. on Commun., Univ. of Electron. Sci. & Technol. of China, Chengdu, China
fDate :
12/1/2011 12:00:00 AM
Abstract :
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.
Keywords :
MIMO communication; matrix multiplication; multi-access systems; scheduling; MU-MIMO systems; block diagonalization; capacity lower-bound; low complexity MIMO scheduling; matrix multiplication; user scheduling; Complexity theory; Downlink; MIMO; Optimal scheduling; Receiving antennas; Scheduling algorithm; User scheduling; capacity lower-bound; downlink; multiuser multiple-input multiple-output (MU-MIMO);
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/LCOMM.2011.100611.111249
