arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1304.5940cs.ITmath.IT
收藏

基于多项式展开的大规模MIMO信道估计算法

Low-Complexity Channel Estimation in Large-Scale MIMO using Polynomial Expansion

Nafiseh Shariati, Emil Björnson, Mats Bengtsson, Mérouane Debbah

摘要:

本文研究了大规模多输入多输出(MIMO)通信系统中基于导频的信道估计问题。与以前的工作在这个主题上,主要考虑了由于导频重用(所谓的导频污染)的小区间干扰的影响,我们关心的是计算复杂性。传统的最小均方误差(MMSE)和最小方差无偏(MVU)信道估计器依赖于逆协方差矩阵,这在每一侧的天线数量的乘法中具有立方复杂度。由于这是非常昂贵的,当有数百个天线,我们建议近似的反演的L阶矩阵多项式。介绍了一组低复杂度的贝叶斯信道估计器,即多项式扩展信道(PEACH)估计器。多项式的系数被优化以产生小的均方误差(MSE)。我们数值计算表明,接近最佳的性能实现低多项式阶。在实践中,可以选择阶数L以在复杂度和MSE之间进行平衡。有趣的是,导频污染有利于PEACH估计器,因为较小的L可以用于实现接近最优的MSE。

英文摘要:

This paper considers pilot-based channel estimation in large-scale multiple-input multiple-output (MIMO) communication systems, also known as "massive MIMO". Unlike previous works on this topic, which mainly considered the impact of inter-cell disturbance due to pilot reuse (so-called pilot contamination), we are concerned with the computational complexity. The conventional minimum mean square error (MMSE) and minimum variance unbiased (MVU) channel estimators rely on inverting covariance matrices, which has cubic complexity in the multiplication of number of antennas at each side. Since this is extremely expensive when there are hundreds of antennas, we propose to approximate the inversion by an L-order matrix polynomial. A set of low-complexity Bayesian channel estimators, coined Polynomial ExpAnsion CHannel (PEACH) estimators, are introduced. The coefficients of the polynomials are optimized to yield small mean square error (MSE). We show numerically that near-optimal performance is achieved with low polynomial orders. In practice, the order L can be selected to balance between complexity and MSE. Interestingly, pilot contamination is beneficial to the PEACH estimators in the sense that smaller L can be used to achieve near-optimal MSEs.

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

↑