Fast subspace-based source localization methods

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 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. In this paper, we aim at demonstrating the usefulness of QR and LU factorizations of the spectral matrix to improve 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.