Recursive Filtering in the Presence of Biases with Irreducible Uncertainty

Bernard Friedland

doi:10.1109/TAC.1976.1101328

Recursive Filtering in the Presence of Biases with Irreducible Uncertainty

Bernard Friedland

Research output: Contribution to journal › Letter › peer-review

11 Scopus citations

Abstract

A simplification of the “separate-bias” algorithm described in [1] is afforded by the assumption that the covariance matrix of the bias cannot be reduced by the operation of the filter. The calculations are illustrated for a biased sensor governed by a first-order differential equation.

Original language	English (US)
Pages (from-to)	789-790
Number of pages	2
Journal	IEEE Transactions on Automatic Control
Volume	21
Issue number	5
DOIs	https://doi.org/10.1109/TAC.1976.1101328
State	Published - Oct 1976
Externally published	Yes

All Science Journal Classification (ASJC) codes

Electrical and Electronic Engineering
Control and Systems Engineering
Computer Science Applications

Access to Document

10.1109/TAC.1976.1101328

Cite this

@article{ac81b63feb544c4d8b638d073b5ae20f,

title = "Recursive Filtering in the Presence of Biases with Irreducible Uncertainty",

abstract = "A simplification of the “separate-bias” algorithm described in [1] is afforded by the assumption that the covariance matrix of the bias cannot be reduced by the operation of the filter. The calculations are illustrated for a biased sensor governed by a first-order differential equation.",

author = "Bernard Friedland",

year = "1976",

month = oct,

doi = "10.1109/TAC.1976.1101328",

language = "English (US)",

volume = "21",

pages = "789--790",

journal = "IEEE Transactions on Automatic Control",

issn = "0018-9286",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "5",

}

TY - JOUR

T1 - Recursive Filtering in the Presence of Biases with Irreducible Uncertainty

AU - Friedland, Bernard

PY - 1976/10

Y1 - 1976/10

N2 - A simplification of the “separate-bias” algorithm described in [1] is afforded by the assumption that the covariance matrix of the bias cannot be reduced by the operation of the filter. The calculations are illustrated for a biased sensor governed by a first-order differential equation.

AB - A simplification of the “separate-bias” algorithm described in [1] is afforded by the assumption that the covariance matrix of the bias cannot be reduced by the operation of the filter. The calculations are illustrated for a biased sensor governed by a first-order differential equation.

UR - http://www.scopus.com/inward/record.url?scp=47649092461&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=47649092461&partnerID=8YFLogxK

U2 - 10.1109/TAC.1976.1101328

DO - 10.1109/TAC.1976.1101328

M3 - Letter

AN - SCOPUS:47649092461

SN - 0018-9286

VL - 21

SP - 789

EP - 790

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

IS - 5

ER -

Recursive Filtering in the Presence of Biases with Irreducible Uncertainty

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this