Abstract

Backward filtering is a useful tool to compute initial values in finite horizon signal processing. To make it optimally, a backward a posteriori optimal finite impulse response (B-OFIR) state estimator (filter) is proposed for discrete time-varying linear processes. The B-OFIR filter is derived in a discrete convolution-based batch form and represented with a fast iterative algorithm using recursions. The performance of the B-OFIR filter is compared to the forward OFIR filter (F-OFIR), KF, and unbiased FIR filter (UFIR). Simulations conducted based on a two-state tracking model and one degree-of-freedom torsion load system show that the B-OFIR filter is statistically equivalent to the F-OFIR filter, but operates with noise samples ordered back in time and therefore produces a bit different estimates.

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.