TY - GEN
T1 - Low complexity fair user scheduling employing spatial orthogonality for mu-MIMO systems
AU - Maung, Ei Nandar
AU - Shimbo, Yukiko
AU - Suganuma, Hirofumi
AU - Maehara, Fumiaki
PY - 2019/4
Y1 - 2019/4
N2 - This paper proposes a low complexity fair user scheduling method employing semi-orthogonal user selection (SUS) for multi-user multiple-input multi-output (MU-MIMO) systems. The intent of the proposed approach is to consider the spatial orthogonality of users into fair user scheduling of the MU-MIMO system, which enhances the system capacity when compared to the traditional round robin (RR) based user scheduling. In the proposed method, the spatial orthogonality is calculated based on SUS which only requires the calculation of inner products among the channel state information (CSI). Therefore, both the improvement of the system capacity and fairness can be achieved with a reduced computational load. Moreover, in contrast to proportional fairness (PF), the proposed user scheduling does not require the heavy calculation of all possible user combinations as is required in MU-MIMO precoding, which is an effective and practical approach. The effectiveness of the proposed method is demonstrated and compared with RR and PF in terms of fairness and computational load.
AB - This paper proposes a low complexity fair user scheduling method employing semi-orthogonal user selection (SUS) for multi-user multiple-input multi-output (MU-MIMO) systems. The intent of the proposed approach is to consider the spatial orthogonality of users into fair user scheduling of the MU-MIMO system, which enhances the system capacity when compared to the traditional round robin (RR) based user scheduling. In the proposed method, the spatial orthogonality is calculated based on SUS which only requires the calculation of inner products among the channel state information (CSI). Therefore, both the improvement of the system capacity and fairness can be achieved with a reduced computational load. Moreover, in contrast to proportional fairness (PF), the proposed user scheduling does not require the heavy calculation of all possible user combinations as is required in MU-MIMO precoding, which is an effective and practical approach. The effectiveness of the proposed method is demonstrated and compared with RR and PF in terms of fairness and computational load.
UR - http://www.scopus.com/inward/record.url?scp=85071488472&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85071488472&partnerID=8YFLogxK
U2 - 10.1109/ICT.2019.8798834
DO - 10.1109/ICT.2019.8798834
M3 - Conference contribution
AN - SCOPUS:85071488472
T3 - 2019 26th International Conference on Telecommunications, ICT 2019
SP - 437
EP - 441
BT - 2019 26th International Conference on Telecommunications, ICT 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 26th International Conference on Telecommunications, ICT 2019
Y2 - 8 April 2019 through 10 April 2019
ER -