A generalization of weighted subspace fitting to full-rank models
2001 (English)In: IEEE Transactions on Signal Processing, ISSN 1053-587X, E-ISSN 1941-0476, Vol. 49, no 5, 1002-1012 p.Article in journal (Refereed) Published
The idea of subspace fitting provides a popular framework for different applications of parameter estimation and system identification. Previously, some algorithms have been suggested based on similar ideas, for a sensor array processing problem where the underlying data model is not low rank. We show that two of these algorithms (DSPE and DISPARE) fail to give consistent estimates and introduce a general class of subspace fitting-like algorithms for consistent estimation of parameters from a possibly full-rank data model. The asymptotic performance is analyzed, and an optimally weighted algorithm is derived. The result gives a lower bound on the estimation performance for any estimator based on a low-rank approximation of the linear space spanned by the sample data. We show that in general, for full-rank data models, no subspace-based method can reach the Cramer-Rao lower bound (CRB)
Place, publisher, year, edition, pages
2001. Vol. 49, no 5, 1002-1012 p.
array signal processing, eigenvalues and eigenfunctions, nonlinear estimation, parameter estimation, performance analysis, scattering parameters, statistical analysis, direction-of-arrival, distributed sources, angular spread, array, signals, performance, estimators, amplitude
IdentifiersURN: urn:nbn:se:kth:diva-20535DOI: 10.1109/78.917804ISI: 000168093600009OAI: oai:DiVA.org:kth-20535DiVA: diva2:339231
QC 20100525 QC 201111072010-08-102010-08-102012-01-09Bibliographically approved