论文标题
关于IRS辅助的多群多播系统的可实现率
On the Achievable Rate of IRS-Assisted Multigroup Multicast Systems
论文作者
论文摘要
在许多潜在用例中，智能反射表面（IRS）显示出巨大的优势，因此被认为是下一代无线系统的有前途的候选人。在本文中，我们考虑了多输入单输出（MISO）方案中的IRS辅助多群多播（IRS-MGMC）系统，其中相关的现有文献相当有限。特别是，我们旨在共同设计发射光束形成器和IRS相移，以最大化所考虑的系统的总和速率。为了获得针对公式的非凸优化问题的数值有效的解决方案，我们提出了一种交替的投影梯度（APG）方法，在该方法中，每种迭代都构成封闭形式，并且被证明比已知的解决方案优于大分化 - 最小化（MM）方法，该方法既可以根据可观的总和率和所需的复杂性，即运行时间，即运行时间。特别是，我们表明所提出的APG方法的复杂性随IRS瓷砖的数量线性增长，而相比之下的已知解决方案的复杂性随IRS瓷砖数量的第三强度而增长。本文报道的数值结果扩展了我们对大型IRS辅助多群多播系统可实现率的理解。
Intelligent reflecting surfaces (IRSs) have shown huge advantages in many potential use cases and thus have been considered a promising candidate for next-generation wireless systems. In this paper, we consider an IRS-assisted multigroup multicast (IRS-MGMC) system in a multiple-input single-output (MISO) scenario, for which the related existing literature is rather limited. In particular, we aim to jointly design the transmit beamformers and IRS phase shifts to maximize the sum rate of the system under consideration. In order to obtain a numerically efficient solution to the formulated non-convex optimization problem, we propose an alternating projected gradient (APG) method where each iteration admits a closed-form and is shown to be superior to a known solution that is derived from the majorization-minimization (MM) method in terms of both achievable sum rate and required complexity, i.e., run time. In particular, we show that the complexity of the proposed APG method grows linearly with the number of IRS tiles, while that of the known solution in comparison grows with the third power of the number of IRS tiles. The numerical results reported in this paper extend our understanding on the achievable rates of large-scale IRS-assisted multigroup multicast systems.
