Parallel implementation of multiple model tracking algorithms

Author

Averbuch, Amir ; Itzikowitz, Samuel ; Kapon, Tal

Author_Institution

Sch. of Math. Sci., Tel Aviv Univ., Israel

Volume

2

Issue

2

fYear

1991

fDate

4/1/1991 12:00:00 AM

Firstpage

242

Lastpage

252

Abstract

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

Keywords

computational complexity; computerised signal processing; parallel algorithms; MIMD; Viterbi algorithm; computational complexity; interacting multiple model algorithm; multiple model tracking; parallel algorithms; parallel implementation; Bayesian methods; Computational complexity; Equations; Filters; Noise measurement; Radar tracking; Target tracking; Time measurement; Viterbi algorithm; White noise;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/71.89069

Filename

89069