By Topic

Fast recursive low-rank linear prediction frequency estimation algorithms

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

1 Author(s)
Strobach, P. ; Fachhochschule Furtwangen, Germany

A class of fast recursive low-rank linear prediction algorithms for the tracking of time-varying frequencies of multiple nonstationary sinusoids in noise is introduced. Realizations with O(Nn) and O(Nn2 ) arithmetic operations per time step are described, where N is the model order and n is the number of independent sinusoids. The key step towards an operations count that depends only linearly on the model order is fast eigensubspace tracking, and the property that the coefficients of a high-order N prediction filter itself constitute a perfectly (or almost perfectly) predictable sequence that can be annihilated using a low-order 2n prediction error filter that carries the desired signal frequency information in its roots. In this concept, root tracking is limited to a low-order filter polynomial, even if the overmodeling factor N/n is much larger than 1 for optimal noise suppression. Extraneous roots are not computed explicitly. Detailed simulation results confirm the tracking capabilities of the new algorithms

Published in:

Signal Processing, IEEE Transactions on  (Volume:44 ,  Issue: 4 )