TY - JOUR
T1 - On Multiple Users Scheduling Using Superposition Coding over Rayleigh Fading Channels
AU - Zafar, Ammar
AU - Alnuweiri, Hussein
AU - Shaqfeh, Mohammad
AU - Alouini, Mohamed-Slim
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2013/2/19
Y1 - 2013/2/19
N2 - In this letter, numerical results are provided to
analyze the gains of multiple users scheduling via superposition
coding with successive interference cancellation in comparison
with the conventional single user scheduling in Rayleigh blockfading
broadcast channels. The information-theoretic optimal
power, rate and decoding order allocation for the superposition
coding scheme are considered and the corresponding histogram
for the optimal number of scheduled users is evaluated. Results
show that at optimality there is a high probability that only two
or three users are scheduled per channel transmission block.
Numerical results for the gains of multiple users scheduling in
terms of the long term throughput under hard and proportional
fairness as well as for fixed merit weights for the users are
also provided. These results show that the performance gain of
multiple users scheduling over single user scheduling increases
when the total number of users in the network increases, and it
can exceed 10% for high number of users
AB - In this letter, numerical results are provided to
analyze the gains of multiple users scheduling via superposition
coding with successive interference cancellation in comparison
with the conventional single user scheduling in Rayleigh blockfading
broadcast channels. The information-theoretic optimal
power, rate and decoding order allocation for the superposition
coding scheme are considered and the corresponding histogram
for the optimal number of scheduled users is evaluated. Results
show that at optimality there is a high probability that only two
or three users are scheduled per channel transmission block.
Numerical results for the gains of multiple users scheduling in
terms of the long term throughput under hard and proportional
fairness as well as for fixed merit weights for the users are
also provided. These results show that the performance gain of
multiple users scheduling over single user scheduling increases
when the total number of users in the network increases, and it
can exceed 10% for high number of users
UR - http://hdl.handle.net/10754/269853
UR - http://ieeexplore.ieee.org/document/6464495/
UR - http://www.scopus.com/inward/record.url?scp=84877580422&partnerID=8YFLogxK
U2 - 10.1109/LCOMM.2013.021213.122465
DO - 10.1109/LCOMM.2013.021213.122465
M3 - Article
SN - 1089-7798
VL - 17
SP - 733
EP - 736
JO - IEEE Communications Letters
JF - IEEE Communications Letters
IS - 4
ER -