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系统的总和性能;我们考虑使用以网络为中心的集成法来降低对无细胞系统应用的技术的计算复杂性;然后我们开发一种贪婪的算法,考虑为预定的用户子集选择多个候选人,并接近最佳的彻底搜索;我们用相同的覆盖区评估多细胞网络和无细胞网络的拟议和现有排成算法;数字结果说明拟议的排期算法相对于现有方法的总和性能。</s>