检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王丹[1,2] 杨雪松 WANG Dan;YANG Xuesong(School of Communication and Information Engineering,Chongqing University of Posts and Telecommunications Chongqing 400065;Chongqing Key Laboratory of Mobile Communication Technology,Chongqing University of Posts and Telecommunications Chongqing 400065)
机构地区:[1]重庆邮电大学通信与信息工程学院,重庆400065 [2]重庆邮电大学移动通信技术重庆市重点实验室,重庆400065
出 处:《无线通信技术》2024年第2期17-23,28,共8页Wireless Communication Technology
基 金:重庆市自然科学基金(No.cstc2021jcyj-msxmX0454)。
摘 要:针对智能反射面(IntelligentReflectingSurface,IRS)联合主动和被动波束成形优化中计算复杂度过高的问题,该文基于经典的半正定松弛算法和交替优化算法提出了一种对本地IRS进行分组的新模型,通过降低每个IRS信道矩阵的秩来降低优化算法的复杂度。具体的,首先通过已知的IRS相位得出BS(Base Station)的次优发送波束,其次通过BS的发送波束计算得出分组后各IRS面的次优相位,经过不断交替迭代上述两步优化得出最优发送波束的结果。仿真结果表明,合适的IRS分组数量、分组方式与交替优化迭代次数可以在几乎不影响原算法性能的情况下,大大减少交替优化算法的复杂度。The paper proposes a new model for grouping local Intelligent Reflecting Surfaces(IRS)to reduce the computational complexity of joint active and passive beamforming optimization.The model is based on classical semi-definite relaxation algorithms and alternating optimization algo⁃rithms.Specifically,the paper first obtains the suboptimal transmission beam of the Base Station(BS)through the known IRS phase,and then calculates the suboptimal phase of each IRS surface af⁃ter grouping through the BS transmission beam.The optimal transmission beam is obtained by itera⁃tively optimizing the above two steps.Simulation results show that an appropriate number of IRS groups,grouping methods,and iteration times can greatly reduce the computational complexity of the alternating optimization algorithm without significantly affecting its performance.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.144.149.217