PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
May 1, 1998IEEE Transactions on Signal Processing1,423 citationsOpen Access

Posterior Cramer-Rao bounds for discrete-time nonlinear filtering

PTPetr TichavskýCMCarlos H. MuravchikANArye Nehorai

Key Points

Key points are not available for this paper at this time.

Abstract

A mean-square error lower bound for the discrete-time nonlinear filtering problem is derived based on the van Trees (1968) (posterior) version of the Cramer-Rao inequality. This lower bound is applicable to multidimensional nonlinear, possibly non-Gaussian, dynamical systems and is more general than the previous bounds in the literature. The case of singular conditional distribution of the one-step-ahead state vector given the present state is considered. The bound is evaluated for three important examples: the recursive estimation of slowly varying parameters of an autoregressive process, tracking a slowly varying frequency of a single cisoid in noise, and tracking parameters of a sinusoidal frequency with sinusoidal phase modulation.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Tichavský et al. (1998) studied this question.

synapsesocial.com/papers/69ff543f10d6befb257743cehttps://doi.org/10.1109/78.668800
Ask AI
Helpful
Bookmark
Share
View Full Paper