By Topic

Mapping the Kalman tracking algorithm onto the transputer network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
V. Vaidehi ; Sch. of Instrum. & Electron., Anna Univ., Chennai ; C. N. Krishnan

The Kalman tracking algorithm estimates position, velocity, and acceleration of a target from noisy measurement. A parallel Kalman algorithm is derived using the row-column partitioning with the modified state vector representation for multiprocessor realization. Mapping the tasks onto the multiprocessor system to minimize the time needed to complete all the tasks is an NP hard problem, and it arises when the task dependency structure of a parallel algorithm differs from the processor interconnection topology or when the number of processes generated by the algorithm exceeds the number of processors available. The efficient mapping of 3D-3S parallel Kalman tracking algorithm onto the network of 10 transputers, which are connected in tree structure that achieves a speedup of 6 is presented here

Published in:

IEEE Transactions on Aerospace and Electronic Systems  (Volume:34 ,  Issue: 2 )