identification is used to identify the particle type of each track. This
is particularly important for the hadrons (
,
,
and
)
because they interact similarly in matter. These particles
are identified by examining the light and its distribution.
The identification algorithm (called 23) used in FOCUS is based on
likelihood ratios between the various particle hypotheses. The particle
possibilities considered for each track are
,
,
,
and
.24 For each of these four hypotheses the
likelihood,
,
is calculated by observing the status of the cells
within the cone of the particle. The probability that a particle
associated with a track of known momentum25 will
fire a particular cell is computed using Poisson statistics. This
calculation is based on the predicted number of photons striking the cell
under each particle hypothesis. An accidental firing rate is also included in
this calculation to model spurious hits; this cell-by-cell correction factor
depends on the beam intensity on an event-by-event basis. The accidental
firing rates are typically less than 1% except for cells close to the
uninteracting beam.
The product of the firing probabilities for all relevant cells in the three
detectors is computed to form
.
The value
is calculated for each particle hypothesis i.
identification is performed by cutting on the difference between two
likely hypothesis. For example, a typical cut separating a kaon from a pion is
| (11) |
to be larger than
This identification method has distinct advantages over the standard method of particle identification using threshold detectors, which simply determines the on/off status of the cells and return a simple yes or no for consistency with a given particle hypothesis. First, discrimination between two hypotheses can be extended beyond the threshold momentum ranges. Second, using this likelihood approach, the cuts can be more carefully selected and tuned for a particular physics analysis since there is a continuous value to cut on rather than simple on/off values for each particle hypothesis. The algorithm is fully described in Wiss:citadl_design_memo.