A review is presented of several algorithms for estimating generalized eigenvalues (GEs) of singular matrix pencils perturbed by noise. The singular value decomposition (SVD) is explored as the common structure in the three basic algorithms: direct matrix pencil algorithm, pro-ESPRIT, and TLS-ESPRIT. The authors show that several SVD based steps inherent in those algorithms are equivalent to the first order approximation. Also, Pro-ESPRIT and TLS-Pro-ESPRIT are shown to be equivalent, and TLS-ESPRIT and LS-ESPRIT are shown to be asymptotically equivalent to the first order approximation. For the problem of estimating superimposed complex exponential signals, the State Space Algorithm is shown to be also equivalent to the previous matrix pencil algorithms to the first order approximation. The threshold phenomenon is illustrated by a simulation result based on a damped sinusoidal signal. An improved state space algorithm is found to be the most robust to noise.
|Original language||English (US)|
|Number of pages||5|
|Journal||Conference Record - Asilomar Conference on Circuits, Systems & Computers|
|State||Published - Dec 1 1991|
|Event||24th Asilomar Conference on Signals, Systems and Computers Part 2 (of 2) - Pacific Grove, CA, USA|
Duration: Nov 5 1990 → Nov 7 1990
ASJC Scopus subject areas