A toy model for understanding the space-point resolution of silicon pixel detectors with digital readout

arXiv:2606.03404 · physics.ins-det · Submitted 2026-06-02 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Physics. The day in general physics: instruments, methods and results across the field.

Kai: I'm Kai.

Mira: And I'm Mira, here with Lev.

Kai: We're looking at the paper: "A toy model for understanding the space-point resolution of silicon pixel detectors with digital readout".

Mira: Here's the gist of the paper. Silicon pixel detectors are widely used in high-energy physics experiments as tracking detectors close to the primary interaction vertex.

Kai: This work provides a simplified analytical and numerical model with which the maximum improvement achievable through charge sharing is quantified for both one and two-dimensional pixel geometries.

Mira: Analytic Modeling of Single-Pixel Clusters The limiting case of single-pixel (one-pixel) clusters is often used as a reference for many silicon pixel detectors.

Kai: For a one-dimensional case along the x-direction segmented into pixels with a uniform pitch p, the reconstructed position is given by the weighted average of the pad centres using the signal S(i, xtrue) as weight.

Paper summary: Kai: So, we're looking at this paper from arXiv, "A toy model for understanding the space-point resolution of silicon pixel detectors with digital readout". Basically, they've created a simplified analytical and numerical model to figure out how much better the resolution gets when charge sharing happens in one and two dimensional pixel geometries.

Mira: Right, so the main thrust here is quantifying the maximum improvement you can get from charge sharing beyond what you see in single-pixel clusters. They do this for both one and two dimensions, which is pretty important because most detectors are actually structured in multiple dimensions.

Lev: From my side, I'm interested in how they handle the practical aspect of this. When we move from a perfect theoretical model to real hardware with digital readout, the assumptions underpinning these kinds of models are crucial. We need to know what those assumptions actually mean for our error budgets.

Kai: Exactly. The paper sets up this toy model using some specific conditions, and they derive a phenomenological parameterization of the resolution based on the average cluster size. It's designed to be comparable with actual experimental data from several testbeams like ALPIDE and MOSS.

Mira: What's interesting is how they generalize it using a Heaviside step function to account for different cluster sizes, which means they can look at larger clusters too, not just the simple cases. They then find that the minimum resolution achieved in one dimension is still tied to that two-pixel limit.

Lev: That minimum resolution result, where sigma p equals one over two times the square root of twelve times p divided by a pi, seems like a solid anchor point for what's achievable even if you have many pixels clustering together. I mean, it suggests that this limit is really robust across different cluster sizes in one dimension.

Kai: And they validate this with experimental data from things like ALPIDE and MIMOSA, showing reasonable agreement between their parameterization and the measurements we get from those testbeams. That's a good sign for how useful this simplified model could be for interpreting real detector performance.

Mira: It really boils down to saying that the optimal resolution you can expect through charge sharing with binary readout is half of the single-pixel limit, and this happens whenever the average cluster size hits a half-integer value. That's a pretty specific condition they found for when this best case occurs.

Lev: From an engineering standpoint, if we consider that two dimensional toy Monte Carlo simulation they did to confirm that the average cluster size is actually a very good scaling variable for these resolution studies. That means we can use this average size as a way to scale up the model without having to do a whole new simulation every time we change the geometry.

Kai: So, what does this mean for us in practice? It suggests that instead of building incredibly complex simulations for every possible cluster shape, we can use this parameterization based on the average cluster size to get a good estimate of resolution improvement.

Mira: And they clearly state their limitation there. The model is simplified; it doesn't account for more realistic things like fluctuations in the energy loss or electronic noise, which are definitely present in real detectors. That's what they flag as something that needs future work to make it truly representative of the real world.

Lev: Yeah, so this toy model gives us a baseline understanding of how charge sharing helps resolution, but we have to be careful not to assume perfect conditions when applying this model to actual hardware measurements. It's a starting point for better things.

Kai: So if you had to summarize what the paper offers in one sentence, it’s that they provide a simplified analytical and numerical model that quantifies the maximum improvement from charge sharing for both one and two dimensional pixel geometries. That's the core of this work.

Mira: And when you look at the title, "A toy model for understanding the space-point resolution of silicon pixel detectors with digital readout", it tells us they are focusing on how to understand resolution in these detectors using a simplified setup rather than trying to solve everything at once. That's a pragmatic approach to modeling complex physics.

Lev: It points toward something practical, because they are comparing their derived parameterization directly against experimental data from various detector technologies, which grounds the theoretical work in some real-world performance metrics.

Kai: So overall, this paper gives us a way to understand the limits of resolution improvement through charge sharing based on cluster size, and it's validated against existing testbeam results. It’s a useful tool for researchers trying to benchmark their detector designs.

Conclusion: Kai: So we're looking at this paper from arXiv, "A toy model for understanding the space-point resolution of silicon pixel detectors with digital readout". Basically, they've created a simplified analytical and numerical model to figure out how much better the resolution gets when charge sharing happens in one and two dimensional pixel geometries.

Mira: Right, so the main thrust here is quantifying the maximum improvement you can get from charge sharing beyond what you see in single-pixel clusters. They do this for both one and two dimensions, which is pretty important because most detectors are actually structured in multiple dimensions.

Lev: From my side, I'm interested in how they handle the practical aspect of this. When we move from a perfect theoretical model to real hardware with digital readout, the assumptions underpinning these kinds of models are crucial. We need to know what those assumptions actually mean for our error budgets.

Kai: Exactly. The paper sets up this toy model using some specific conditions, and they derive a phenomenological parameterization of the resolution based on the average cluster size. It's designed to be comparable with actual experimental data from several testbeams like ALPIDE and MOSS.

Mira: What's interesting is how they generalize it using a Heaviside step function to account for different cluster sizes, which means they can look at larger clusters too, not just the simple cases. They then find that the minimum resolution achieved in one dimension is still tied to that two-pixel limit.

Lev: That minimum resolution result, where sigma p equals one over two times the square root of twelve times p divided by pi, seems like a solid anchor point for what's achievable even if you have many pixels clustering together. I mean, it suggests that this limit is really robust across different cluster sizes in one dimension.

Kai: And they validate this with experimental data from things like ALPIDE and MIMOSA, showing reasonable agreement between their parameterization and the measurements we get from those testbeams. That's a good sign for how useful this simplified model could be for interpreting real detector performance.

Mira: It really boils down to saying that the optimal resolution you can expect through charge sharing with binary readout is half of the single-pixel limit, and this happens whenever the average cluster size takes a half-integer value. That's a pretty specific condition they found for when this best case occurs.

Lev: From an engineering standpoint, if we consider that two dimensional toy Monte Carlo simulation they did to confirm that the average cluster size is actually a very good scaling variable for these resolution studies. That means we can use this average size as a way to scale up the model without having to do a whole new simulation every time we change the geometry.

Kai: So what does this mean for us in practice? It suggests that instead of building incredibly complex simulations for every possible cluster shape, we can use this parameterization based on the average cluster size to get a good estimate of resolution improvement.

Mira: And they clearly state their limitation there. The model is simplified; it doesn't account for more realistic things like fluctuations in the energy loss or electronic noise, which are definitely present in real detectors. That's what they flag as something that needs future work to make it truly representative of the real world.

Lev: Yeah, so this toy model gives us a baseline understanding of how charge sharing helps resolution, but we have to be careful not to assume perfect conditions when applying this model to actual hardware measurements. It's a starting point for better things.

Kai: So if you had to summarize what the paper offers in one sentence, it’s that they provide a simplified analytical and numerical model that quantifies the maximum improvement from charge sharing for both one and two dimensional pixel geometries. That's the core of this work.

Mira: And when you look at the title, "A toy model for understanding the space-point resolution of silicon pixel detectors with digital readout", it tells us they are focusing on how to understand resolution in these detectors using a simplified setup rather than trying to solve everything at once. That's a pragmatic approach to modeling complex physics.

Lev: It points toward something practical, because they are comparing their derived parameterization directly against experimental data from several detector technologies. This grounds the theoretical work in some real-world performance metrics.

Kai: So overall, this paper gives us a way to understand the limits of resolution improvement through charge sharing based on cluster size, and it's validated against existing testbeam results. It’s a useful tool for researchers trying to benchmark their detector designs.

Mira: And what this means for the wider field is that we have a better tool now to predict performance improvements without needing massive computational resources every time we change the pixel layout.

Lev: We still need to figure out how to plug in those noise and fluctuation effects you mentioned, but at least this gives us a solid starting point for where the resolution limits are supposed to land.

Marianna Mazzilli, Alexander Kalweit

Dipartimento Interateneo di Fisica M. Merlin and Sezione INFN, Bari, Italy · Experimental Physics Department, CERN

physics.ins-det

Submitted: 2026-06-02

Updated: 2026-11-06

Comments: 11 pages, 4 figures, several fixes in v2 (consistency of variables and axis labels)

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 83/100

The gist: Silicon pixel detectors are widely used in high-energy physics experiments as tracking detectors close to the primary interaction vertex.

Key concepts

Single-Pixel Clusters
This refers to the simplest case where only one pixel registers a signal. For a one-dimensional detector, this yields a resolution related to the pixel pitch 'p' by the formula σp = p/√12. It serves as a baseline reference for detector performance.
Charge Sharing Resolution
This describes how charge from an incident particle is distributed across multiple neighboring pixels instead of landing entirely in one. The model investigates how knowing whether one or two pixels fire helps constrain the particle's position, leading to a better resolution than single-pixel readings alone.
Average Cluster Size (⟨Npixels⟩)
This is a key variable used to generalize the model for larger groups of pixels. By expressing the resolution as a function of this average size, researchers found that the best achievable resolution remains constant at 1/2√12p when ⟨Npixels⟩ is a half-integer.
Phenomenological Parameterization
This is a mathematical description derived from the model that can be directly compared with real experimental data from various testbeams. This parameterization allows researchers to validate the theoretical predictions against actual detector performance measurements.

Terminology

Summary

Silicon pixel detectors are widely used in high-energy physics experiments as tracking detectors close to the primary interaction vertex. p. 0

Where the paper says it

A toy model for understanding the space-point resolution of silicon pixel detectors with digital readout Marianna Mazzilli1 and Alexander Kalweit2 1Dipartimento Interateneo di Fisica M. Merlin and Sezione INFN, Bari, Italy 2Experimental Physics department, CERN Abstract Silicon pixel detectors are widely used in high-energy physics experiments as tracking detectors close to the primary interaction vertex.

This work provides a simplified analytical and numerical model with which the maximum improvement achievable through charge sharing is quantified for both one and two-dimensional pixel geometries. p. 0
Where the paper says it

Charge sharing between neighboring pixels improves the resolution beyond the single-pixel limit, but in practice there is a lack of quantitative understanding of the achievable gains. This work provides a simplified analytical and numerical model with which the maximum improvement achievable through charge sharing is quantified for both one and two-dimensional pixel geometries.

Analytic Modeling of Single-Pixel Clusters

The limiting case of single-pixel (one-pixel) clusters is often used as a reference for many silicon pixel detectors. For a one-dimensional case along the x-direction segmented into pixels with a uniform pitch p, the reconstructed position is given by the weighted average of the pad centres using the signal S(i, xtrue) as weight. p. 1

Where the paper says it

The probability density f(xtrue) of the impinging position is described by a uniform distribution: f(xtrue) = ( 1/p −p/2 < xtrue < p/2 0 otherwise . (2) The reconstructed position xrec is given by the weighted average of the pad centres xi = ip, using the signal S(i, xtrue) on pad i for a given xtrue as weight: xrec = P i S(i, xtrue) · ip P i S(i, xtrue) .

For a one-pixel cluster, this reconstruction reduces to the centre of the central pixel xrec = 0. p. 1
Where the paper says it

(3) For a one-pixel cluster, the signal is defined as S(i, xtrue) = ( 1 −p/2 < xtrue < p/2, i = 0 0 otherwise . (4) The reconstructed position therefore reduced to the centre of the central pixel xrec = 0.

The resolution for one-pixel clusters yields the well-known result σp = p/√12 relation. p. 2
Where the paper says it

σ 2 p = Z p/2 −p/2 (xrec − xtrue) 2 f(xtrue) dxtrue = Z p/2 −p/2 x 2 true 1 p dxtrue (5) = 1 p 1 3 x 3 truep/2 −p/2 = 1 3p p 3 8 + p 3 8 (6) = p 2 12 . (7) This yields the well-known result σp = p/√ 12 relation for one-pixel clusters.

Resolution in One- and Two-Pixel Clusters

When both one and two pixel clusters occur, the reconstruction depends on whether neighboring pixels fire based on a minimal distance q from the pixel boundary beyond which charge sharing occurs. For the corresponding resolution, it is found that the optimal (minimal) resolution is achieved at q = p/4, yielding σp = 1/2√12p ≈ 0. p. 3

Where the paper says it

σ 2 p = Z q 0 y 2 1 p dy + Z p/2−q −p/2+q x 2 true 1 p dxtrue + Z 0 −q z 2 1 p dz (13) = 1 p 1 3 y 3 q 0 + 1 p 1 3 x 3 truep/2−q −p/2+q + 1 p 1 3 z 3 0 −q (14) = p 2 − 6pq + 12q 2 12 . (15) Setting dσ 2 p /dq = 0, we find that the optimal (minimal) resolution is achieved at q = p/4, yielding σp = 1 2 √ 12 p ≈ 0.

144p. This result has an intuitive interpretation: if one knows that only one pixel fires for −p/4 < xtrue < p/4 and two fire for p/4 < xtrue < p/2, the particle position is effectively constrained to half the pixel pitch. p. 3
Where the paper says it

exactly half of the one-pixel case. This result has an intuitive interpretation: if one knows that only one pixel fires for −p/4 < xtrue < p/4 and two fire for p/4 < xtrue < p/2, the particle position is effectively constrained to half the pixel pitch.

The case q = p/4 corresponds in practice to an average cluster size ⟨Npixels⟩ of 1. p. 3
Where the paper says it

This result has an intuitive interpretation: if one knows that only one pixel fires for −p/4 < xtrue < p/4 and two fire for p/4 < xtrue < p/2, the particle position is effectively constrained to half the pixel pitch. The case q = p/4 corresponds in practice to an average cluster size ⟨Npixels⟩ of ⟨Npixels⟩ = 1.

5, since in half of the cases one pixel fires and in the other half two pixels fire. p. 3
Where the paper says it

The case q = p/4 corresponds in practice to an average cluster size ⟨Npixels⟩ of ⟨Npixels⟩ = 1. 5, since in half of the cases one pixel fires and in the other half two pixels fire.

Generalization to Arbitrary Cluster Sizes

For investigating larger cluster sizes, the model is generalized by expressing it as a function of the average cluster size ⟨Npixels⟩ with the help of the Heaviside step function. The resolution σp is given by a piecewise expression in terms of ⟨Npixels⟩, which is simply the quadratic polynomial from Eq. p. 4

Where the paper says it

1 12 (7 − 9 ⟨Npixels⟩ + 3 ⟨Npixels⟩ 2 ) p 2 1 < ⟨Npixels⟩ < 2 1 12 (19 − 15 ⟨Npixels⟩ + 3 ⟨Npixels⟩ 2 ) p 2 2 < ⟨Npixels⟩ < 3 1 12 (37 − 21 ⟨Npixels⟩ + 3 ⟨Npixels⟩ 2 ) p 2 3 < ⟨Npixels⟩ < 4 1 12 (61 − 27 ⟨Npixels⟩ + 3 ⟨Npixels⟩ 2 ) p 2 4 < ⟨Npixels⟩ < 5 1 12 (91 − 33 ⟨Npixels⟩ + 3 ⟨Npixels⟩ 2 ) p 2 5 < ⟨Npixels⟩ < 6 1 12 (127 − 39 ⟨Npixels⟩ + 3 ⟨Npixels⟩ 2 ) p 2 6 < ⟨Npixels⟩ < 7 . While this piecewise expression appears complicated at first glance, it is simply the quadratic polynomial from Eq.

15 translated piecewise and expressed as a function of the average cluster size. p. 4
Where the paper says it

While this piecewise expression appears complicated at first glance, it is simply the quadratic polynomial from Eq. 15 translated piecewise and expressed as a function of the average cluster size.

Each parabolic segment has its minimum at σp = 1/2√12p, confirming that the two-pixel limit from Eq. p. 4
Where the paper says it

15 translated piecewise and expressed as a function of the average cluster size. Each parabolic segment has its minium at σp = 1 2 √ 12 p, confirming that the two-pixel limit from Eq.

16 is the best achievable resolution regardless of the cluster size in one dimension. p. 4
Where the paper says it

Each parabolic segment has its minium at σp = 1 2 √ 12 p, confirming that the two-pixel limit from Eq. 16 is the best achievable resolution regardless of the cluster size in one dimension.

Validation Against Experimental Data

The phenomenological parameterisation derived can be directly confronted with experimental data from various testbeams such as ALPIDE [3], pALPIDE-3b [4], MIMOSA [5], DPTS [6], APTS [7], and MOSS [8]. Figure 4 shows the phenomenological parameterisation of Eq. p. 7

Where the paper says it

In many testbeam campaigns, both parameters are simultaneously measured for detectors such as ALPIDE [3], pALPIDE-3b [4], MIMOSA [5], DPTS [6], APTS [7], and MOSS [8]. Figure 4 shows the phenomenolog ical parameterisation of Eq.

29 together with recent data from various testbeams. p. 7
Where the paper says it

Figure 4 shows the phenomenolog ical parameterisation of Eq. 29 together with recent data from various testbeams.

Reasonable agreement between data and simulation is found as shown in Fig. p. 8
Where the paper says it

In addition, some of the data shown are in preliminary status. Despite these limitations, reasonable agreement between data and simulation is found as shown in Fig.

4.

Summary of Findings

The optimal resolution achievable through charge sharing with binary readout is σp = 1/2√12p, corresponding to half the single-pixel limit. This result is independent of the cluster size and arises whenever the average cluster size takes a half-integer value. p. 8

Where the paper says it

Starting from analytical calculations for one-dimensional geometries, we demonstrated that the optimal resolution achievable through charge sharing with binary readout is σp = 1 2 √ 12 p, corresponding to half the single-pixel limit. This result is independent of the cluster size and arises whenever the average cluster size takes a half-integer value.

A two-dimensional toy Monte Carlo simulation confirmed that the average cluster size is an excellent scaling variable for resolution studies. p. 8
Where the paper says it

This result is independent of the cluster size and arises whenever the average cluster size takes a half-integer value. A two-dimensional toy Monte Carlo simulation confirmed that the average cluster size 9

Based on this observation, a practical phenomenological parameterisation was derived that was validated against testbeam data from several detector technologies. p. 9
Where the paper says it

serves as an excellent scaling variable for the resolution, regardless of the charge-cloud width. Based on this observation, we derived a practical phenomenological parameterization that was validated against testbeam data from several detector technologies, showing good agreement.

Future studies will extend this model in several directions. p. 9
Where the paper says it

Based on this observation, we derived a practical phenomenological parameterization that was validated against testbeam data from several detector technologies, showing good agreement. Future studies will extend this model in several directions: more realistic features such as fluctuations in the energy loss and detection process, electronic noise, as well as non-perpendicular track incidence angles.

Future Directions

Future studies will extend this model in several directions such as more realistic features like fluctuations in the energy loss and detection process, electronic noise, as well as non-perpendicular track incidence angles. In addition, additional pixel geometries including rectangular and hexagonal shapes will be investigated. p. 9

Where the paper says it

Future studies will extend this model in several directions: more realistic features such as fluctuations in the energy loss and detection process, electronic noise, as well as non-perpendicular track incidence angles. In additional, additional pixel geometries – including rectangular and hexagonal shapes – will be investigated.

Acknowledgements

The authors would like to acknowledge stimulating discussions with Lukas Lautner in the initial phase of the project and with the EP-ALI-DD group at CERN. The research of MM was founded by the QUASIMODO research grant (Quantum sensing for one health, CUP: H97G2300010001). p. 9

Where the paper says it

Acknowledgements The authors would like to acknowledge stimulating discussions with Lukas Lautner in the initial phase of the project and with the EP-ALI-DD group at CERN. The research of MM was founded by the QUASIMODO research grant (Quantum sensing for one health, CUP: H97G23000100001).

References

[1] Luciano Musa and Werner Riegler. Detectors for Relativistic Nuclear Collisions. p. 9

Where the paper says it

References [1] Luciano Musa and Werner Riegler. Detectors for Relativistic Nuclear Collisions.

Ann. Rev. Nucl. Part. Sci., 75(1):487–519, 2025. p. 9
Where the paper says it

Detectors for Relativistic Nuclear Collisions. , 75(1):487–519, 2025.

[2] M. Mager. ALPIDE, the Monolithic Active Pixel Sensor for the ALICE ITS upgrade. p. 9

Where the paper says it

, 75(1):487–519, 2025. ALPIDE, the Monolithic Active Pixel Sensor for the ALICE ITS upgrade.

Nucl. Instrum. Meth. A, 824:434–438, 2016. p. 9
Where the paper says it

ALPIDE, the Monolithic Active Pixel Sensor for the ALICE ITS upgrade. A, 824:434–438, 2016.

[3] Shreyasi Acharya et al. p. 9

Where the paper says it

A, 824:434–438, 2016. [3] Shreyasi Acharya et al.

ALICE upgrades during the LHC Long Shutdown 2. p. 9
Where the paper says it

[3] Shreyasi Acharya et al. ALICE upgrades during the LHC Long Shutdown 2.

JINST, 19(05):P05062, 2024. p. 9
Where the paper says it

ALICE upgrades during the LHC Long Shutdown 2. JINST, 19(05):P05062, 2024.

[4] M. Sulji´c. ALPIDE: the Monolithic Active Pixel Sensor for the ALICE ITS upgrade. p. 9

Where the paper says it

, 75(1):487–519, 2025. ALPIDE, the Monolithic Active Pixel Sensor for the ALICE ITS upgrade.

JINST, 11(11):C11025, 2016. p. 9
Where the paper says it

ALPIDE, the Monolithic Active Pixel Sensor for the ALICE ITS upgrade. A, 824:434–438, 2016.

[5] Michael Deveaux. Recent results from the R&D on the MIMOSIS CMOS MAPS. p. 7

Where the paper says it

Figure 4 shows the phenomenolog ical parameterisation of Eq. 29 together with recent data from various testbeams.

Presentation at Eleventh International Workshop on Semiconductor Pixel Detectors for Particles and Imaging (Pixel2024), April 2025. p. 0
Where the paper says it

Keywords: silicon pixel detectors, tracking, fast simulation of high energy physics detectors 1 Introduction One of the key performance parameters of modern tracking detectors is the space-point resolution σp. In particular, it directly enters into the momentum and distance-of-closest approach (DCA) resolution of charged particles.

[6] Gianluca Aglieri Rinella et al. Digital pixel test structures implemented in a 65 nm CMOS process. p. 4

Where the paper says it

In the following section, we compare this analytical expression to toy model results. 3 Toy models of pixel detectors To investigate the interplay between charge sharing, clustering, threshold effects, and spatial resolution under binary readout, two simplified detector models were implemented: a one-dimensional pixel array and a fully segmented two-dimensional pixel matrix.

Nucl. Instrum. Meth. A, 1056:168589, 2023.

[7] Gianluca Aglieri Rinella et al. Characterization of analogue Monolithic Active Pixel Sensor test structures implemented in a 65 nm CMOS imaging process. p. 9

Where the paper says it

, 75(1):487–519, 2025. ALPIDE, the Monolithic Active Pixel Sensor for the ALICE ITS upgrade.

Nucl. Instrum. Meth. A, 1069:169896, 2024. p. 9
Where the paper says it

ALICE upgrades during the LHC Long Shutdown 2. JINST, 19(05):P05062, 2024.

[8] Omar Abdelrahman et al. Characterisation of the first wafer-scale prototype for the ALICE ITS3 upgrade: The monolithic stitched sensor (MOSS). p. 9

Where the paper says it

, 75(1):487–519, 2025. ALPIDE, the Monolithic Active Pixel Sensor for the ALICE ITS upgrade.

Nucl. Instrum. Meth. A, 1086:171297, 2026. p. 0
Where the paper says it

03404v1 [physics. ins-det] 2 Jun 2026

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Improved understanding of charge sharing gains in digital readout systems: The model provides a way to quantify the ideal (maximal) resolution improvement achievable through charge sharing in detectors with binary readout.

  2. Enhanced design optimization for pixel geometry: The paper offers a phenomenological parameterisation of the resolution as a function of the average cluster size that can be used for detector simulation and design studies.

  3. Predictive performance modeling: The system can predict the spatial resolution given an average cluster size by using the derived formula from Eq. 22, which shows how resolution scales with Npixels.

  4. Benchmarking against experimental data: The phenomenological parameterisation in Eq. 29 allows for a direct confrontation with experimental data from various testbeams, enabling the comparison of simulation results with real detector performance.

Abstract

Silicon pixel detectors are widely used in high-energy physics experiments as tracking detectors close to the primary interaction vertex. They provide excellent space-point resolution together with fast electronic readout. Many of them employ only digital (binary) readout which makes the applicability of centre-of-gravity algorithms less obvious. Charge sharing between neighboring pixels improves the resolution beyond the single-pixel limit, but in practice there is a lack of quantitative understanding of the achievable gains. This work provides a simplified analytical and numerical model with which the maximum improvement achievable through charge sharing is quantified for both one and two-dimensional pixel geometries. A phenomenological parameterisation of the resolution as a function of the average cluster size is derived and compared to experimental data from several detector technologies.

Related papers