Referenced Items are not available for this document.
We analyze a dynamic programming (DP)-based track before detect (TBD) algorithm. By using extreme value theory we obtain explicit expressions for various performance measures of the algorithm such as probability of detection and false alarm. Our analysis has two advantages. First the unrealistic Gaussian and independence assumptions used in previous works are not required. Second, the probability of detection and false alarm curves obtained fit computer simulated performance results significantly more accurately than previously proposed analyses of the TBD algorithm
Published in:
Aerospace and Electronic Systems, IEEE Transactions on
(Volume:38
,
Issue:
1
)
Date of Publication: Jan 2002
- Page(s):
- 228 - 242
- ISSN :
- 0018-9251
- INSPEC Accession Number:
- 7234757
- Digital Object Identifier :
- 10.1109/7.993242
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 07 August 2002
- Issue Date :
- Jan 2002
- Sponsored by :
- Aerospace & Electronic Systems Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
