TY - JOUR
T1 - The ergodic capacity of the multiple access channel under distributed scheduling - Order optimality of linear receivers
AU - Kampeas, Joseph
AU - Cohen, Asaf
AU - Gurewitz, Omer
N1 - Funding Information:
Manuscript received January 27, 2017; revised October 9, 2017; accepted January 24, 2018. Date of publication February 19, 2018; date of current version July 12, 2018. This work was supported in part by the European Union Horizon 2020 Research and Innovation Programme SUPERFLUIDITY under Grant 671566 and in part by the Israeli MOITAL NEPTUN Consortium. This paper was presented in part at the proceedings of the 2013 ITW and at the proceedings of 2014 ITW.
Publisher Copyright:
© 1963-2012 IEEE.
PY - 2018/8/1
Y1 - 2018/8/1
N2 - Consider the problem of a multiple-input multiple-output multiple-access channel at the limit of large number of users. Clearly, in practical scenarios, only a small subset of the users can be scheduled to utilize the channel simultaneously. Thus, a problem of user selection arises. However, since solutions which collect channel state information from all users and decide on the best subset to transmit in each slot do not scale when the number of users is large, distributed algorithms for user selection are advantageous. In this paper, we analyze a distributed user selection algorithm, which selects a group of users to transmit without coordinating between users and without all users sending CSI to the base station. This threshold-based algorithm is analyzed for both zero-forcing and minimum mean square error receivers, and its expected sum rate in the limit of large number of users is investigated. It is shown that for large number of users, it achieves the same scaling laws as the optimal centralized scheme.
AB - Consider the problem of a multiple-input multiple-output multiple-access channel at the limit of large number of users. Clearly, in practical scenarios, only a small subset of the users can be scheduled to utilize the channel simultaneously. Thus, a problem of user selection arises. However, since solutions which collect channel state information from all users and decide on the best subset to transmit in each slot do not scale when the number of users is large, distributed algorithms for user selection are advantageous. In this paper, we analyze a distributed user selection algorithm, which selects a group of users to transmit without coordinating between users and without all users sending CSI to the base station. This threshold-based algorithm is analyzed for both zero-forcing and minimum mean square error receivers, and its expected sum rate in the limit of large number of users is investigated. It is shown that for large number of users, it achieves the same scaling laws as the optimal centralized scheme.
KW - Ergodic capacity
KW - distributed scheduling
KW - multi-access channel
KW - zero-forcing and MMSE detection
UR - http://www.scopus.com/inward/record.url?scp=85042199966&partnerID=8YFLogxK
U2 - 10.1109/TIT.2018.2807484
DO - 10.1109/TIT.2018.2807484
M3 - Article
AN - SCOPUS:85042199966
SN - 0018-9448
VL - 64
SP - 5898
EP - 5919
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 8
ER -