Referenced Items are not available for this document.
Efficient algorithms are described for computing the probability of detection for a binary integration when the probability of a threshold crossing changes from sample to sample. A binary integrator is exceeded (a hit occurs) in a sequence of N trials and declares a detection if the number of hits is at least as large as some number M, where O
Published in:
Aerospace and Electronic Systems, IEEE Transactions on
(Volume:27
,
Issue:
6
)
Date of Publication: Nov 1991
- Page(s):
- 894 - 897
- ISSN :
- 0018-9251
- INSPEC Accession Number:
- 4084008
- Digital Object Identifier :
- 10.1109/7.104254
- Date of Current Version :
- 09 July 2003
- Issue Date :
- Nov 1991
- 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.
