3 May 1988 Trellis Decoding And Applications To Multi-Target Tracking
Author Affiliations +
Proceedings Volume 0876, Communications Networking in Dense Electromagnetic Environments; (1988) https://doi.org/10.1117/12.943924
Event: 1988 Los Angeles Symposium: O-E/LASE '88, 1988, Los Angeles, CA, United States
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.
© (1988) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jack K. Wolf, Jack K. Wolf, Audrey M. Viterbi, Audrey M. Viterbi, Glenn S. Dixon, Glenn S. Dixon, "Trellis Decoding And Applications To Multi-Target Tracking", Proc. SPIE 0876, Communications Networking in Dense Electromagnetic Environments, (3 May 1988); doi: 10.1117/12.943924; https://doi.org/10.1117/12.943924
PROCEEDINGS
11 PAGES


SHARE
Back to Top