Abstract

In this paper, a new channel-estimation algorithm based on maximum-likelihood (ML) algorithm for estimation and tracking of the multiple-input-multiple-output (MIMO) channels is presented. The ML algorithm presents the optimum estimation when the exact channel model is known. The derived channel-estimation algorithm is very efficient, with a computational complexity comparable to the least mean square and much lower than the recursive least squares and the Kalman algorithms. The proposed algorithm is analyzed, and the effect of the channel-tracking error is applied as a modifying component for the derived algorithm. The proposed algorithm is simulated for half- and full-rank flat-fading time-varying MIMO channels for the different values of f <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">D</sub> T, E <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">b</sub> /N <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> , and training lengths via Monte Carlo simulation technique. The minimum mean-square-error (mmse) joint detector is considered as the detection algorithm. The output of the mmse receiver is considered as the virtual training data in the blind mode of operation: the same as in the decision-directed algorithm. By various simulations, the bit error rate and the mse of tracking the proposed algorithm for different values of f <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">D</sub> T, presenting the speed of channel variations, are evaluated and compared with the Kalman filtering approach. By simulating the proposed algorithm for different values of the training length, the minimum training length required for different channel conditions is extracted

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