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, unveil the compelling properties of the DPC sum rate optimization in beamspace massive MIMO and exploit them for substantially simplifying the problem. We also develop three algorithms for solving the simplified problem, each having its unique merits. Furthermore, 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)引入联合用户和梁选择问题,在大型百万兆米中公布DPC总速率优化的强制特性,并利用它们大大简化问题。我们还开发了三种解决简化问题的算法,每一种都有其独特的优点。此外,我们得出了算法的总和率,并分析了其复杂性。我们的模拟结果验证了拟议设计和分析的有效性,确认了其优于先前的解决办法。