Computation of binary integration detection probabilities

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>