Abstract
In this paper, we study the optimal power allocation for orthogonal parallel-access scheduling schemes. We propose and study a parallel access scheme called generalized selection multiuser diversity (GSMuD), which ranks the channels of a total of <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">L</i> users and selects the <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">L</i> <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">c</sub> users with the largest signal-to-noise ratios (SNRs) for channel access. Besides the equal power allocation (EPA), two optimal power allocation algorithms are designed for the selected users in the GSMuD, namely (i) one- dimensional (1-D) optimal waterfilling (WF) power allocation along the channels given a fixed total power at each time slot; and (ii) two-dimensional (2-D) optimal WF along both the time and the channels given a fixed average total power. Accurate performance analyses of the above schemes are provided. Numerical results show that the 2-D WF power allocation yields the largest sum rate, while the EPA is near-optimal for many cases of practical interest.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
