期刊文献+

基于矩阵完备理论的大规模MIMO系统信道估计研究 被引量:4

Channel estimation based on matrix completion for massive MIMO systems
在线阅读 下载PDF
导出
摘要 针对大规模MIMO(Multiple-Input Multiple-Output)系统中信道估计导频开销巨大且估计精度不高的问题,假设在莱斯衰落信道模型下,文中提出一种基于矩阵完备理论的信道估计新方法。利用大规模MIMO信道固有的稀疏特性,将信道估计问题建模为低秩矩阵完整化问题。采用一种新的加权核范数建立信道矩阵的低秩逼近,通过极大极小迭代算法实现信道状态信息的估计。仿真结果表明,相比传统LS(Least Squares)算法和现有低秩信道估计算法SVP-H(Hybrid Singular Value Projection)与SDP(Semi Definite Programming),在使用相同导频数目的条件下,该算法具有较高的信道估计精度和较低的计算复杂度。 Channel estimation approaches for massive multiple-input multiple-output(MIMO) systems involve overwhelming training overhead and poor performance.Assumimg the Rice fading channel model,a new approach based on the matrix completion is proposed.The channel estimation problem is formulated as a low-rank matrix completion problem by utilizing the inherent sparsity of the massive MIMO channel.The weighted nuclear norm is used to approximate the rank function,and then with the majorization-minimization(MM) algorithm to realize the channel state information.Simulation results demonstrate that,compared with the traditional least squares(LS) algorithm and the existing low-rank channel estimation algorithms hybrid singular value projection(SVP-H) and semi-definite programming(SDP),under the condition of the same number pilots,the proposed algorithm can obtain better channel estimation performance and a lower complexity.
作者 姜薇 黄秋实 黄学军 JIANG Wei;HUANG Qiushi;HUANG Xuejun(College of Telecommunications&Information Engineering,Nanjing University of Posts and Telecommunications,Nanjing 210003,China)
出处 《南京邮电大学学报(自然科学版)》 北大核心 2019年第5期20-25,共6页 Journal of Nanjing University of Posts and Telecommunications:Natural Science Edition
基金 国家自然科学基金(61427801)资助项目
关键词 大规模MIMO 信道估计 莱斯衰落信道 矩阵完备理论 massive multiple-input multiple-output(MIMO) channel estimation Rice fading channel model matrix completion
作者简介 姜薇,女,硕士研究生;通讯作者:黄学军,男,博士,副教授,huangxj@njupt.edu.cn。
  • 相关文献

参考文献1

二级参考文献3

共引文献5

同被引文献10

引证文献4

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部