Abstract

This paper develops an efficient channel estimation algorithm based on second-order statistics of time division duplex (TDD) multiuser massive multiple-input multiple-output (MIMO) systems. The algorithm uses the received signal correlation to determine the most significant lags (MSLs) of the received signal. We first employ these MSLs to propose a novel set containing the channel’s four most significant taps (MSTs). Then, by using them, we propose an efficient semi-blind iterative algorithm called enhanced modified-subspace pursuit (EM-SP). It uses the set mentioned above and two theoretical results ( <xref ref-type="lemma" rid="lemma1" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Lemma 1</xref> and <xref ref-type="theorem" rid="theorem1" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Theorem 1</xref> ) to estimate an arbitrary number of MSTs efficiently. Simulation results show that the normalized mean square error (NMSE) of the proposed EM-SP algorithm is much smaller than that of the subspace pursuit (SP) and orthogonal matching pursuit (OMP) algorithms at the cost of 0.3 % and 2 % more computational complexity for the channels with three and six nonzero paths, respectively. Moreover, the NMSE of it is very close to that of the optimal genie-aided least square algorithm.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call