Cart (Loading....) | Create Account
Close category search window
 

Low Complexity Scheduling Technique for Multi-User MIMO Systems

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
$31 $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

4 Author(s)
Chaoyuan Lv ; Inst. of Commun. Eng., PLA Univ. of Sci. & Technol., Nanjing ; Shidong Zhou ; Yunzhou Li ; Tingchang Wang

A novel low complexity scheduling algorithm was proposed for multi-user MIMO downlink channels. Considering the scenario that zero-forcing beamforming is employed at the base station, the number of simultaneously supportable users is limited by the number of transmit antennas at base station and user receive antennas. Thus the base station may select a subset of users to serve. Exhaustive search for the optimal user set, however, is computationally prohibitive. Based on the orthogonal projection operators of subspaces, we proposed a sub-optimal user selection algorithm using the distance metric between subspaces spanned by the vectors of users' channels. Furthermore, an equivalent version of this algorithm was presented after proving the equivalence between the distance metric and the correlation metric. Simulation results show that this algorithm performs very close to the capacity-based algorithm with much lower computational complexity.

Published in:

Vehicular Technology Conference, 2008. VTC Spring 2008. IEEE

Date of Conference:

11-14 May 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.