ON PARAMETRIC LOWER BOUNDS FOR DISCRETE-TIME FILTERING

Date

2016-03-25

Author

Fritsche, Carsten
Orguner, Umut
Gustafsson, Fredrik

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

53
views

0
downloads

Parametric Cramer-Rao lower bounds (CRLBs) are given for discrete-time systems with non-zero process noise. Recursive expressions for the conditional bias and mean-square-error (MSE) (given a specific state sequence) are obtained for Kalman filter estimating the states of a linear Gaussian system. It is discussed that Kalman filter is conditionally biased with a non-zero process noise realization in the given state sequence. Recursive parametric CRLBs are obtained for biased estimators for linear state estimators of linear Gaussian systems. Simulation studies are conducted where it is shown that Kalman filter is not an efficient estimator in a conditional sense.

Subject Keywords

Parametric CRLB, Cramer-Rao lower bound, Biased estimator, Nonlinear filtering, State estimation

URI

https://hdl.handle.net/11511/53898

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

A new real-time suboptimum filtering and prediction scheme for general nonlinear discrete dynamic systems with Gaussian or non-Gaussian noise Demirbaş, Kerim (Informa UK Limited, 2011-01-01) A new suboptimum state filtering and prediction scheme is proposed for nonlinear discrete dynamic systems with Gaussian or non-Gaussian disturbance and observation noises. This scheme is an online estimation scheme for real-time applications. Furthermore, this scheme is very suitable for state estimation under either constraints imposed on estimates or missing observations. State and observation models can be any nonlinear functions of the states, disturbance and observation noises as long as noise samples ...
Recent results on Bayesian Cramér-Rao bounds for jump Markov systems Fritsche, Carsten; Orguner, Umut; Svensson, Lennart; Gustafsson, Fredrik (2016-07-08) In this paper, recent results on the evaluation of the Bayesian Cramer-Rao bound for jump Markov systems are presented. In particular, previous work is extended to jump Markov systems where the discrete mode variable enters into both the process and measurement equation, as well as where it enters exclusively into the measurement equation. Recursive approximations are derived with finite memory requirements as well as algorithms for checking the validity of these approximations are established. The tightnes...
On plateaued functions, linear structures and permutation polynomials Mesnager, Sihem; Kaytancı, Kübra; Özbudak, Ferruh (2019-01-01) We obtain concrete upper bounds on the algebraic immunity of a class of highly nonlinear plateaued functions without linear structures than the one was given recently in 2017, Cusick. Moreover, we extend Cusick’s class to a much bigger explicit class and we show that our class has better algebraic immunity by an explicit example. We also give a new notion of linear translator, which includes the Frobenius linear translator given in 2018, Cepak, Pasalic and Muratović-Ribić as a special case. We find some app...
Investigation of decoupling techniques for linear and nonlinear systems Kalaycıoğlu, Taner; Özgüven, Hasan Nevzat; Department of Mechanical Engineering (2018) Structural coupling methods are widely used in predicting dynamics of coupled systems. In this study, the reverse problem, i.e. predicting the dynamic behavior of a particular subsystem from the knowledge of the dynamics of the overall system and of all the other subsystems, is studied. This problem arises when a substructure cannot be measured separately, but only when coupled to neighboring substructures. The dynamic decoupling problem of coupled linear structures is well investigated in literature. Howev...
MARGINAL BAYESIAN BHATTACHARYYA BOUNDS FOR DISCRETE-TIME FILTERING Fritsche, Carsten; Orguner, Umut; Özkan, Emre; Gustafsson, Fredrik (2018-04-20) In this paper, marginal versions of the Bayesian Bhattacharyya lower bound (BBLB), which is a tighter alternative to the classical Bayesian Cramer-Rao bound, for discrete-time filtering are proposed. Expressions for the second and third-order marginal BBLBs are obtained and it is shown how these can be approximately calculated using particle filtering. A simulation example shows that the proposed bounds predict the achievable performance of the filtering algorithms better.

Citation Formats

C. Fritsche, U. Orguner, and F. Gustafsson, “ON PARAMETRIC LOWER BOUNDS FOR DISCRETE-TIME FILTERING,” 2016, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/53898.