Multi-user Grouping Based Scheduling Algorithm in Massive MIMO Uplink Networks

Massive Multiple-Input Multiple-Output (MIMO) system, in which base station (BS) is equipped with a large number of antennas, makes it possible to serve many users in the same time-frequency block by multi-user (MU) scheduling. However, it still faces a lot of challenges, especially the high computational complexity caused by the high dimension matrix operation for user selection. Grouping based scheduling algorithm is a good way to solve the high complexity problem, that is, all the users are divided into several groups and scheduled based on the grouping result. In this paper, we focus on the uplink MU scheduling in massive MIMO system and propose a new grouping based scheduling algorithm. In the grouping process, all the resource blocks (RBs) are divided into several segments, and then each user is grouped into a most suitable segment based on channel condition and the number of users in each group. In the scheduling process, each group schedules users separately on the basis of proportional fairness (PF) principle and correlation of channel between the scheduled users. Analysis and simulation results show that our algorithm presents a good performance with low complexity.