Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

A graph theory based scheduling algorithm For MIMO-CDMA systems using zero forcing beamforming

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. du Quebec a Montreal, Montreal, QC ; Ajib, W.

We propose efficient scheduling algorithms for down-link MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Based on a graph theoretical approach, we propose to represent the system as a graph and to formulate the scheduling problem as the maximum weight k-colorable subgraph problem. The proposed algorithms make use of two heuristic solutions to find the scheduled users in each time slot in an acceptable polynomial time. We evaluate the efficiency of the proposed schedulers and the results demonstrates that it can achieve near-optimal performance with very low complexity compared to the optimal exhaustive search.

Published in:

Computers and Communications, 2008. ISCC 2008. IEEE Symposium on

Date of Conference:

6-9 July 2008