Abstract
Aiming at the problem of computational complexity of channel estimation, this paper proposes a low-complexity block matching pursuit (BMP) algorithm based on antenna grouping and block sparsity for frequency division duplex (FDD) massive Multiple-input Multiple-output orthogonal frequency division multiplexing (OFDM) systems. The system coherence time may be exceeded as a result of time consumption when adopting an orthogonal pilot symbol in the time domain. To solve this problem, an antenna grouping transmission scheme is proposed to reduce the total channel estimation time by sacrificing the observed data length. The simulation results show that the proposed BMP algorithm has good anti-noise performance, and it can accurately determine the non-zero position of the sparse vector and adaptively determine the sparsity of the channel, which effectively translates to improved channel estimation performance and better overall system performance than the existing algorithms.
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献