Low Complexity Scheduling Technique for Multi-User MIMO Systems

A Scheduling Technique for the Downlink of Multiuser MIMO Channels

“…At each step, the revised distance metric is used to pick out the optimal user and the computational complexity is also greatly reduced. Moreover, the system throughput obtained by this strategy is very close to that obtained by the algorithms proposed in [6] and outperforms that of the algorithms proposed in [7] and [8]. (2) where T and * denote matrix transpose and complex conjugate transpose, respectively, k P is the transmit power for the th k user.…”

“…The proposed algorithm is a complementary way of the Frobenius norm-based algorithm, the former emphasizes on the uncorrelation of the users' channels, and the overall energy of the channels is stressed in the later. Although the algorithms of [7] and [8] have lower computational complexity than the proposed one, the system throughputs obtained by them are not so close to that of the capacity-based algorithm. This can be verified in the next section.…”

“…Using this distance metric, the author proposed a low complexity user selection algorithm in [8]. In this algorithm, each user's channel vectors span a subspace.…”

“…The algorithm selects the user who has the maximum sum distance. This revised algorithm can achieve higher system throughput than the algorithm proposed in [8]. The criterion can be formulated as follows:…”

“…The author proposed a sub-optimal scheduling algorithm using the distance metric between subspaces spanned by the vectors of users' channels in [8]. This algorithm greatly reduced the computational complexity compared with the algorithms in [6].…”