Fast Mapping Of A Kalman Filter On Warp

David R. O'Hallaron; Radhakisan S. Baheti

doi:10.1117/12.948571

16 December 1989 Fast Mapping Of A Kalman Filter On Warp

David R. O'Hallaron, Radhakisan S. Baheti

Proceedings Volume 0977, Real-Time Signal Processing XI; (1989) https://doi.org/10.1117/12.948571
Event: 32nd Annual International Technical Symposium on Optical and Optoelectronic Applied Science and Engineering, 1988, San Diego, CA, United States

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.

Citation Download Citation

David R. O'Hallaron and Radhakisan S. Baheti "Fast Mapping Of A Kalman Filter On Warp", Proc. SPIE 0977, Real-Time Signal Processing XI, (16 December 1989); https://doi.org/10.1117/12.948571

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available