大规模MIMO系统中基于权重高斯赛德低复杂度ZF预编码方案  

A low complexity ZF precoding scheme based on weighted Gauss-Seidel in massive MIMO systems

作　　者：周冬 曹海燕[1] 许方敏[1] 方昕[1] 王秀敏[2] ZHOU Dong;CAO Haiyan;XU Fangmin;FANG Xin;WANG Xiumin(Hangzhou Dianzi University,Hangzhou 310018,China;China Jiliang University,Hangzhou 310018,China)

机构地区：[1]杭州电子科技大学,浙江杭州310018 [2]中国计量大学,浙江杭州310018

出　　处：《电信科学》2019年第3期69-75,共7页Telecommunications Science

基　　金：国家自然科学基金资助项目(No.61501158;No.61379027);浙江省自然科学基金资助项目(No.LY14F010019;No.LQ15F01004)~~

摘　　要：大规模MIMO系统中的传统ZF(zero forcing,迫零)预编码方法中由于存在厄米特矩阵求逆,其复杂度随着用户数的增多呈指数增加。针对这一问题,提出了一种基于权重高斯赛德(weighted Gauss-Seidel,WGS)的低复杂度全数字ZF预编码方案,即在高斯赛德(GS)的基础上,将传统GS算法迭代结果与上一步的迭代结果进行权重相加以加速迭代收敛,其权重因子通过最小均方和来确定,并且证明权重因子可使算法收敛。仿真结果表明,WGS算法通过极少的迭代次数即可逼近ZF预编码方案的性能,且将ZF预编码的复杂度从O(K^3)降低到O(K^2),其中, K为用户数。In massive MIMO systems,due to inversion of Hermitian matrix,the complexity of the traditional ZF precoding method increases exponentially with increase of the number of users. To solve this problem,a low complexity digital ZF precoding scheme based on weighted Gauss-Seidel(WGS) was proposed. That was weighted addtion the iteration results of previous step and Gausee-Seidel iteration results to accelerate the iterative convergence. The weighting factor was determined by the least mean square sum,and the weighting factor was proved to make the algorithm converge. The simulation results show that the WGS algorithm can approximate the performance of ZF precoding scheme with very few iterations,and reduce the complexity of ZF precoding from O(K^3) to O(K^2),where K is the number of users.

关 键 词：大规模MIMO ZF预编码 权重高斯赛德 低复杂度 

分 类 号：TN929.53[电子电信—通信与信息系统]