A Full Rank Pileup Deconvolution Scheme Suitable for Calorimeter Online Trigger Primitive Generation
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916007963000832 |
|---|---|
| author | Wu, Jin-yuan |
| author_facet | Wu, Jin-yuan |
| contents | In this document, a pileup deconvolution scheme not relying on any mathematics guessing is presented. In high energy physics experiment, as the luminosity increases, pile-up issues on detectors such as calorimeters become non-negligible. Deconvolution approaches developed for data taken from DAQ systems are usually rank-deficient or underdetermined, having less equations than unknowns, even with the ADC values from multiple beam crossings are collected. These deconvolution approaches need mathematic pre-assumptions such as Sparse Representation. For online computation tasks such as for trigger primitive creation, signal availability is significantly different as in offline data analysis stage, and therefore, it is possible to use different (yet simpler) algorithms. In this situation, number of ADC values of the calorimeter outputs is the same as the number of beam crossings (or 4 times number of beam crossings, depending on the ADC sampling rate), and therefore, the number of equations can be arranged to be the same as number of unknowns. This way, a determined deconvolution scheme with a full-rank squared convolution (and deconvolution) matrix becomes possible. The robustness of deconvolution over long time windows is also studied in this paper. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_13956 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Full Rank Pileup Deconvolution Scheme Suitable for Calorimeter Online Trigger Primitive Generation Wu, Jin-yuan Instrumentation and Detectors In this document, a pileup deconvolution scheme not relying on any mathematics guessing is presented. In high energy physics experiment, as the luminosity increases, pile-up issues on detectors such as calorimeters become non-negligible. Deconvolution approaches developed for data taken from DAQ systems are usually rank-deficient or underdetermined, having less equations than unknowns, even with the ADC values from multiple beam crossings are collected. These deconvolution approaches need mathematic pre-assumptions such as Sparse Representation. For online computation tasks such as for trigger primitive creation, signal availability is significantly different as in offline data analysis stage, and therefore, it is possible to use different (yet simpler) algorithms. In this situation, number of ADC values of the calorimeter outputs is the same as the number of beam crossings (or 4 times number of beam crossings, depending on the ADC sampling rate), and therefore, the number of equations can be arranged to be the same as number of unknowns. This way, a determined deconvolution scheme with a full-rank squared convolution (and deconvolution) matrix becomes possible. The robustness of deconvolution over long time windows is also studied in this paper. |
| title | A Full Rank Pileup Deconvolution Scheme Suitable for Calorimeter Online Trigger Primitive Generation |
| topic | Instrumentation and Detectors |
| url | https://arxiv.org/abs/2511.13956 |