hec_search_1.f [#]

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^

includes the following commons:

    hec_par.inc
    hec_adc.inc
    hec_datacard.inc
    hec_geo.inc
    hec_ped.inc
    hec_search.inc
    hec_search_1_sys.inc
    hec_trig.inc

This routine performs the standard search algorithm. (now it really happens..!)

    It loops over all adc channels.
        For each channel, it takes the mean (p) and sigma (s) of the pedestal.
        It loops over all timpe slices of the channel and gets the adc value.
        after the time-slice loop, it sortzv's the adc values, and picks
        out the time slice with the highest value.
        Then take the index of that time-slice and look at other
        time-slices (from 2 before till 4 after) around the slice of the peak.

-----------------------------------------
Here are the comments from the routine itself:

c Let the datacard search have the following parameters:
c 2= i_t1
c 3= i_t2
c 4= ntc
c 5= i_cutflag
c 6= cut
c for each channel the standard algorithm searches for
c the maximum adc in the timeslice range [i_t1, i_t2]
c Case i_cutflag = 0:
c the time distribution is compared to a valid pulse shape.
c the comparison uses ntc timeslices (only the values
c 3, 5 and 7 are implemented).
c Case i_cutflag = 1:
c if this maximum is above the value cut*rms, where rms
c is the channel's pedestal rms, then
c the time distribution is compared to a valid pulse shape.
c the comparison uses ntc timeslices (only the values
c 3, 5 and 7 are implemented).
c
c variables specific to this algorithm are in
c hec_search_1_sys.inc