Summary: Parallel Implementation of Multiple Model Tracking Algorithms
appeared in IEEE Trans. on Parallel and Distributed Systems, Vol. 2, No. 2, pp. 242­252, April 1991
A. Averbuch
S. Itzikowitz \Lambda
T. Kapon
The Moise and Frida Eskenasy Institute of Computer Science
The Raymond and Beverly Sackler Faculty of Exact Sciences
Tel Aviv University
Tel Aviv 69978 , Israel
E­MAIL : amir@math.tau.ac.il
Abstract
Multifilter algorithms are usually applied in solving the maneuvering target tracking problem. How­
ever, in real applications, processing time may become impractical. Multiprocessors seem to offer the
throughput needed for such applications. In this paper we investigate the performances of Viterbi algo­
rithm and the Iterative Multiple Model algorithm, applied to the tracking problem, when implemented
on a general purpose shared­memory & shared­bus MIMD multiprocessor. The computational complex­
ity as well as the speedup and efficiencies are examined in detail. It is shown that the computational
complexity of the parallel implementation of these algorithms is about the same in both memory space
and processing time categories. Efficiency with P processors is about 1 \Gamma 1
p

Source: Averbuch, Amir - School of Computer Science, Tel Aviv University

Collections: Computer Technologies and Information Sciences