Trellis Decoding And Applications To Multi-Target Tracking

Jack K. Wolf; Audrey M. Viterbi; Glenn S. Dixon

doi:10.1117/12.943924

3 May 1988 Trellis Decoding And Applications To Multi-Target Tracking

Jack K. Wolf, Audrey M. Viterbi, Glenn S. Dixon

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.

Citation Download Citation

Jack K. Wolf, Audrey M. Viterbi, and Glenn S. Dixon "Trellis Decoding And Applications To Multi-Target Tracking", Proc. SPIE 0876, Communications Networking in Dense Electromagnetic Environments, (3 May 1988); https://doi.org/10.1117/12.943924

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available