A new three-dimensional track fit with multiple scattering
Modern semiconductor detectors allow for charged particle tracking with ever increasing position resolution. Due to the reduction of the spatial hit uncertainties, multiple Coulomb scattering in the detector layers becomes the dominant source for tracking uncertainties. In this case long distance ef...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
2017
|
| In: |
Nuclear instruments & methods in physics research. Section A, Accelerators, spectrometers, detectors and associated equipment
Year: 2016, Volume: 844, Pages: 135-140 |
| ISSN: | 1872-9576 |
| DOI: | 10.1016/j.nima.2016.11.012 |
| Online Access: | Verlag, Volltext: http://dx.doi.org/10.1016/j.nima.2016.11.012 Verlag, Volltext: http://www.sciencedirect.com/science/article/pii/S016890021631138X 
|
| Author Notes: | Niklaus Berger, Alexandr Kozlinskiy, Moritz Kiehn, André Schöning |
| Summary: | Modern semiconductor detectors allow for charged particle tracking with ever increasing position resolution. Due to the reduction of the spatial hit uncertainties, multiple Coulomb scattering in the detector layers becomes the dominant source for tracking uncertainties. In this case long distance effects can be ignored for the momentum measurement, and the track fit can consequently be formulated as a sum of independent fits to hit triplets. In this paper we present an analytical solution for a three-dimensional triplet(s) fit in a homogeneous magnetic field based on a multiple scattering model. Track fitting of hit triplets is performed using a linearization ansatz. The momentum resolution is discussed for a typical spectrometer setup. Furthermore the track fit is compared with other track fits for two different pixel detector geometries, namely the Mu3e experiment at PSI and a typical high-energy collider experiment. For a large momentum range the triplets fit provides a significantly better performance than a single helix fit. The triplets fit is fast and can easily be parallelized, which makes it ideal for the implementation on parallel computing architectures. |
|---|---|
| Item Description: | Published online: 20 November 2016 Gesehen am 04.05.2018 |
| Physical Description: | Online Resource |
| ISSN: | 1872-9576 |
| DOI: | 10.1016/j.nima.2016.11.012 |