CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

On the Bayesian Cramér-Rao Bound for Markovian Switching Systems

Lennart Svensson (Institutionen för signaler och system, Signalbehandling)
IEEE Transactions of Signal Processing (1053-587X). Vol. 58 (2010), 9, p. 4507-4516.
[Artikel, refereegranskad vetenskaplig]

We propose a numerical algorithm to evaluate the Bayesian Cramér–Rao bound (BCRB) for multiple model filtering problems. It is assumed that the individual models have additive Gaussian noise and that the measurement model is linear. The algorithm is also given in a recursive form, making it applicable for sequences of arbitrary length. Previous attempts to calculate the BCRB for multiple model filtering problems are based on rough approximations which usually make them simple to calculate. In this paper, we propose an algorithm which is based on Monte Carlo sampling, and which is hence more computationally demanding, but yields accurate approximations of the BCRB. An important observation from the simulations is that the BCRB is more overoptimistic than previously suggested bounds, which we motivate using theoretical results.

Nyckelord: Cramér–Rao bound, jump Markov system, maneuvering target, multiple model filtering, non-linear filtering, performance bounds.

Denna post skapades 2010-08-17. Senast ändrad 2017-01-27.
CPL Pubid: 124667


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för signaler och system, Signalbehandling (1900-2017)


Matematisk statistik

Chalmers infrastruktur