By Topic

Computing the recursive posterior Cramer-Rao bound for a nonlinear nonstationary system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Taylor, R.M. ; Mitre Corp., McLean, VA, USA ; Flanagan, B.P. ; Uber, J.A.

The recursive posterior Cramer-Rao bound (PCRB) has recently been shown to be the information-theoretic mean square error (MSE) bound for an unbiased sequential Bayesian estimator. The expectation integrals for the Fisher information components, which arise out of the recursive PCRB formulation, are intractable in general and must be approximated numerically. We introduce a sequential Monte Carlo method for computing the PCRB in a nonlinear nonstationary dynamic system. To validate the bound accuracy, we run a particle filter on a nonstationary logistic function and see how the MSE compares to the PCRB.

Published in:

Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03). 2003 IEEE International Conference on  (Volume:6 )

Date of Conference:

6-10 April 2003