首页 | 本学科首页   官方微博 | 高级检索  
     检索      

适用于大规模MIMO系统的低复杂度RZF-SOR预编码算法
引用本文:朱庆浩,宋志鹏,吴君钦.适用于大规模MIMO系统的低复杂度RZF-SOR预编码算法[J].电讯技术,2017,57(12):1427-1432.
作者姓名:朱庆浩  宋志鹏  吴君钦
作者单位:江西理工大学 信息工程学院,江西 赣州,341000
基金项目:国家自然科学基金资助项目
摘    要:在大规模多输入多输出(MIMO)系统中,为了降低传统预编码算法的复杂度,在原有正则化迫零(RZF)预编码算法的基础上,提出用超松驰迭代(SOR)法代替矩阵求逆的高复杂度运算,得到一种改进算法RZF-SOR,并应用随机矩阵原理得出其最优相关参数的近似表达式和取值的必要条件.实验仿真表明,提出的RZF-SOR预编码算法与RZF预编码相比有效地降低了一个数量级的复杂度,在很小的迭代次数下达到接近于RZF预编码的误码率性能,并且优于基于Neumann级数预编码算法的误码率性能.

关 键 词:大规模MIMO  低复杂度预编码  超松驰迭代  正则化迫零

A low-complexity RZF-SOR precoding algorithm for massive MIMO systems
ZHU Qinghao,SONG Zhipeng and WU Junqin.A low-complexity RZF-SOR precoding algorithm for massive MIMO systems[J].Telecommunication Engineering,2017,57(12):1427-1432.
Authors:ZHU Qinghao  SONG Zhipeng and WU Junqin
Abstract:In order to reduce the complexity of traditional precoding algorithm in massive multiple-input multiple-output( MIMO) systems,an improved algorithm called Regularized Zero Forcing-Successive Over Relaxation(RZF-SOR) algorithm is proposed based on the original RZF precoding algorithm,which uses the SOR iterative method instead of the matrix inversion. The approximate expression and the necessary condition of the optimal correlation parameter are obtained by using the stochastic matrix principle. Experi-mental results show that the proposed RZF-SOR precoding algorithm effectively reduces an order of magni-tude complexity compared with RZF precoding,achieves bit error rate(BER) performance close to RZF precoding at very small iterations and is superior to Neumann Series based precoding algorithm.
Keywords:massive MIMO  low-complexity precoding  successive over relaxation( SOR)  regularized zero forcing( RZF)
本文献已被 万方数据 等数据库收录!
点击此处可从《电讯技术》浏览原始摘要信息
点击此处可从《电讯技术》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号