A Low Complexity Maximum Likelihood Algorithm for Targets DOA Tracking

This work presents a low complexity bootstrapping filter for target direction-of-arrival tracking in array signal processing, and derives a Monte Carlo maximum likelihood method. Similar to bootstrapping, our new algorithm bypasses the resampling step and directly generates the maximum-likelihood estimates. This simpler target tracking method is compared against the original bootstrapping and the traditional extended Kalman filter. The performance comparison shows no performance loss for our simplified method

[1]  Nando de Freitas,et al.  The Unscented Particle Filter , 2000, NIPS.

[2]  Ilan Ziskind,et al.  Maximum likelihood localization of multiple sources by alternating projection , 1988, IEEE Trans. Acoust. Speech Signal Process..

[3]  Shao Chao,et al.  The matrix form of alternating separation algorithm , 2004, Proceedings 7th International Conference on Signal Processing, 2004. Proceedings. ICSP '04. 2004..

[4]  Petre Stoica,et al.  MUSIC, maximum likelihood, and Cramer-Rao bound , 1989, IEEE Transactions on Acoustics, Speech, and Signal Processing.

[5]  Zheng Bao,et al.  Some properties of the alternating separation (AS), alternating projection (AP) and ASAP algorithm , 2004 .

[6]  Abdelhak M. Zoubir,et al.  Detection of sources using bootstrap techniques , 2002, IEEE Trans. Signal Process..

[7]  Boualem Boashash,et al.  The bootstrap and its application in signal processing , 1998, IEEE Signal Process. Mag..

[8]  Zheng Bao,et al.  Some properties of the alternating separation (AS), alternating projection (AP) and ASAP algorithm , 2008, Science in China Ser. F Information Sciences.

[9]  N. Gordon,et al.  Novel approach to nonlinear/non-Gaussian Bayesian state estimation , 1993 .

[10]  Zhi Ding,et al.  QAM constellation classification based on statistical sampling for linear distortive channels , 2006, IEEE Transactions on Signal Processing.