Rate-Maximizing Multiuser Scheduling for Parallel Channel Access

TitleRate-Maximizing Multiuser Scheduling for Parallel Channel Access
Publication TypeJournal Article
Year of Publication2007
AuthorsMa, Y., D. Zhang, and R. Schober
JournalSignal Processing Letters, IEEE
Volume14
Pagination441 -444
Date Publishedjul.
ISSN1070-9908
Keywords1D optimal waterfilling power allocation, 2D optimal waterfilling, channel allocation, diversity reception, equal power allocation, fading chanels, fading channels, generalized selection multiuser diversity, multiuser channels, NP-hard problem, optimal multiuser scheduling, optimisation, parallel channel access, scheduling
Abstract

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.

URLhttp://dx.doi.org/10.1109/LSP.2006.891343
DOI10.1109/LSP.2006.891343

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2020 The University of British Columbia