A Low-Complexity Adaptive Moving Target Tracking Algorithm Over Time-Varying Scattering Channel

Abstract

In wireless communication environment, the time-varying channel and angular spreads caused by multipath fading and the mobility of mobile stations (MS) degrade the performance of the conventional direction-of arrival (DOA) tracking algorithms. On the other hand, although the DOA estimation methods based on the maximum likelihood (MI) principle have higher resolution than the beamforming and the subspace based methods, prohibitively heavy computation limits their practical applications. In this paper, we first propose a new suboptimal DOA estimation algorithm that combines the advantages of the lower complexity of subspace algorithm and the high accuracy of MI based algorithms, and then propose a Kalman filtering based tracking algorithm to model the dynamic property of directional changes for mobile terminals in such a way that the association between the estimates made at different time points is maintained. At each stage during tracking process, the current suboptimal estimates of DOA are treated as measurements, predicted and updated via a Kalman state equation, hence adaptive tracking of moving MS can be carried out without the need to perform unduly heavy computations. Computer simulation results show that this proposed algorithm has better performance of DOA estimation and tracking of MS than the conventional MI or subspace based algorithms in terms of accuracy and robustness.