Robust Kalman filters for linear time-varying systems with stochastic parametric uncertainties
The DOI matches its Crossref record.
Abstract
We present a robust recursive Kalman filtering algorithm that addresses estimation problems that arise in linear time-varying systems with stochastic parametric uncertainties. The filter has a one-step predictor-corrector structure and minimizes an upper bound of the mean square estimation error at each step, with the minimization reduced to a convex optimization problem based on linear matrix inequalities. The algorithm is shown to converge when the system is mean square stable and the state space matrices are time invariant. A numerical example consisting of equalizer design for a communication channel demonstrates that our algorithm offers considerable improvement in performance when compared with conventional Kalman filtering techniques.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Disciplined Convex Programming
Grant, M., Boyd, S., & Ye, Y. (2006) · Nonconvex Optimization and Its Applications · doi:10.1007/0-387-30528-9_7 · Cited by 1,026
Atashzar, S. F., Shahbazi, M., Samotus, O., Tavakoli, M., Jog, M. S., & Patel, R. V. (2016) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2016.2530632 · Cited by 45
Metadata
- Authors
- Wang, F., & Balakrishnan, V.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2002-04
- Volume
- 50
- Issue
- 4
- Pages
- 803-813
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2051234657
- Cited by
- 202
- References
- 0
- FWCI
- 5.02
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Robust Kalman filters for linear time-varying systems with stochastic parametric uncertainties. https://app.cochat.ai/papers/10.1109/78.992124
- The paper
- Wang, F., & Balakrishnan, V. (2002). Robust Kalman filters for linear time-varying systems with stochastic parametric uncertainties. IEEE Transactions on Signal Processing. https://doi.org/10.1109/78.992124
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.