Beyond MMSE: Rank-1 Subspace Channel Estimator for Massive MIMO Systems
IEEE Transactions on Communications(2024)
摘要
To glean the benefits offered by massive multi-input multi-output (MIMO)
systems, channel state information must be accurately acquired. Despite the
high accuracy, the computational complexity of classical linear minimum mean
squared error (MMSE) estimator becomes prohibitively high in the context of
massive MIMO, while the other low-complexity methods degrade the estimation
accuracy seriously. In this paper, we develop a novel rank-1 subspace channel
estimator to approximate the maximum likelihood (ML) estimator, which
outperforms the linear MMSE estimator, but incurs a surprisingly low
computational complexity. Our method first acquires the highly accurate
angle-of-arrival (AoA) information via a constructed space-embedding matrix and
the rank-1 subspace method. Then, it adopts the post-reception beamforming to
acquire the unbiased estimate of channel gains. Furthermore, a fast method is
designed to implement our new estimator. Theoretical analysis shows that the
extra gain achieved by our method over the linear MMSE estimator grows
according to the rule of O(log_10M), while its computational complexity is
linearly scalable to the number of antennas M. Numerical simulations also
validate the theoretical results. Our new method substantially extends the
accuracy-complexity region and constitutes a promising channel estimation
solution to the emerging massive MIMO communications.
更多查看译文
关键词
Massive MIMO,channel estimation,MMSE estimator,rank-1 subspace,post-reception beamforming,Cramer-Rao lower bound,low complexity
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要