CERN Accelerating science

Article
Title Level-0 trigger algorithms for the ALICE PHOS detector
Author(s) Wang, D (Hua-Zhong Normal U. ; Hua-Zhong Normal U., LQLP) ; Rohrich, D (Bergen U.) ; Wang, Y P (Hua-Zhong Normal U. ; Hua-Zhong Normal U., LQLP) ; Huang, G M (Hua-Zhong Normal U. ; Hua-Zhong Normal U., LQLP) ; Kral, J (Jyvaskyla U.) ; Yin, Z B (Hua-Zhong Normal U. ; Hua-Zhong Normal U., LQLP) ; Zhou, D C (Hua-Zhong Normal U. ; Hua-Zhong Normal U., LQLP) ; Zhang, F (Hua-Zhong Normal U.hina. ; Hua-Zhong Normal U., LQLP ; CERN) ; Ullaland, K (Bergen U.) ; Muller, H (CERN) ; Liu, L J (Hua-Zhong Normal U. ; Bergen U.)
Publication 2011
In: Nucl. Instrum. Methods Phys. Res., A 629 (2011) 80-86
DOI 10.1016/j.nima.2010.11.111
Subject category Detectors and Experimental Techniques
Accelerator/Facility, Experiment CERN LHC ; ALICE
Abstract The PHOS level-0 trigger provides a minimum bias trigger for p-p collisions and information for a level-1 trigger at both p-p and Pb-Pb collisions. There are two level-0 trigger generating algorithms under consideration: the Direct Comparison algorithm and the Weighted Sum algorithm. In order to study trigger algorithms via simulation, a simplified equivalent model is extracted from the trigger electronics to derive the waveform function of the Analog-or signal as input to the trigger algorithms. Simulations shown that the Weighted Sum algorithm can achieve higher trigger efficiency and provide more precise single channel energy information than the direct compare algorithm. An energy resolution of 9.75 MeV can be achieved with the Weighted Sum algorithm at a sampling rate of 40 Msps (mega samples per second) at 1 GeV. The timing performance at a sampling rate of 40 Msps with the Weighted Sum algorithm is better than that at a sampling rate of 20 Msps with both algorithms. The level-0 trigger can be delivered to ALICE CTP within 800 ns with a timing uncertainty of 2 LHC bunch crossing cycles. (C) 2010 Elsevier B.V. All rights reserved.

Corresponding record in: Inspire


 Record creato 2011-11-21, modificato l'ultima volta il 2016-06-29