Abstract
The recursive procedure to compute the posterior Cramer-Rao lower bound (PCRLB) for sequential Bayesian estimators, derived by Tichavsky , provides an off-line performance bound for a general nonlinear filtering problem. Since the corresponding Fisher information matrix (FIM) is obtained by taking the expectation with respect to all the random variables, this PCRLB is not well suited for online adaptive resource management for dynamic systems. For online estimation performance evaluation in a nonlinear system, the concept of conditional PCRLB was proposed by Zuo in 2011. In this paper, two other online conditional PCRLBs are proposed which are alternatives to the one proposed by Zuo Numerical examples are provided to show that the three online bounds, namely the conditional PCRLB proposed by Zuo and the two conditional PCRLBs proposed in this paper, are very close to one another.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
