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.
展开▼
