Definitions
Nearby Words

# Dead time

In particle and nuclear detector systems the dead time is the time after each event, during which the system is not able to record another event if it happens. An everyday life example of this is what happens when someone takes a photo using a flash - another picture cannot be taken immediately afterward because the flash needs a few seconds to recharge.

The total dead time of a detection system is usually due to the contributions of the intrinsic dead time of the detector (for example the drift time in a gaseous ionization detector), of the analog front end (for example the shaping time of a spectroscopy amplifier) and of the DAQ (the conversion time of the ADCs and the readout and storage times).

The intrinsic dead time of a detector is often due to its physical characteristics; for example a spark chamber is "dead" until the potential between the plates recovers above a high enough value. In other cases the detector, after a first event, is still "live" and does produce a signal for the successive event, but the signal is such that the detector readout is unable to discriminate and separate them, resulting in an event loss or in a so called "pile-up" event where, for example, a (possibly partial) sum of the deposited energies from the two events is recorded instead. In some cases this can be minimised by an appropriate design, but often only at the expense of other properties like energy resolution.

The analog electronics can also introduce dead time; in particular a shaping spectroscopy amplifier needs to integrate a fast rise, slow fall signal over the longest possible time (usually from .5 up to 10 microseconds) to attain the best possible resolution, such that the user needs to choose a compromise between event rate and resolution.

Trigger logic is another possible source of dead time; beyond the proper time of the signal processing, spurious triggers caused by noise need to be taken into account.

Finally, digitisation, readout and storage of the event, especially in detection systems with large number of channels like those used in modern High Energy Physics experiments, also contribute to the total dead time. To alleviate the issue, medium and large experiments use sophisiticated pipelining and multi-level trigger logic to reduce the readout rates.

From the total time a detection system is running, the dead time must be subtracted to obtain the live time of the experiment.

## Paralizable and non-paralizable behaviour

A detector, or detection system, can be characterized by a paralizable or non-paralizable behaviour.

In a non-paralizable detector, an event happening during the dead time since the previous event is simply lost, so that with an increasing event rate the detector will reach a saturation rate equal to the inverse of the dead time.

In a paralizable detector, an event happening during the dead time since the previous one will not just be missed, but will restart the dead time, so that with increasing rate the detector will reach a saturation point where it will be incapable of recording any event at all.

A semi-paralizable detector exhibits an intermediate behaviour, in which the event arriving during dead time does extend it, but not by the full amount, resulting in a detection rate that decreases when the event rate approaches saturation.

## Analysis

It will be assumed that the events are occurring randomly with an average frequency of f. That is, they constitute a Poisson process. The probability that an event will occur in an infinitesimal time interval dt is then f dt. The probability P(t) that an event will occur at time t  to t+dt with no events occurring between t=0 and time t  can be shown to be given by the exponential distribution (Lucke 1974, Meeks 2008):

$P\left(t\right)dt=fe^\left\{-ft\right\}dt,$

The expected time between events is then

$langle t rangle = int_0^infty tP\left(t\right)dt = 1/f$

### Non-paralizable analysis

For the non-paralizable case, with a dead time of $tau$, the probability of measuring an event between t=0 and $t=tau$ is zero. Otherwise the probabilities of measurement are the same as the event probabilities. The probability of measuring an event at time t with no intervening measurements is then given by an exponential distribution shifted by $tau$:

$P_m\left(t\right)dt=0,$ for $tletau,$

$P_m\left(t\right)dt=frac\left\{fe^\left\{-ft\right\}dt\right\}\left\{int_tau^infty fe^\left\{-ft\right\}dt\right\} = fe^\left\{-f\left(t-tau\right)\right\}dt$ for $t>tau,$

The expected time between measurements is then

$langle t_m rangle = int_tau^infty tP_m\left(t\right)dt = langle t rangle+tau$

In other words, if $N_m$ counts are recorded during a particular time interval and the dead time is known, the actual number of events (N) may be estimated by

$N approx frac\left\{N_m\right\}\left\{1-tau N_m\right\}$

If the dead time is not known, a statistical analysis can yield the correct count. For example (Meeks 2008), if $t_i$ are a set of intervals between measurements, then the $t_i$ will have a shifted exponential distribution, but if a fixed value D is subtracted from each interval, with negative values discarded, the distribution will be exponential as long as D is greater than the dead time $tau$. For an exponential distribution, the following relationship holds:

$frac\left\{langle t^n rangle\right\}\left\{langle t rangle^n\right\} = n!$

where n is any integer. If the above function is estimated for many measured intervals with various values of D subtracted (and for various values of n) it should be found that for values of D above a certain threshold, the above equation will be nearly true, and the count rate derived from these modified intervals will be equal to the true count rate.

## References

• W. R. Leo (1994). Techniques for Nuclear and Particle Physics Experiments. Springer. ISBN 3-540-57280-5.

Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 16, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9148335456848145, "perplexity_flag": "middle"}