The Community for Technology Leaders
Green Image
<p>The implementations of the Viterbi algorithm (VA) and the interacting multiple model(IMM) algorithm on a shared-bus and shared-memory multiple-input multiple-data (MIMD) multiprocessor are discussed. The computational complexity as well as the speedup and efficiency 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-1/P for small P and is expected to be relatively high for large P, especially when many filters and large state and measurement vectors are considered.</p>
Index Termsinteracting multiple model algorithm; parallel algorithms; multiple model tracking; Viterbi algorithm; MIMD; computational complexity; parallel implementation; computational complexity; computerised signal processing; parallel algorithms
T. Kapon, A. Averbuch, S. Itzikowitz, "Parallel Implementation of Multiple Model Tracking Algorithms", IEEE Transactions on Parallel & Distributed Systems, vol. 2, no. , pp. 242-252, April 1991, doi:10.1109/71.89069
77 ms
(Ver 3.3 (11022016))