Share Email Print

Proceedings Paper

Fast Mapping Of A Kalman Filter On Warp
Author(s): David R. O'Hallaron; Radhakisan S. Baheti
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 16 December 1989
PDF: 10 pages
Proc. SPIE 0977, Real-Time Signal Processing XI, (16 December 1989); doi: 10.1117/12.948571
Show Author Affiliations
David R. O'Hallaron, GE Research and Development Center (United States)
Radhakisan S. Baheti, GE Research and Development Center (United States)

Published in SPIE Proceedings Vol. 0977:
Real-Time Signal Processing XI
J. P. Letellier, Editor(s)

© SPIE. Terms of Use
Back to Top