By Topic

Performance of the fast subspace-based localization methods

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bourennane, S. ; GSM - Inst. Fresnel, Ecole Centrale Marseille, Marseille, France ; Fossati, C.

Source localization is based on the spectral matrix algebraic properties. Propagator, and Ermolaev-Gershman (EG) noneigenvector algorithms exhibit a low computational load. Propagator is based on the spectral matrix partitioning. EG algorithm obtains an approximation of noise subspace using an adjustable power parameter of the spectral matrix and choosing a threshold value. These algorithms are efficient in non-noisy or high signal to noise ratio (SNR) environments. However both algorithms shall be improved. Propagator is not robust to noise; EG algorithm requires the knowledge of a threshold value between largest and smallest eigenvalues, which are not available as eigendecomposition is not performed. In this paper, we aim at demonstrating the usefulness of QR and LU factorizations of the spectral matrix for these methods. Experiments show that the modified propagator and EG algorithms based on factorized spectral matrix lead to better localization results, compared to the existing methods.

Published in:

Statistical Signal Processing, 2009. SSP '09. IEEE/SP 15th Workshop on

Date of Conference:

Aug. 31 2009-Sept. 3 2009