论文标题

多IRS的合作多光束路由大量MIMO

Cooperative Multi-Beam Routing for Multi-IRS Aided Massive MIMO

论文作者

Mei, Weidong, Zhang, Rui

论文摘要

设想智能反射表面(IRS)在未来的无线通信系统中发挥重要作用,这要归功于其实现智能和可重新配置的无线电环境的强大能力。在本文中,我们研究了大量多输入多输出(MIMO)系统中的多IRS辅助下行链路通信,在该系统中,多ANT-ANTENNA BS同时为多个IRS反映的正交光束提供了多个远程单人体用户。通过利用每对选定的IRS之间的视线(LOS)链接,可以通过其协作梁路由在BS和每个用户之间建立多跳级别的LOS链接。在此设置下,我们为每个用户优化了所选的IRS及其梁路由路径,以及BS/IRS主动/被动光束成型,以使所有用户之间接收到的最小信号功率最大化,以避免使用新的多光束路由路径分离约束,以避免使用Inter-user/outer路线干扰。为了解决此问题,我们首先在任何给定的梁路由下以封闭形式的主动/无源光束得出最佳的BS/IRS,并通过将其作为等效的图形优化问题来显示NP组件是NP完整的。为了解决这个具有挑战性的问题,我们提出了一种有效的递归算法,以部分列举可行的解决方案,从而通过调整其设计参数来有效地平衡性能复杂性权衡。数值结果表明,所提出的算法可以以低枚举复杂性实现近乎最佳的性能,并且表现优于其他基准方案。

Intelligent reflecting surface (IRS) is envisioned to play a significant role in future wireless communication systems thanks to its powerful capability of enabling smart and reconfigurable radio environment. In this paper, we study the multi-IRS aided downlink communication in a massive multiple-input multiple-output (MIMO) system, where a multi-antenna BS simultaneously serves multiple remote single-antenna users with orthogonal beams reflected by multiple IRSs. By exploiting the line-of-sight (LoS) link between each pair of selected IRSs, a multi-hop cascaded LoS link can be established between the BS and each user via their cooperative beam routing. Under this setup, we optimize the selected IRSs and their beam routing path for each user, along with the BS/IRS active/passive beamforming such that the minimum received signal power among all users is maximized, subject to a new multi-beam routing path separation constraint for avoiding the inter-user/route interference. To tackle this problem, we first derive the optimal BS/IRS active/passive beamforming in closed-form for any given beam routes and show the beam routing optimization is NP-complete by recasting it as an equivalent graph-optimization problem. To solve this challenging problem, we then propose an efficient recursive algorithm to partially enumerate the feasible solutions, which effectively balances the performance-complexity trade-off by tuning its design parameter. Numerical results demonstrate that the proposed algorithm can achieve near-optimal performance with low enumeration complexity and also outperform other benchmark schemes.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源