Robust localization of scattered sources

This paper presents a new robust algorithm for scattered source localization. The proposed algorithm is based on a decomposition of the channel vector into subspaces characterized by their sensitivities to the spatial source parameters, such as the source spread which is usually treated as an unknown nuisance parameter. This decomposition isolates a subspace of the data which is not a function of the unknown nuisance parameters, and the resulting estimator does not involve any search over these parameters. A maximum likelihood estimator for the new decomposed model is developed. The estimator uses only the information carried by the insensitive subspace of the data while perturbations of the channel vector in the sensitive subspace are assumed to be unknown parameters. Identification of the insensitive subspace is done according to the channel vector covariance matrix. Simulation results are presented to demonstrate the effectiveness of the proposed algorithm.

[1]  Shahrokh Valaee,et al.  Parametric localization of distributed sources , 1995, IEEE Trans. Signal Process..

[2]  Björn E. Ottersten,et al.  The effects of local scattering on direction of arrival estimation with MUSIC , 1999, IEEE Trans. Signal Process..

[3]  Bjorn Ottersten,et al.  Generalised array manifold model for wireless communication channels with local scat-tering , 1998 .

[4]  Pascal Larzabal,et al.  Performance study of a generalized subspace-based method for scattered sources , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

[5]  Raviv Raich,et al.  Localization of a distributed source which is "partially coherent"-modeling and Cramer-Rao bounds , 1999, 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258).