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

大规模MIMO系统中低复杂度的预编码改进算法
引用本文:杨伟茜,吴君钦,廖家明,梁冰.大规模MIMO系统中低复杂度的预编码改进算法[J].电视技术,2017(11):83-87.
作者姓名:杨伟茜  吴君钦  廖家明  梁冰
作者单位:江西理工大学信息工程学院,江西赣州,341000
基金项目:国家自然科学基金资助项目(61501210;61663014),江西省教育厅科技项目(GJJ14428)
摘    要:针对大规模MIMO系统中线性预编码包含复杂的大维矩阵求逆运算,从而产生较大系统开销这一问题,提出了一种低复杂度的基于区域选择初始解的RZF-GS预编码算法.该算法是在RZF预编码的基础上,用Gauss-Seidel迭代算法代替矩阵的求逆运算,并将通常的零初始解向量优化为基于区域选择初始解的向量.实验结果表明,该算法使系统整体的复杂度降低一个数量级,同时,与Neumann级数预编码和零初始解的RZF-GS预编码相比,该算法均明显加快了其收敛速率,用较少的迭代次数就能逼近经典RZF预编码的最优误码率性能.

关 键 词:大规模MIMO  线性预编码  正则化迫零  Gauss-Seidel  区域初始化

Low-complexity improved precoding algorithm for massive MIMO systems
Abstract:For massive MIMO systems,the linear precoding contains a complex large-dimensional matrix inversion operation which resulting in more system overhead,the low-complexity RZF-GS precoding algorithm based on zone-selection initial solution is proposed.Based on the RZF precoding,the improved algorithm replaces the matrix inverse operation with the Gauss-Seidel iterative algorithm and optimizes the usual zero vector initial solution into the zone-based initial solution.The simulation results show that the algorithm reduces the overall complexity by an order of magnitude,while compared with the Neumann Series precoding and RZF-GS precoding based on zero-vector initial solution,the algorithm can accelerate the convergence rate obviously and approach the optimal bit error rate performance of the classical RZF precoding by less iteration numbers.
Keywords:massive MIMO  linear precoding  regularized zero-forcing  Gauss-Seidel  zone initial solution
本文献已被 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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