Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.13091/5144
Title: | Performance of the local reconstruction algorithms for the CMS hadron calorimeter with Run 2 data | Authors: | Tumasyan A. Adam W. Andrejkovic J.W. Bergauer T. Chatterjee S. Damanakis K. Dragicevic M. |
Keywords: | Calorimeters Data reduction methods Hadrons Bunch crossings Data reduction method Energy Energy depositions Hadron calorimeters Performance Proton proton collisions Pulse-shape Reconstruction algorithms Reduction method Calorimeters |
Publisher: | Institute of Physics | Abstract: | A description is presented of the algorithms used to reconstruct energy deposited in the CMS hadron calorimeter during Run 2 (2015-2018) of the LHC. During Run 2, the characteristic bunch-crossing spacing for proton-proton collisions was 25 ns, which resulted in overlapping signals from adjacent crossings. The energy corresponding to a particular bunch crossing of interest is estimated using the known pulse shapes of energy depositions in the calorimeter, which are measured as functions of both energy and time. A variety of algorithms were developed to mitigate the effects of adjacent bunch crossings on local energy reconstruction in the hadron calorimeter in Run 2, and their performance is compared. © 2023 CERN for the benefit of the CMS collaboration. Published by IOP Publishing Ltd on behalf of Sissa Medialab. Original content from this work may be used under the terms of the Creative Commons Attribution 4.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI. | URI: | https://doi.org/10.1088/1748-0221/18/11/P11017 https://hdl.handle.net/20.500.13091/5144 |
ISSN: | 1748-0221 |
Appears in Collections: | Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collections WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collections |
Show full item record
CORE Recommender
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.