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<>
Computation of binary integration detection probabilities
IEEE Transactions on Aerospace and Electronic Systems ; 27 , 6 ; 894-897
1991-11-01
321599 byte
Article (Journal)
Electronic Resource
English
Computation of Transient Probabilities of Electric Power Plants
Online Contents | 1999
|Computation of Error Probabilities in Group Classification of Random Matrices
British Library Online Contents | 1996
|