基于修正牛顿法的大规模MIMO低复杂度混合预编码算法  

Low complexity hybrid precoding algorithm for massive MIMO based on modified Newton method

作　　者：胡博 王安定[1] 魏贵义 HU Bo;WANG Anding;WEI Guiyi(School of Information and Electronic Engineering,Zhejiang Gongshang University,Hangzhou 310018,China)

机构地区：[1]浙江工商大学信息与电子工程学院,浙江杭州310018

出　　处：《电信科学》2023年第11期80-95,共16页Telecommunications Science

基　　金：浙江省自然科学基金资助项目(No.LY22F010013)

摘　　要：针对大规模多输入多输出(multiple-input multiple-output,MIMO)系统,提出了一种基于修正牛顿(modifiedNewton,MN)法的相位跟踪算法,有效地解决了传统高性能混合预编码方案中的高计算复杂度问题。该算法从子维度向量恢复的角度优化模拟预编码矩阵。在每个子维度优化中,采用相位跟踪方法将模拟预编码向量的恢复转化为无约束的非线性优化问题,并利用MN法进行求解。同时,应用Gerschgorin’s Disk定理和Hermitian矩阵分块求逆引理,分别降低了MN法中计算修正因子以及Hessian矩阵求逆的计算复杂度。实验结果表明,与仿真中几种传统的高性能混合预编码方案相比,所提算法具有更高的频谱效率和更低的计算复杂度。A phase tracking algorithm was proposed for massive multiple-input multiple-output(MIMO)systems based on the modified Newton(MN)method,which effectively reduced the high computational complexity in traditional high-performance hybrid precoding schemes.The algorithm optimized the analog precoding matrix from the perspective ofsub-dimensional vector recovery.In each sub-dimension optimization,the phase tracking method was used to transform the recovery of the analog precoding vectors into an unconstrained nonlinear optimization problem,which was then solved using the MN method.Concurrently,this strategy led to a marked reduction in the computa-tional intricacy pertaining to both the computation of correction factors and the inversion of the Hessian matrix within the framework of the MN method.This was achieved through the insightful incorporation of Gerschgorin’s Disk theorem and the Hermitian matrix block-inverse lemma.Simulation results show that the proposed algorithm has higher spectral efficiency and lower computational complexity than several conventional high-performance hybrid precoding schemes.

关 键 词：大规模MIMO 混合预编码 相位跟踪 修正牛顿法 

分 类 号：TN928[电子电信—通信与信息系统]