Beamspace millimeter-wave (mmWave) and terahertz (THz) massive MIMO constitute attractive schemes for next-generation communications, given their abundant bandwidth and high throughput. However, their user and beam selection problem has to be efficiently addressed. Inspired by this challenge, we develop low-complexity solutions explicitly. We introduce the dirty paper coding (DPC) into the joint user and beam selection problem. We unveil the compelling properties of the DPC sum rate in beamspace massive MIMO, showing its monotonic evolution against the number of users and beams selected. We then exploit its beneficial properties for substantially simplifying the joint user and beam selection problem. Furthermore, we develop a set of algorithms striking unique trade-offs for solving the simplified problem, facilitating simultaneous user and beam selection based on partial beamspace channels for the first time. Additionally, we derive the sum rate bound of the algorithms and analyze their complexity. Our simulation results validate the effectiveness of the proposed design and analysis, confirming their superiority over prior solutions.
翻译:宽宽带宽和高输送量,大型百万兆赫(Thz)巨型MIMO是下一代通信的诱人方案。然而,必须有效解决它们的用户和梁选择问题。受这项挑战的启发,我们开发了低复杂度的解决方案。我们把肮脏的纸张编码(DPC)引入了联合用户和梁选择问题。我们在大型百万兆姆(MIMO)中展示了DPC总和率的令人信服的特性,显示了其与所选用户和梁数的单调演变。我们随后利用其有益特性大大简化了联合用户和梁选择问题。此外,我们开发了一套算法,在解决简化问题、便利同时用户和首次根据部分光空空间渠道进行选择时,对独特的权衡取舍。此外,我们从算法中得出总和率,并分析其复杂性。我们的模拟结果验证了拟议设计和分析的有效性,确认了其优于先前的解决方案。