Abstract—This paper considers multicell scheduling for coordi5
nated multiple-input multiple-output cellular networks. In a mul6
ticell scenario, intercell interference, which is the major challenge
7 degrading system performance, can be suppressed via multicell
8 coordination. However, when the number of users is larger than
9 that can be served, user/multimode selection is necessary, and can
10 significantly enhance the performance in such interference-limited
11 environment. Nevertheless, user selection in a multicell scenario
12 incurs high computational complexity and overhead signalling.
13 To this end, in this paper, low complexity greedy algorithms are
14 proposed for user selection. The algorithms are based on the con15
cept of angle between subspaces and intersection of null spaces,
16 and work in partially distributed fashion with limited information
17 exchange. By these algorithms, channel feedback can be greatly
18 reduced with reasonable computational complexity. In addition,
19 multimode scheduling schemes are proposed for this multicell set
20 up,where the spatial streams are adaptively selected. The proposed
21 algorithms are analysed and compared with the optimal solution
22 obtained by exhaustive search. Simulation results show that the al23
gorithms achievemost of the throughput achievable by the optimal