DocumentCode
849742
Title
Computation of binary integration detection probabilities
Author
Sarwate, Dilip
Author_Institution
Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA
Volume
27
Issue
6
fYear
1991
fDate
11/1/1991 12:00:00 AM
Firstpage
894
Lastpage
897
Abstract
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\n\n\t\t
Keywords
computerised signal processing; iterative methods; probability; signal detection; telecommunications computing; Brunner´s algorithm; asymptotically efficient algorithms; binary integration detection probabilities; computerised signal processing; efficient iterative method; probability of detection; threshold crossing; Iterative algorithms; Iterative methods;
fLanguage
English
Journal_Title
Aerospace and Electronic Systems, IEEE Transactions on
Publisher
ieee
ISSN
0018-9251
Type
jour
DOI
10.1109/7.104254
Filename
104254
Link To Document