16 December 1989 Fast Mapping Of A Kalman Filter On Warp
Author Affiliations +
Abstract
A parallel algorithm for solving an n-state Kalman filter on an (n+2)-cell linear array is described. The algorithm is the basis for the mapping of a 9-state target tracking filter on the Warp computer. The Warp implementation is written in a high-level language and achieves a measured speedup of almost 300 over the same filter running on a Sun workstation.
© (1989) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
David R. O'Hallaron, David R. O'Hallaron, Radhakisan S. Baheti, Radhakisan S. Baheti, } "Fast Mapping Of A Kalman Filter On Warp", Proc. SPIE 0977, Real-Time Signal Processing XI, (16 December 1989); doi: 10.1117/12.948571; https://doi.org/10.1117/12.948571
PROCEEDINGS
10 PAGES


SHARE
RELATED CONTENT

Efficient one-scan-back PDAF for target tracking in clutter
Proceedings of SPIE (November 26 2001)
Fast RLS adaptive algorithms and Chandrasekhar equations
Proceedings of SPIE (December 01 1991)
Track fusion with feedback
Proceedings of SPIE (May 31 1996)
New robust filter for uncertain discrete-time system
Proceedings of SPIE (September 02 2003)

Back to Top