By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yang Yang ; National Key Laboratory of Science and Technology on Communications, University of Electronic Science and Technology of China, 611731, Chengdu, Sichuan, China ; Xun Luo ; Shaoqian Li

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.

Published in:

IEEE Communications Letters  (Volume:15 ,  Issue: 12 )