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

Simplified Fair Scheduling and Antenna Selection Algorithms for Multiuser MIMO Orthogonal Space-Division Multiplexing Downlink

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

2 Author(s)
Sigdel, S. ; Dept. of Electr. & Comput. Eng., Univ. of Alberta, Edmonton, AB ; Krzymien, W.A.

We consider the downlink of a multiuser multiple-input multiple-output (MIMO) system, where the base station and the mobile receivers are equipped with multiple antennas. We propose simplified algorithms for channel-aware multiuser scheduling in conjunction with receive antenna selection for two downlink multiuser orthogonal space-division multiplexing techniques: block diagonalization and successive optimization. The algorithms greedily maximize the weighted sum rate. The algorithms add the best user at a time from the set of users that are not selected yet to the set of selected users until the desired number of users has been selected. To apply the proportional fairness criterion, simplified user scheduling metrics are proposed for block diagonalization and successive optimization. Two receive antenna selection algorithms are also proposed, which further enhance the power gain of the equivalent single-user channel after orthogonal precoding by selecting a subset of the receive antennas that contributes the most toward the total power gain of the channel. A user grouping technique is used to further lower the complexity of the selection algorithms. We compare various multiuser MIMO scheduling strategies that are applied to block diagonalization and successive optimization transmission techniques through simulation. Simulation results demonstrate the effectiveness of the proposed algorithms in ensuring throughput fairness among users. Results also show that when the number of users is large, the proposed scheduling algorithms perform close to the exhaustive search algorithms and previously proposed greedy scheduling algorithms, but with much lower complexity.

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:58 ,  Issue: 3 )

Date of Publication:

March 2009

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.