Posterior cramer-rao bounds for adaptive discrete-time system identification

Petr Tichavsky, Carlos Muravchik, Arye Nehorai

Research output: Contribution to journalArticlepeer-review

Abstract

A mean square error lower bound for the discrete-time nonlinear filtering problem is derived based on the Van Trees' (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 autoregre-sive process; tracking a slowly varying frequency of a single cisoid in noise; tracking parameters of a sinusoidal frequency with sinusoidal phase modulation.

Original languageEnglish
Pages (from-to)822
Number of pages1
JournalIEEE Transactions on Signal Processing
Volume45
Issue number3
StatePublished - 1997

Fingerprint

Dive into the research topics of 'Posterior cramer-rao bounds for adaptive discrete-time system identification'. Together they form a unique fingerprint.

Cite this