Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A generalization of weighted subspace fitting to full-rank models
KTH, School of Electrical Engineering (EES), Signal Processing.ORCID iD: 0000-0002-3599-5584
KTH, School of Electrical Engineering (EES), Signal Processing.ORCID iD: 0000-0003-2298-6774
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
Abstract [en]

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.
Keyword [en]
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
National Category
Signal Processing
Identifiers
URN: urn:nbn:se:kth:diva-20535DOI: 10.1109/78.917804ISI: 000168093600009OAI: oai:DiVA.org:kth-20535DiVA: diva2:339231
Note
QC 20100525 QC 20111107Available from: 2010-08-10 Created: 2010-08-10 Last updated: 2017-12-12Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Bengtsson, MatsOttersten, Björn

Search in DiVA

By author/editor
Bengtsson, MatsOttersten, Björn
By organisation
Signal Processing
In the same journal
IEEE Transactions on Signal Processing
Signal Processing

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 88 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf