Class | Description |
---|---|
Discriminator |
Class that implements a software addaption of a discriminator in the sense of
the device used on FACTs FTU (Trigger Unit) boards.
|
Discriminator.DiscriminatorOutput |
A simple class to hold the result of the discriminator
|
EmulateDiscriminator |
Emulate a discriminator that is working on the summed timeseries of the patches.
|
EmulateLogic |
Emulate the n-out-of-4 trigger logic of the trigger unit
and the n-out-of-40 logic of the trigger master
by applying it to the array of trigger primitives.
|
findMaximumTriggerThreshold |
Scan the TriggerThreshold for each event in order to find the maximum possible threshold to keep the event
* Created by jbuss on 26.08.18.
|
Ratescan |
Emulates a ratescan on summed patch time series.
|
SumUpPatches |
Sum up the signals of each patch and return an array of patchwise timeseries.
|
Discriminator
is a class with functions to
discriminate the signal of a given patch (or a bunch of them). Furthermore it contains helper funtions
for the discrimination e.g. conversion between DAC and mV.
EmulateDiscriminator
is a processor that emulates
a discriminator that is working on the summed timeseries of patches. It uses functions from Discriminator
EmulateLogic
is a processor that emulates th n-out-of-4 trigger logic of FACT's
trigger unit and the n-out-of-40 logic of the trigger master by applying it to the array of trigger primitives compiled
by EmulateDiscriminator
Ratescan
is a processor that performs a software ratescan on summed patch time series
by iterating over a list of thresholds and applying Discriminator
to the data
findMaximumTriggerThreshold
is a processor that Scan the TriggerThreshold for each
event in order to find the maximum possible threshold to keep the event by applying
Discriminator
.
SumUpPatches
lets you sum up the signals of each patch element wise and
returns an array of patchwise timeseries;
A typical process for a software trigger
A typical process for a software ratescan
A typical process for a max trigger search * *
* ** * * *
Copyright © 2019. All rights reserved.