Skip to Main Content
The moving window detection procedure for discrete data is studied. Bounds for the probabilities and expected values of the waiting time for a detection are derived. The bounds are evaluated for independent identically distributed zero-one Bernoulli trials, binomial, and Poisson random variables, and also for the two-state stationary Markov chain. The results are applicable to the theory of radar detection, time sharing systems, and quality control.
Date of Publication: May 1983