Cumulative Detection Probability
How Detection Odds Accumulate Over a Search
A surveillance radar rarely detects a target the first time the beam sweeps past it. At long range the returned signal is weak, the instantaneous SNR is low, and the single-scan probability of detection may sit at 0.1 or 0.2 against a fixed false-alarm threshold. What makes search radar effective is repetition: each frame revisits the same volume, and every look is a fresh, largely independent chance to cross the detection threshold. Cumulative detection probability formalizes that intuition. It answers the operational question, what is the probability the target has been declared by the time it reaches a given range, rather than the narrower question of whether any single look succeeds.
The mechanism that drives Pc upward during an engagement is the range dependence of received power. As an inbound target closes, received signal power scales as 1/R4, so SNR climbs steeply, and per-scan Pd rises from near zero toward unity over a relatively short stretch of range. The cumulative product therefore stays low while the target is far out and then sharpens rapidly as it enters the high-SNR region. This is why a plot of Pc versus range has a characteristic knee, and why specifying a radar at "Pc = 0.9 at R km" captures search performance far better than a single-scan number.
The fraction of scans that yield a detection at a particular range is the blip-scan ratio, and it is essentially the per-scan Pd measured empirically. Because the number of available looks depends on how long the target remains in coverage, the revisit time of the search frame is a first-order design lever: halving the frame time doubles the look count during the closing geometry and lifts the cumulative detection range without any change to transmitter power or antenna gain.
Cumulative Probability Equations
Pc = 1 − ∏i=1N(1 − Pd,i)
Equal-scan special case (constant Pd):
Pc = 1 − (1 − Pd)N
Scans available during closing geometry:
N ≈ (R0 − R) / (vc × Tscan)
Per-scan SNR vs. range (monostatic):
SNR(R) ∝ 1 / R4 → Pd rises sharply as R decreases
Where N = number of independent looks, Pd,i = single-scan probability of detection on scan i, R0 = range at search entry, vc = closing velocity, Tscan = revisit time. Example: Pd = 0.3, N = 10 → Pc = 1 − 0.710 ≈ 0.97.
Single-Scan vs. Cumulative Performance
| Per-scan Pd | Pc after 3 scans | Pc after 5 scans | Pc after 10 scans | Scans to reach Pc ≥ 0.90 |
|---|---|---|---|---|
| 0.10 | 0.27 | 0.41 | 0.65 | 22 |
| 0.20 | 0.49 | 0.67 | 0.89 | 11 |
| 0.30 | 0.66 | 0.83 | 0.97 | 7 |
| 0.50 | 0.88 | 0.97 | 0.999 | 4 |
| 0.80 | 0.992 | 0.9997 | >0.9999 | 2 |
Frequently Asked Questions
How does cumulative detection probability differ from single-scan probability of detection?
Single-scan Pd is the chance of declaring a target on one look at a given SNR and false-alarm threshold. Cumulative Pc is the chance of detecting on at least one of N successive scans: Pc = 1 − ∏(1 − Pd,i) for independent looks. As the target closes, per-scan SNR rises as 1/R4, so a 0.3 single-scan Pd reaches about 0.97 cumulative after 10 scans.
What is cumulative detection range and why is it longer than single-scan range?
It is the range at which Pc first reaches a specified value, usually 0.9, as the target approaches. It exceeds the single-scan 0.9 range because every extra scan adds an independent detection chance. With a 10 second frame against a Mach 1 inbound, the added looks during closing typically extend effective range 15 to 30% beyond the single-look figure.
How do scan-to-scan correlation and Swerling fluctuation affect the calculation?
The product rule assumes independent scan decisions. That holds for slow-fluctuating Swerling I and III targets that decorrelate between scans. For a steady Swerling 0 target with correlated RCS across scans, the looks are not independent and true Pc falls below the product-rule estimate, so designers apply a correlation factor or use measured blip-scan data to avoid overstating performance.