Abstract

The Kalman filter is essentially a recursive data processing algorithm which provides an optimal estimate of the state vector of a system from noisy measurements. A drawback of the algorithm is that it is computationally intensive, requiring powerful processing systems to meet the sample time requirements of real-time systems. This has led to the development of parallel versions of the Kalman algorithm, in order to reduce execution times and enable the algorithm to be implemented in an increased range of real-time applications. In this work, a number of parallel Kalman algorithms are mapped onto a number of different parallel processing systems, including SIMD and MIMD architectures. The different parallel approaches are then compared for speed of execution and efficient use of processing power.

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.