Abstract
In this paper, we propose two new threshold based parallel multiuser scheduling schemes, namely (i) an on-off based scheduling (OOBS) scheme and (ii) a switched based scheduling (SBS) scheme. The objective is to reduce the complexity of implementation without a considerable performance loss in comparison with conventional selection based scheduling. While the OOBS scheme schedules all the users with an SNR above a fixed preselected signal to noise ratio (SNR) threshold, the SBS scheme schedules only the K <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</sub> users with an acceptable SNR if there are enough acceptable users. Otherwise, the scheduler selects the best K <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</sub> users. We analyze statistical characteristics and performances of these proposed schemes. Numerical results show that the proposed schemes can offer some decrease in the average feedback load without an important degradation in average bit error rate and average spectral efficiency.
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.
