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

Rate-Maximizing Multiuser Scheduling for Parallel Channel Access

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

3 Author(s)
Yao Ma ; Iowa State Univ., Iowa ; Dongbo Zhang ; Schober, R.

Optimal multiuser scheduling which maximizes the sum rate for parallel channel access often involves an NP-hard design problem. In this letter, we propose a low-complexity optimal solution using a two-step procedure: (1) generalized selection multiuser diversity (GSMuD) which ranks the channels of a total of users and selects the users with the largest signal-to-noise ratios (SNRs) for channel access and (2) optimal power allocation for the selected users. Besides the equal power allocation (EPA), two optimal power allocation algorithms for the GSMuD are derived, namely: (1) 1D optimal waterfilling (WF) power allocation along the channels given a fixed total power at each time slot and (2) 2D optimal WF along both the time and the channels given the average total power. Accurate performance analyses of the above schemes are provided. Numerical results show that the 2D WF power allocation yields the highest rate, while the EPA is near-optimal for many cases of practical interest.

Published in:

Signal Processing Letters, IEEE  (Volume:14 ,  Issue: 7 )

Date of Publication:

July 2007

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.