Abstract

A probabilistic approach for state space models with underlying Markov chains x/sub t/ and observation sequences y/sub t/ is explored. Firstly, we establish a recursive formula for calculating the Cramer-Rao (CR) lower bound for a general state space model with a transit pdf p (x/sub t/|x/sub t-1/) and conditional p (y/sub t/|x/sub t/). Secondly, we apply the CR bound to several models, including FM demodulation models and outlier noise models. Sometimes the simple Kalman filter (KF) can achieve the efficiency even for non-Gaussian cases. Sometimes extended Kalman filter (EKF) based methods, like phase locked loops (PLLs), can achieve the efficiency for non-linear models. To study the performance of non-linear filters like PLLs, an algebraic approach is given for calculating the stationary distribution of these filters when it exists. However, there are also cases that both KF and EKF are far away from efficiency. Thirdly, two techniques are suggested when conventional filtering methods are inefficient. One is based on Gaussian approximations for p(x/sub t/|x/sub t-1/) and p(y/sub t/|x/sub t/) by Taylor expansion or maximum entropy method. Then an identity for Gaussian density products can be used to derive non-linear filters. The other is based on so-called partial conditional expectations (PCE) y/spl circ//sub t,n/=E(x/sub t/|y/sub t/, y/sub t-1/, ..., y/sub t-n+1/) which can be viewed as a nonlinear transform of observations. Then optimal linear filters can be derived for tracking x/sub t/ based on y/spl circ//sub t,n/. Simulation results show that under some circumstances these two approaches really can achieve the efficiency.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.