Cramér–Rao lower bound in nonlinear filtering problems under noises and measurement errors dependent on estimated parameters


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

This paper derives recurrent expressions for the maximum attainable estimation accuracy calculated using the Cramér–Rao inequality (Cramér–Rao lower bound) in the discretetime nonlinear filtering problem under conditions when generating noises in the state vector and measurement error equations depend on estimated parameters and the state vector incorporates a constant subvector. We establish a connection to similar expressions in the case of no such dependence. An example illustrates application of the obtained algorithms to lowerbound accuracy calculation in a parameter estimation problem often arising in navigation data processing within a model described by the sum of a Wiener sequence and discrete-time white noise of an unknown variance.

About the authors

O. A. Stepanov

State Research Center of the Russian Federation JSC Concern CSRI Elektropribor; ITMO University

Author for correspondence.
Email: soalax@mail.ru
Russian Federation, St. Petersburg; St. Petersburg

V. A. Vasil’ev

State Research Center of the Russian Federation JSC Concern CSRI Elektropribor

Email: soalax@mail.ru
Russian Federation, St. Petersburg

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2016 Pleiades Publishing, Ltd.