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

Efficient Scheduling Algorithms for Multiantenna CDMA 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

2 Author(s)
Driouch, E. ; Dept. of Comput. Sci., Univ. of Quebec at Montreal, Montreal, QC, Canada ; Ajib, W.

In multiple-input-multiple-output (MIMO) multiuser systems, simultaneously serving multiple users achieves high data rates. However, high-performance transmit beamforming requires an adequately designed user-selection scheme. Optimal scheduling can be only obtained through a high computationally complex exhaustive search, and hence, low-complexity heuristic algorithms are required. In addition, employing a multiple-access scheme such as code division (CDMA) largely increases the complexity of optimal scheduling, and it becomes unemployable even for a moderate number of users and antennas. In this context, this paper proposes three heuristic scheduling algorithms for MIMO CDMA systems using zero-forcing beamforming (ZFBF). We use a graph-theoretical approach to model the system as a weighted undirected graph. The problem of user selection is then formulated as a graph coloring problem, namely, the maximum weight N-colorable subgraph problem. Then, we design two heuristics to solve this graph problem. The first algorithm is a low-complexity greedy algorithm. The second algorithm is based on a tabu search approach to resolve efficiently the complexity/performance tradeoff. Numerical and simulation results show the sub-optimal performances and robustness of the proposed low-complexity algorithms.

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:61 ,  Issue: 2 )

Date of Publication:

Feb. 2012

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.