By Topic

Recursive eigendecomposition via autoregressive analysis and ago-antagonistic regularization

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)
F. Barbaresco ; Radar Dev./Algorithms & New Concepts Dept., Thomson-CSF, Bagneux, France

A new recursive eigendecomposition algorithm of complex Hermitian Toeplitz matrices is studied. Based on Trench's inversion of Toeplitz matrices from their autoregressive analysis, we have developed a fast recursive iterative algorithm that takes into account the rank-one modification of successive order Toeplitz matrices. To speed up the computational time and to increase numerical stability of ill-conditioned eigendecomposition in case of very short data records analysis, we have extended this method by introducing an ago-antagonistic regularized reflection coefficient via Levinson equation. We provide a geometrical interpretation of this new recursive eigendecomposition

Published in:

Acoustics, Speech, and Signal Processing, 1997. ICASSP-97., 1997 IEEE International Conference on  (Volume:5 )

Date of Conference:

21-24 Apr 1997