• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Computer Conference, Computer Society of Iran >Channel Estimation using Block Sparse Joint Orthogonal Matching Pursuit in Massive MIMO Systems
【24h】

Channel Estimation using Block Sparse Joint Orthogonal Matching Pursuit in Massive MIMO Systems

机译：在大规模MIMO系统中使用块稀疏关节正交匹配追求的信道估计

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The channel estimation of the muti-user massive MIMO systems is a crucial task which enables us to leverage their high degrees of freedom. Due to the large number of base station antennas and consequently the huge number of channel paths, the massive MIMO channel estimation becomes more challenging. In this paper, we suggest a sparsity-based algorithm to estimate the channels more efficiently. To this end, we would offer a problem modelling to exploit the spatial correlation among different antennas of the BS as well as the inter-user similarity of the channel supports. An iterative thresholding technique has been suggested to approximate the channel matrix. The simulation results confirm that the proposed method has outstanding performance compared to its counterparts.
机译：Muti-user大型MIMO系统的信道估计是一个重要任务，使我们能够利用它们的高度自由度。 由于大量的基站天线并且因此大量的信道路径，大规模的MIMO信道估计变得更具挑战性。 在本文中，我们建议基于稀疏性的算法来更有效地估计信道。 为此，我们将提供一个问题建模，以利用BS的不同天线之间的空间相关性以及信道支持的间歇相似性。 已经建议迭代阈值化技术来近似信道矩阵。 仿真结果证实，与其同行相比，该方法具有出色的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号