Matrix sign algorithms for signal subspace applications

Research output: Contribution to journalConference articlepeer-review

Abstract

New algorithms for computing the matrix sign function of nonsingular matrices are developed. These algorithms are used to estimate the signal and noise subspaces of the sample covariance matrix when a threshold which separates signal and noise eigenvalues is available. The computed subspaces are then utilized to develop high resolution methods such as MUSIC (MUltiple SIgnal Classification) and ESPRIT (Estimation of Signal Parameters via Rotational Invariance Techniques) for sinusoidal frequency and direction of arrival (DOA) problems. The main features of these algorithms are that they are stable and can be used to generate subspaces that are parameterized by the signal-to-noise ratio (SNR). Additionally, significant computational saving will be obtained due to the fast convergence of some of these iterations. Simulations showing the performance of these methods are also presented.

Original languageEnglish (US)
Pages (from-to)2350-2354
Number of pages5
JournalProceedings of the American Control Conference
Volume4
StatePublished - Dec 1 1999
EventProceedings of the 1999 American Control Conference (99ACC) - San Diego, CA, USA
Duration: Jun 2 1999Jun 4 1999

Fingerprint Dive into the research topics of 'Matrix sign algorithms for signal subspace applications'. Together they form a unique fingerprint.

Cite this