Abstract

A subspace-fitting formulation of the ESPRIT problem is presented that provides a framework for extending the algorithm to exploit arrays with multiple invariances. In particular, a multiple invariance (MI) ESPRIT algorithm is developed and the asymptotic distribution of the estimates is obtained. Simulations are conducted to verify the analysis and to compare the performance of MI ESPRIT with that of several other approaches. The excellent quality of the MI ESPRIT estimates is explained by recent results which state that, under certain conditions, subspace-fitting methods of this type are asymptotically efficient.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Keywords

Subspace topologyAlgorithmApplied mathematicsMathematicsExploitComputer scienceInvariance principleMathematical optimizationArtificial intelligence

Affiliated Institutions

Related Publications

Publication Info

Year
1992
Type
article
Volume
40
Issue
4
Pages
867-881
Citations
243
Access
Closed

External Links

Social Impact

Altmetric

Social media, news, blog, policy document mentions

Citation Metrics

243
OpenAlex

Cite This

A. Lee Swindlehurst, Björn Ottersten, R. Roy et al. (1992). Multiple invariance ESPRIT. IEEE Transactions on Signal Processing , 40 (4) , 867-881. https://doi.org/10.1109/78.127959

Identifiers

DOI
10.1109/78.127959