In this work, we investigate the sum-rate performance of multicell and cell-free massive MIMO systems using linear precoding and multiuser scheduling algorithms. We consider the use of a network-centric clustering approach to reduce the computational complexity of the techniques applied to the cell-free system. We then develop a greedy algorithm that considers multiple candidates for the subset of users to be scheduled and that approaches the performance of the optimal exhaustive search. We assess the proposed and existing scheduling algorithms in both multicell and cell-free networks with the same coverage area. Numerical results illustrate the sum-rate performance of the proposed scheduling algorithm against existing approaches.

翻译：本文研究采用线性预编码和多用户调度算法时，多小区与无蜂窝大规模MIMO系统的和速率性能。我们采用网络中心聚类方法以降低应用于无蜂窝系统的技术计算复杂度。随后，我们开发了一种贪婪算法，该算法考虑待调度用户子集的多个候选方案，并逼近最优穷举搜索的性能。我们在覆盖区域相同的多小区与无蜂窝网络中对所提算法及现有调度算法进行评估。数值结果表明，相较于现有方法，所提调度算法在系统总速率方面具有更优性能。