By Topic

Estimating the covariance matrix by signal subspace averaging

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
$33 $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

1 Author(s)
I. Karasalo ; Swedish National Defence Research Institute, Stockholm, Sweden

An efficient algorithm is presented for estimating a covariance matrix consisting of a low-rank signal term and a full-rank noise term, known apart from a scalar factor. For each sample of the vector of sensor outputs, the algorithm approximates, in the least-squares sense, a rank-one update of the covariance matrix, under the side condition that the rank of the signal term remains bounded. If the model noise is spatially colored, the least-squares approximation is preceded by spatial prewhitening, It is shown that if the rank of the signal term is small compared to the number of sensors, then the proposed algorithm requires substantially less computational work than conventional averaging. Some simulation results are included, indicating that the proposed algorithm reduces the variance of some commonly used spectral estimators in off-target directions, without impairing their detection and resolution properties.

Published in:

IEEE Transactions on Acoustics, Speech, and Signal Processing  (Volume:34 ,  Issue: 1 )