arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1409.4671stat.APcs.ITmath.IT
收藏

大规模MIMO中稀疏信道的有效协调恢复

Efficient Coordinated Recovery of Sparse Channels in Massive MIMO

Mudassir Masood, Laila H. Afify, Tareq Y. Al-Naffouri

摘要:

研究了大规模MIMO-OFDM系统中稀疏信道的估计问题。大多数无线信道本质上是稀疏的,具有大的延迟扩展。此外,由邻域中的多个天线观察到的这些信道具有近似共同的支持。在大规模MIMO系统中,稀疏性和公共支持度特性对于大数量信道的有效估计具有重要意义。此外,为了避免导频污染并实现更好的频谱效率,重要的是使用少量的导频。我们提出了一种新的信道估计方法,利用稀疏性和共同支持的属性来估计稀疏信道,并需要少量的导频。基于这种方法的两种算法已经开发出执行贝叶斯估计的稀疏信道,即使事先是非高斯或未知的。相邻天线彼此共享它们关于活动信道抽头的位置的信念以执行估计。协调的方法改善了信道估计,并且还减少了所需的导频数量。进一步的改进是通过算法的数据辅助版本实现的。大量的仿真结果证明了所提出的算法的性能。

英文摘要:

This paper addresses the problem of estimating sparse channels in massive MIMO-OFDM systems. Most wireless channels are sparse in nature with large delay spread. In addition, these channels as observed by multiple antennas in a neighborhood have approximately common support. The sparsity and common support properties are attractive when it comes to the efficient estimation of large number of channels in massive MIMO systems. Moreover, to avoid pilot contamination and to achieve better spectral efficiency, it is important to use a small number of pilots. We present a novel channel estimation approach which utilizes the sparsity and common support properties to estimate sparse channels and require a small number of pilots. Two algorithms based on this approach have been developed which perform Bayesian estimates of sparse channels even when the prior is non-Gaussian or unknown. Neighboring antennas share among each other their beliefs about the locations of active channel taps to perform estimation. The coordinated approach improves channel estimates and also reduces the required number of pilots. Further improvement is achieved by the data-aided version of the algorithm. Extensive simulation results are provided to demonstrate the performance of the proposed algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑