By Topic

Adaptive polynomial factorization by coefficient matching

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

2 Author(s)
D. Starer ; Dept. of Electr. Eng., Yale Univ., New Haven, CT, USA ; A. Nehorai

A polynomial factorization algorithm is presented which updates all roots simultaneously and efficiently in response to coefficient perturbations. The algorithm requires approximately 2n2 complex floating point operations to update all roots of n th order polynomial. Close to the true root vector, the algorithm's convergence rate is quadratic. The root update requires only the solution of two sets of structured linear equations and a convolution. The algorithm can be used to track the roots of time-varying polynomials which is useful for application in adaptive signal processing

Published in:

IEEE Transactions on Signal Processing  (Volume:39 ,  Issue: 2 )