Share Email Print

Proceedings Paper

Trellis Decoding And Applications To Multi-Target Tracking
Author(s): Jack K. Wolf; Audrey M. Viterbi; Glenn S. Dixon
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

In this paper we give a solution to the problems of finding the best set of K completely unmerged paths through a trellis with Mi≥K states at depth i in the trellis, i = 0, 1, 2, ..., N. Here, "best set" means that the sum of the metrics of all K paths in the set is minimized and "completely unmerged" means that no two paths pass through a common state. The solution involves using the Viterbi algorithm on (an expanded trellis with {Mi/k} states at depth i. We then apply this result to optimally separate the tracks of K targets in a multi-target radar system with measurement errors and extraneous measurements.

Paper Details

Date Published: 3 May 1988
PDF: 11 pages
Proc. SPIE 0876, Communications Networking in Dense Electromagnetic Environments, (3 May 1988); doi: 10.1117/12.943924
Show Author Affiliations
Jack K. Wolf, QUALCOMM, Incorporated (United States)
Audrey M. Viterbi, QUALCOMM, Incorporated (United States)
Glenn S. Dixon, QUALCOMM, Incorporated (United States)

Published in SPIE Proceedings Vol. 0876:
Communications Networking in Dense Electromagnetic Environments
Kepi Wu, Editor(s)

© SPIE. Terms of Use
Back to Top