Unfalsified weighted least squares estimates in set-membership identification

Er Wei Bai*

*Corresponding author for this work

Research output: Contribution to journalJournal Articlepeer-review

4 Citations (Scopus)

Abstract

It is well known that the weighted least squares (WLS) identification algorithm provides estimates that are in general not in the membership set and in this sense are falsified estimates. This paper shows that: 1) if the noise bound is known, the WLS estimates can be made to lie in or converge to the membership set by choosing the weights properly and 2) if the noise bound is unknown, the same results can still be achieved by using white input signals for finite impulse response systems (FIR).

Original languageEnglish
Pages (from-to)41-49
Number of pages9
JournalIEEE Transactions on Circuits and Systems I: Regular Papers
Volume45
Issue number1
DOIs
Publication statusPublished - 1998
Externally publishedYes

Keywords

  • Identification
  • Least square
  • Set membership

Fingerprint

Dive into the research topics of 'Unfalsified weighted least squares estimates in set-membership identification'. Together they form a unique fingerprint.

Cite this