This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Properties of the Center of Gravity as an Algorithm for Position Measurements: Two-Dimensional Geometry

Gregorio Landi

Dipartimento di Fisica e Astronomia, Universita’ di Firenze and INFN
Largo E. Fermi 2 (Arcetri) 50125, Firenze, Italy

Corresponding author. Gregorio.Landi@fi.infn.it
(October 5, 2002 and February 26, 2021)
Abstract

The center of gravity as an algorithm for position measurements is analyzed for a two-dimensional geometry. Several mathematical consequences of discretization for various types of detector arrays are extracted. Arrays with rectangular, hexagonal, and triangular detectors are analytically studied, and tools are given to simulate their discretization properties. Special signal distributions free of discretized error are isolated. It is proved that some crosstalk spreads are able to eliminate the center of gravity discretization error for any signal distribution (ideal detectors). Simulations, adapted to the CMS em-calorimeter and to a triangular detector array, are provided for energy and position reconstruction algorithms with a finite number of detectors.

PACS 07.05.Kf; 06.30.Bp; 42.30.Sy

Keywords: Center of Gravity, Centroiding, Position Measurements

1 Introduction 2021

The aim of this paper was the study of the e.m. calorimeters, the pixel detectors were in an early stages and we neglected them. The availability of data on silicon micro-strip detectors deviated our attention from this aim, and from further extension to a three-dimensional spherical geometry. Preliminary steps in this last direction showed error patterns very similar to those in the following, with deep valleys near to exact reconstructions. However, the complexity of the Bessel j-functions suggested an early abandon of the project for the probably lack of readers. Instead, the silicon micro-strips are an ideal one dimension system, perfect for ref. [1]. The deep analysis of those data, evidenced the impossibility of a single variance for each hit (homoscedasticity), as it is usually assumed in track fitting. The study of methods to handle those probabilities absorbed all our attentions and produced very interesting new results. This shift of interests, did not allow applications of the two-dimension COG properties, even if the recent use of the silicon pixel-detectors would be a perfect combination of tracking and positioning. However, the difficulty to access to data hinders this possibility. The complexity of the developments here described requires a mathematical skill not frequent among the experimental staffs. Unfortunately, the reconstruction algorithms are complex mathematical instruments and any data analysis can not avoid those complications. Some printing errors, due to the splitting of the equations in two columns, were corrected. The explicit definition of the ideal detector is introduced also for this two-dimensional geometry, as we did for the one dimension system in arXiv:1908.04447. In successive works, these types of detectors were indicated in this synthetic way, sure of its introduction here and in ref. [1]. Among the beneficial effects of the absence of the discretization errors (ideal detectors), it must be recalled its effectiveness in the noise regularization with a drastic simplification in the handling of the detector heteroscedasticity.

2 Introduction

The center of gravity (COG) is a widespread method of pattern recognition used in experimental works as a tool to improve position reconstruction from sets of measurements. Our previous work [1] was devoted to the introduction of methods to define COG properties when the COG is applied. The approach [1] was limited to one-dimensional systems, and only a marginal attention was devoted to two-dimensional systems, when they can be reverted to two one-dimensional systems. This condition covers only a restricted class of two-dimensional detectors: Array of rectangular detectors with constant efficiency, no loss at the border, the COG algorithm calculated with an infinite row of detectors in one direction. Thus, the dependence of the signal distribution on yy does not contribute to the COG calculation in xx, and the two-dimensional problem is split into two one-dimensional configurations. These limitations could be very unrealistic in a few cases, even for detectors of the indicated type. Detectors of different shapes, hexagonal, triangular etc. can never be reduced to two one-dimensional configurations.

Generalization to a two-dimensional geometry entails additional complications compared to  [1], and many more forms and setups are allowed. In this work, we will limit our considerations to parallelogram, hexagon, and triangle detector arrays. These forms cover almost all the types of detectors used in high-energy physics. Although the triangular forms have not been widely used in recent years, the Crystal Ball detector  [2] has an em-calorimeter with triangular-section crystals. The study of the triangular forms allows us to determine the method to treat far more complex detector arrays.

As will be evident, this work is largely based on the results of  [1], but due to the necessity of a two-dimensional generalization and the special handling required by the hexagons and triangles, almost all the equations will be derived in the new context. Array periodicity is a fundamental tool for our derivations. A group of detectors can easily be approximated with a periodic lattice owing to the finite—generally small—range of the signal distributions that affects a small number of detectors, which can almost always be replicated as a periodic mosaic. For this reason, Section 2 introduces the initial definitions and the general equations that are valid for any type of periodic detector array.

In Section 3, the equations are applied to three types of detector array: Parallelograms, hexagons, and triangles. The triangle array exemplifies the way of handling any type of detector mosaic.

Section 4 is devoted to the study of the signal distributions whose COGs are free of discretization errors. It will be evident that the parallelograms, hexagons, and triangles are an extremely reduced sample of the class of signal distributions that have exact COGs at particular sizes. It is surprising how large this class is compared to the one-dimensional case.

Section 5 deals with the modifications introduced by loss and crosstalk. Loss destroys the splitting of a two-dimensional problem into two one dimensions, even for an array of rectangular detectors. There is a large set of crosstalk functions that saves the norm and spreads the incident signal among the detectors in such a way as to eliminate the COG errors for any type of signal distribution. We will also determine the connection to other mathematical properties far from the COG problems.

In Section 6, array periodicity is abandoned and a method to handle a finite set of detectors is defined. The method is applied to the CMS and Crystal Ball em-calorimeter.

Section 7 concludes and summarizes the results.

3 Sampling in Two Dimensions

3.1 Definition of the Formalism

To introduce some notation, let us consider an array of rectangular detectors as shown in

Refer to caption
Figure 1: Array of rectangular detectors, τ1\tau_{1} is the xx-distance of the centers of two neighboring detectors, τ2\tau_{2} is the yy-distance.

Fig. 1. The two constants τ1\tau_{1} and τ2\tau_{2} establish the size of the array; τ1\tau_{1} is the distance from the center of a detector to the center of its neighbor in xx-direction, τ2\tau_{2} is the same in yy-direction. If τ1=τ2\tau_{1}=\tau_{2}, the detectors have a square section.

As in  [1], we will mainly consider average signal distributions on which we impose some symmetry conditions deriving from the assumed homogeneity of the medium where the signal distribution is produced. These conditions are not essential to our procedures. The equations are able to handle nonsymmetric signal distributions as well, but the asymmetry is rarely experimentally measurable, thereby forcing us to consider averages over asymmetries. Simulation differs in that the asymmetric signal distributions can be easily generated and accounted for. Other implicit conditions are positivity and connectedness of the signal distribution (an em shower in a calorimeter); no limitations of these type will affect the equations, and we will give examples of nonconnected signal distributions.

Let us define φ(𝐱)\varphi(\mathbf{x}) as the signal distribution. As vectorial notation will be used almost everywhere, 𝐱\mathbf{x} indicates variables x,yx,y. We will abandon the vectorial notation when the expressions are not overly long. On φ(𝐱)\varphi(\mathbf{x}), we impose the following two conditions:

2d𝐱𝐱φ(𝐱)=0,\displaystyle\int_{\mathbb{R}^{2}}\mathrm{d}\mathbf{x}\ \mathbf{x}\varphi(\mathbf{x})=0, (1)
2d𝐱φ(𝐱)=1.\displaystyle\int_{\mathbb{R}^{2}}\ \mathrm{d}\mathbf{x}\ \varphi(\mathbf{x})=1. (2)

Equation (1) fixes the position of the two COGs 𝐫g=(xg,yg)\mathbf{r}_{g}=(x_{g},y_{g}) of φ(𝐱)\varphi(\mathbf{x}) at the origin of the axes, where as explained in Fig. 1, the COG of a detector is located. It is clear that a symmetric signal distribution φ(𝐱)=φ(𝐱)\varphi(\mathbf{x})=\varphi(-\mathbf{x}) satisfies the two equations. Equation (2) is a normalization condition that eliminates a constant in some of the following procedures.

A good detector generally performs a linear transformation on the collected signal. For example, a good crystal of an em-calorimeter integrates the energy converging on it. The most general linear transformation on the signal distribution induced by a detector is the convolution:

f(𝐱)=2g(𝐱𝐱)φ(𝐱)d𝐱,\mathrm{f}(\mathbf{x})=\int_{\mathbb{R}^{2}}\mathrm{g}(\mathbf{x}-\mathbf{x}^{\prime})\varphi(\mathbf{x}^{\prime})\,\mathrm{d}\mathbf{x}\ , (3)

where g(𝐱)(\mathbf{x}) embodies the effects of the detector. If φ(𝐱)\varphi(\mathbf{x}) is shifted from the origin by a vector 𝜺=(ε1;ε2)\boldsymbol{\varepsilon}=(\varepsilon_{1};\varepsilon_{2}) in xx-direction and in yy-direction, f(𝐱)(\mathbf{x}) becomes:

f𝜺(𝐱)=2g(𝐱𝐱)φ(𝐱𝜺)d𝐱.{\mathrm{f}_{\boldsymbol{\varepsilon}}}(\mathbf{x})=\int_{\mathbb{R}^{2}}\mathrm{g}(\mathbf{x}-\mathbf{x}^{\prime})\varphi(\mathbf{x}^{\prime}-\boldsymbol{\varepsilon})\,\mathrm{d}\mathbf{x}^{\prime}\ . (4)

For the properties of the convolution [3] we get:

f𝜺(𝐱)=2g(𝐱𝜺𝐱)φ(𝐱)d𝐱,\mathrm{f}_{\boldsymbol{\varepsilon}}(\mathbf{x})=\int_{\mathbb{R}^{2}}\mathrm{g}(\mathbf{x}-\boldsymbol{\varepsilon}-\mathbf{x}^{\prime})\varphi(\mathbf{x}^{\prime})\,\mathrm{d}\mathbf{x}^{\prime}\ ,

so f(𝐱)𝜺{}_{\boldsymbol{\varepsilon}}(\mathbf{x}) becomes:

f𝜺(𝐱)=f(𝐱𝜺).\mathrm{f}_{\boldsymbol{\varepsilon}}(\mathbf{x})=\mathrm{f}(\mathbf{x}-\boldsymbol{\varepsilon})\ . (5)

With the normalization of Eq. (2) and assuming Eq. (1) even for g(𝐱)(\mathbf{x}), the definition of the COG is proportional to the first moment of f(𝐱)𝜺{}_{\boldsymbol{\varepsilon}}(\mathbf{x}). Convolution theorems [3] state that the first moment of f(𝐱)𝜺{}_{\boldsymbol{\varepsilon}}(\mathbf{x}) is the sum of the first moment of g(𝐱)(\mathbf{x}) and the first moment of φ(𝐱𝜺)\varphi(\mathbf{x}-\boldsymbol{\varepsilon}). Hence, for our choice of the reference system, the COG of f(𝐱)𝜺{}_{\boldsymbol{\varepsilon}}(\mathbf{x}) is 𝜺\boldsymbol{\varepsilon}. At this level, the linear transformation of Eq. (4) on the signal distribution does not modify the COGs positions.

3.2 Sampling on a Rectangular Lattice

It is evident that Eq. (4) is not the true transformation performed by the detector on the signal. The function f(𝐱)𝜺{}_{\boldsymbol{\varepsilon}}(\mathbf{x}) is not measured for any 𝐱2\mathbf{x}\in\mathbb{R}^{2} nor does the detector continuously "scan" the signal distribution. The measuring device is a set of detectors that are well fixed in definite spatial points, and they give only a sampling of the function f(𝐱)𝜺{}_{\boldsymbol{\varepsilon}}(\mathbf{x}) with very few points above the detector noise. This discretization is the principal source of systematic error of the COG as a position reconstruction algorithm.

The detectors in the array will be considered identical and arranged in a periodic rectangular lattice. To simplify the notations, we shall consider in the following n,l2n,l\in\mathbb{Z}^{2}, and in absence of other indication our sums will run over n,l2n,l\in\mathbb{Z}^{2}. We will indicate the constants of the sampling lattice as 𝐝1=(τ1;0)\mathbf{d}_{1}=(\tau_{1};0) and 𝐝2=(0;τ2)\mathbf{d}_{2}=(0;\tau_{2}). If {\big{\{}f(n𝐝1+l𝐝2)𝜺}{}_{\boldsymbol{\varepsilon}}(n\mathbf{d}_{1}+l\mathbf{d}_{2})\big{\}} is a set of sampled values extracted from f(𝐱)𝜺{}_{\boldsymbol{\varepsilon}}(\mathbf{x}), the COG 𝐫g=(xg;yg)\mathbf{r}_{g}=(x_{g};y_{g}) of the set is given by (with xgx_{g} the COG in xx-direction and ygy_{g} the COG in yy-direction):

𝐫g=n,l(n𝐝1+l𝐝2)f𝜺(n𝐝1+l𝐝2)n,lf𝜺(n𝐝1+l𝐝2)=1.\mathbf{r}_{g}=\sum_{n,l}\ (n\mathbf{d}_{1}+l\mathbf{d}_{2})\mathrm{f}_{\boldsymbol{\varepsilon}}(n\mathbf{d}_{1}+l\mathbf{d}_{2})\ \ \ \ \ \sum_{n,l}\mathrm{f}_{\boldsymbol{\varepsilon}}(n\mathbf{d}_{1}+l\mathbf{d}_{2})=1\ . (6)

Assuming a lossless detector array, the sampling of f(𝐱)𝜺{}_{\boldsymbol{\varepsilon}}(\mathbf{x}) saves the normalization. In the presence of loss, the normalization is no longer saved, and 𝐫g\mathbf{r}_{g} can be recast in the form:

𝐫g(𝜺)=𝜺+n,l(n𝐝1+l𝐝2𝜺)f(n𝐝1+l𝐝2𝜺)n,lf(n𝐝1+l𝐝2𝜺),\mathbf{r}_{g}(\boldsymbol{\varepsilon})=\boldsymbol{\varepsilon}+\frac{\sum_{n,l}(n\mathbf{d}_{1}+l\mathbf{d}_{2}-\boldsymbol{\varepsilon})\mathrm{f}(n\mathbf{d}_{1}+l\mathbf{d}_{2}-\boldsymbol{\varepsilon})}{\sum_{n,l}\mathrm{f}(n\mathbf{d}_{1}+l\mathbf{d}_{2}-\boldsymbol{\varepsilon})}, (7)

where we use Eq. (5) and the difference of 𝐫g\mathbf{r}_{g} (the COG position) with respect to the exact position 𝜺\boldsymbol{\varepsilon} is isolated. This vectorial notation seems to mix rows of detectors (index nn) and columns (index ll) in the equations for 𝐫g\mathbf{r}_{g}. The two vectors 𝐝1\mathbf{d}_{1} and 𝐝2\mathbf{d}_{2} are parallel respectively to the xx and yy axes, and their orthogonality eliminates the mixture. In the following, the nonorthogonal lattices will explicitly require such mixture.

The modifications of Eq. (7) to deal with a subset of detectors are straightforward. The sum on nn and ll must cover only the detectors considered. More developments are required to highlight the dependence on the system parameters, i.e., detector efficiency and shape and signal distribution and position.

Let us prove further properties of Eqs. (6). In [1], we studied a general efficiency function g(x)(x) that could be different from zero even for values of xx outside the space of a single detector (crosstalk). We called uniform crosstalk the efficiency functions g(x)(x) having almost everywhere (a. e.) the property Σn\Sigma_{n}g(nτx)=1(n\tau-x)=1. The definition is extended for a two-dimensional system (here and in the following g(𝐱)(\mathbf{x}) is normalized as a detector of unitary efficiency and area τ1τ2\tau_{1}\tau_{2}) :

n,lg(n𝐝1+l𝐝2𝐱)=1(a.e.).\sum_{n,l}\mathrm{g}(n\mathbf{d}_{1}+l\mathbf{d}_{2}-\mathbf{x})=1\ \ \ \ \mathit{(a.e.).} (8)

The condition of validity for Eq. (8) a. e. means that in a null set (for example, at the detector boundaries) violations are allowed. These violations have no effect on Eq. (6) due to the convolution operation on the function g(𝐱)(\mathbf{x}) that eliminates all them. The notation of Eq. (8) generalizes the intuition of an infinite array of identical detectors each with unitary efficiency packed without holes and area τ1τ2\tau_{1}\tau_{2}. Evidently, Eq. (8) deals with more complex configurations than this naive intuition: It automatically contains the crosstalk that distributes part of the signal collected by a detector to nearby ones. It is easy to prove the normalization conservation in the presence of uniform crosstalk:

n,lf(n𝐝1+l𝐝2𝜺)=2[n,lg(n𝐝1+l𝐝2𝜺𝐱)]φ(𝐱)d𝐱,\sum_{n,l}\mathrm{f}(n\mathbf{d}_{1}+l\mathbf{d}_{2}-\boldsymbol{\varepsilon})=\int_{\mathbb{R}^{2}}\big{[}\sum_{n,l}\mathrm{g}(n\mathbf{d}_{1}+l\mathbf{d}_{2}-\boldsymbol{\varepsilon}-\mathbf{x}^{\prime})\big{]}\varphi(\mathbf{x}^{\prime})\,\mathrm{d}\mathbf{x}^{\prime}\ ,

and, applying Eq. (8) in parentheses, the right-hand side becomes the normalization of φ(𝐱)\varphi(\mathbf{x}). The condition for the absence of discretization error in 𝐫g\mathbf{r}_{g} can be extracted similarly from Eq. (7):

𝐫g=𝜺+n,l(n𝐝1+l𝐝2𝜺)f(n𝐝1+l𝐝2𝜺)\displaystyle\mathbf{r}_{g}=\boldsymbol{\varepsilon+}\sum_{n,l}(n\mathbf{d}_{1}+l\mathbf{d}_{2}-\boldsymbol{\varepsilon})\mathrm{f}(n\mathbf{d}_{1}+l\mathbf{d}_{2}-\boldsymbol{\varepsilon})
𝐫g=𝜺+2[n,l(n𝐝1+l𝐝2𝜺𝐱)g(n𝐝1+l𝐝2𝜺𝐱)]φ(𝐱)d𝐱.\displaystyle\mathbf{r}_{g}=\boldsymbol{\varepsilon}+\int_{\mathbb{R}^{2}}\big{[}\sum_{n,l}(n\mathbf{d}_{1}+l\mathbf{d}_{2}-\boldsymbol{\varepsilon}-\mathbf{x}^{\prime})\ \mathrm{g}(n\mathbf{d}_{1}+l\mathbf{d}_{2}-\boldsymbol{\varepsilon}-\mathbf{x}^{\prime})\big{]}\varphi(\mathbf{x}^{\prime})\,\mathrm{d}\mathbf{x}^{\prime}\ .

The 𝐱-\mathbf{x}^{\prime} term introduced in the parentheses gives no contribution to the integral due to Eqs. (8,1). Therefore, the condition for the absence of discretization error in 𝐫g\mathbf{r}_{g} for any signal distribution is given by:

n,l(n𝐝1+l𝐝2𝐱)g(n𝐝1+l𝐝2𝐱)=0(a.e.).\sum_{n,l}(n\mathbf{d}_{1}+l\mathbf{d}_{2}-\mathbf{x})\ \mathrm{g}(n\mathbf{d}_{1}+l\mathbf{d}_{2}-\mathbf{x})=0\ \ \ \mathit{(a.e.)}\ . (9)

In the following, we will show how to construct g-functions with the property of Eq. (9).

3.3 Sampling on a Parallelogram Lattice

To handle more complex, albeit periodic, detector arrays, we have to abandon the simple symmetry of the rectangular array of sampling points and move

Refer to caption
Figure 2: Array of parallelogram detectors: τ1\tau_{1} is the xx-distance of the centers of two neighboring detectors, τ2\tau_{2} is the yy-distance, θ\theta is the bending angle of the inclined sides.

on to a more general set of samples organized as an array of parallelograms (anomalous torus), as given in Fig. 2. On xx, the family of sampling points is given by horizontal straight-lines; on yy, the family of sampling points is given by the straight-lines at an angle ϑ\vartheta with the horizontal. Our reference system is oriented to have this setup; if rotations are present, these are charged to the signal distributions. As above, τ1\tau_{1} is the distance of the two consecutive detector centers in direction xx, and τ2\tau_{2} is the distance of two consecutive detector centers in direction yy, α=tan(θ)\alpha=\tan(\theta) is the angular coefficient of the inclined lines. At first glance, this array of sampling points suggests parallelogram detector forms, where the rectangular array is given by α\alpha\rightarrow\infty. In reality, many detector forms are allowed, and the arrays of hexagonal and triangular detectors can be sampled as in Fig. 2. This type of symmetry is connected to the periodic plane tessellation.

We will not even attempt to list all the detector arrays which are covered by a sampling along the vertices of a parallelogram. For example, all plane tessellation images by Escher [4] are created by pictures that can be sampled along two families of parallel straight lines, whereas the Penrose tiles [5] are not. Fortunately, no use of these forms is forecast in real detectors. Theoretically, the equations we are developing can handle the exotic forms of Ref. [4] and a subset of the Penrose tiles.

Neglecting the detector form complications on sampling schema, the linear effect of a single detector on φ(𝐱)\varphi(\mathbf{x}) is always contained in Eq. (3). The sampled version of Eq. (3) has a few differences. Formally, the sampling is generated by multiplying continuous functions with sums of Dirac δ\delta-functions that record the sampling points [6]. In a periodic array, the α\alpha value is not univocally defined. We can define α\alpha with any detector in the upper line (Fig. 2), then αρ1=α01+ρτ1/τ2\alpha_{\rho}^{-1}=\alpha_{0}^{-1}+\rho\tau_{1}/\tau_{2} where ρ\rho\in\mathbb{Z}, and α01\alpha_{0}^{-1} is the minimum of the positive values of αρ1\alpha_{\rho}^{-1} . Any other αρ\alpha_{\rho} simply relabels the detectors. To avoid ambiguities, we will always use α=α0\alpha=\alpha_{0}. Now the lattice constants are 𝐧1=(τ1, 0)\mathbf{n}_{1}=(\tau_{1},\ 0) and 𝐧2=(τ2/α,τ2)\mathbf{n}_{2}=(\tau_{2}/\alpha,\ \tau_{2}). The vector 𝐧2\mathbf{n}_{2} is no longer parallel to the yy-axis and introduces a mixture of nn and ll sums. The vectorial notation hides this difference with respect to the orthogonal sampling, but it is fundamental in the applications.

If s(𝐱)𝜺{}_{\boldsymbol{\varepsilon}}(\mathbf{x}) is the result of the sampling operating on f(𝐱)𝜺{}_{\boldsymbol{\varepsilon}}(\mathbf{x}), it can be expressed as:

s𝜺(𝐱)=n,lδ(𝐱n𝐧1l𝐧2)f(n𝐧1+l𝐧2𝜺),\mathrm{s}_{\boldsymbol{\varepsilon}}(\mathbf{x})=\sum_{n,l}\delta(\mathbf{x}-n\mathbf{n}_{1}-l\mathbf{n}_{2})\ \mathrm{f}(n\mathbf{n}_{1}+l\mathbf{n}_{2}-\boldsymbol{\varepsilon}), (10)

its Fourier Transform (FT) is defined as usual (𝝎=(ωx,ωy)\boldsymbol{\omega}=(\omega_{x},\ \omega_{y})):

S𝜺(𝝎)=2ei𝝎𝐱s𝜺(𝐱)d𝐱\mathrm{S}_{\boldsymbol{\varepsilon}}(\boldsymbol{\omega})=\int_{\mathbb{R}^{2}}\mathrm{e}^{-i{\boldsymbol{\omega}}\cdot\mathbf{x}}\mathrm{s}_{\boldsymbol{\varepsilon}}(\mathbf{x})\ \mathrm{d}\mathbf{x}

or, using Eq. (10), S𝜺(𝝎)\mathrm{S}_{\boldsymbol{\varepsilon}}(\boldsymbol{\omega}) becomes:

S𝜺(𝝎)=n,lei𝝎(n𝐧1+l𝐧2)f(n𝐧1+l𝐧2𝜺).\mathrm{S}_{\boldsymbol{\varepsilon}}(\boldsymbol{\omega})=\sum_{n,l}\mathrm{e}^{-i\boldsymbol{\omega}\cdot(n\mathbf{n}_{1}+l\mathbf{n}_{2})}\>\mathrm{f}\,(n\mathbf{n}_{1}+l\mathbf{n}_{2}-\boldsymbol{\varepsilon}). (11)

Now 𝐫g\mathbf{r}_{g} can be defined through S𝜺(𝝎)\mathrm{S}_{\boldsymbol{\varepsilon}}(\boldsymbol{\omega}) with:

𝐫g=iS𝜺(0)𝝎S𝜺(𝝎)|𝝎0.\mathbf{r}_{g}=\frac{i}{\mathrm{S}_{\boldsymbol{\varepsilon}}(0)}\boldsymbol{\nabla}_{\boldsymbol{\omega}}\,\mathrm{S}_{\boldsymbol{\varepsilon}}(\boldsymbol{\omega})\Big{|}_{\boldsymbol{\omega}\rightarrow 0}\ . (12)

If the normalization of φ(𝐱)\varphi(\mathbf{x}) is conserved (i.e., all the energy released in a calorimeter is collected), S𝜺(0)\mathrm{S}_{\boldsymbol{\varepsilon}}(0) is equal to one, and Eq. (11) yields:

S𝜺(0)=n,lf(n𝐧1+l𝐧2𝜺)=1𝜺.\mathrm{S}_{\boldsymbol{\varepsilon}}(0)=\sum_{n,l}\mathrm{f}(n\mathbf{n}_{1}+l\mathbf{n}_{2}-\boldsymbol{\varepsilon})=1\ \ \ \ \forall\,\boldsymbol{\varepsilon}\,. (13)

Equation (13) is an evident generalization of a similar equation for the rectangular array. The application of Eq. (12) to the form (11) of S𝜺(𝝎)\mathrm{S}_{\boldsymbol{\varepsilon}}(\boldsymbol{\omega}) gives a trivial generalization of the COG expressions for this kind of detector array, but does not produce any further results. On the contrary, going through the FT of f(𝐱)(\mathbf{x}) and summing over the infinite set of sampling points, more workable expressions can be obtained. The unusual form of the sampling steps requires that we give a few details of the derivation temporarily without vectorial notation. With its FT, f(nτ1+lτ2αε1,lτ2ε2)(n\tau_{1}+\frac{l\tau_{2}}{\alpha}-\varepsilon_{1},l\tau_{2}-\varepsilon_{2}) can be expressed by:

f(nτ1+lτ2αε1,lτ2ε2)=2dωx2πdωy2πeiωx(nτ1+lτ2αε1)eiωy(lτ2ε2)F(ωx,ωy),\mathrm{f}(n\tau_{1}+\frac{l\tau_{2}}{\alpha}-\varepsilon_{1},l\tau_{2}-\varepsilon_{2})=\int_{\mathbb{R}^{2}}\frac{\mathrm{d}\omega_{x}}{2\pi}\frac{\mathrm{d}\omega_{y}}{2\pi}\,\mathrm{e}^{i\omega_{x}(n\tau_{1}+\frac{l\tau_{2}}{\alpha}-\varepsilon_{1})}\,\mathrm{e}^{i\omega_{y}(l\tau_{2}-\varepsilon_{2})}\,\mathrm{F}(\omega_{x},\omega_{y})\,{,}

where F(ωx,ωy)(\omega_{x},\omega_{y}) is the FT of f(x,y)(x,y). Substituting this expression in (11), and performing the sums over the indices nn and ll with the following formal relation:

k=+ei(ωω)kτ=2πτm=+δ(ωω2πτm)\sum_{k=-\infty}^{+\infty}\mathrm{e}^{-i(\omega-\omega^{\prime})k\tau}=\frac{2\pi}{\tau}\sum_{m=-\infty}^{+\infty}\delta(\omega-\omega^{\prime}-\frac{2\pi}{\tau}m)

we obtain a special type of Poisson identity [6] adapted to this unusual sampling scheme:

Sε1,ε2(ωx,ωy)=\displaystyle\mathrm{S}_{\varepsilon_{1},\varepsilon_{2}}(\omega_{x},\omega_{y})= 1τ1τ2m,k=+ei(ωx2mπτ1)ε1ei(ωy+2mπτ1α2kπτ2)ε2\displaystyle\frac{1}{\tau_{1}\tau_{2}}\sum_{m,k=-\infty}^{+\infty}\mathrm{e}^{-i(\omega_{x}-\frac{2m\pi}{\tau_{1}})\varepsilon_{1}}\,\mathrm{e}^{-i(\omega_{y}+\frac{2m\pi}{\tau_{1}\alpha}-\frac{2k\pi}{\tau_{2}})\varepsilon_{2}} (14)
F(ωx2mπτ1,ωy+2mπτ1α2kπτ2),\displaystyle\mathrm{F}(\omega_{x}-\frac{2m\pi}{\tau_{1}},\omega_{y}+\frac{2m\pi}{\tau_{1}\alpha}-\frac{2k\pi}{\tau_{2}}),
S𝜺(𝝎)=\displaystyle\mathrm{S}_{\boldsymbol{\varepsilon}}(\boldsymbol{\omega})= 1τ1τ2m,kei(𝝎m𝐫1k𝐫2)𝜺F(𝝎m𝐫1k𝐫2),\displaystyle\frac{1}{\tau_{1}\tau_{2}}\sum_{m,k}\mathrm{e}^{-i(\boldsymbol{\omega}-m\mathbf{r}_{1}-k\mathbf{r}_{2})\cdot\boldsymbol{\varepsilon}}\,\mathrm{F}(\boldsymbol{\omega}-m\mathbf{r}_{1}-k\mathbf{r}_{2}),
𝐫1=\displaystyle\mathbf{r}_{1}= (2πτ1;2πατ1)\displaystyle\big{(}\frac{2\pi}{\tau_{1}}\,;\,-\frac{2\pi}{\alpha\tau_{1}}\big{)}
𝐫2=\displaystyle\mathbf{r}_{2}= (0;2πτ2)\displaystyle\big{(}0\ ;\,\frac{2\pi}{\tau_{2}}\big{)}

where 𝐫1\mathbf{r}_{1} and 𝐫2\mathbf{r}_{2} are the constants of the reciprocal lattice. The vectors 𝐫1\mathbf{r}_{1} and 𝐫2\mathbf{r}_{2}, like 𝐧1\mathbf{n}_{1} and 𝐧2\mathbf{n}_{2}, are no longer parallel to the orthogonal ωx\omega_{x}, ωy\omega_{y}-axis, and this introduces a mixture of mm and kk sums in the ωy\omega_{y} functional dependence. For the convolution theorem, F(𝝎)(\boldsymbol{\omega}) is given by:

F(𝝎)=G(𝝎)Φ(𝝎),\mathrm{F}(\boldsymbol{\omega})=\mathrm{G}(\boldsymbol{\omega})\,\Phi(\boldsymbol{\omega}), (15)

where G(𝝎)(\boldsymbol{\omega}) is the FT of g(𝐱)(\mathbf{x}) and Φ(𝝎)\Phi(\boldsymbol{\omega}) is the FT of φ(𝐱)\varphi(\mathbf{x}). Thus, S(𝝎)𝜺{}_{\boldsymbol{\varepsilon}}(\boldsymbol{\omega}) can be split into three parts: One is dependent on the position of the signal distribution COG , one is dependent on detector form, and one is dependent on the signal distribution. Many analytical results can be deduced by this form. Let us examine the consequences of Eq. (14) on the normalization conservation:

S𝜺(0)=\displaystyle\mathrm{S}_{\boldsymbol{\varepsilon}}(0)= 1τ1τ2m,kei(m𝐫1+k𝐫2)𝜺G(m𝐫1k𝐫2)Φ(m𝐫1k𝐫2)\displaystyle\frac{1}{\tau_{1}\tau_{2}}\sum_{m,k}\mathrm{e}^{i(m\mathbf{r}_{1}+k\mathbf{r}_{2})\cdot\boldsymbol{\varepsilon}}\mathrm{G}(-m\mathbf{r}_{1}-k\mathbf{r}_{2})\,\Phi(-m\mathbf{r}_{1}-k\mathbf{r}_{2}) (16)
S𝜺(0)=\displaystyle\mathrm{S}_{\boldsymbol{\varepsilon}}(0)= 1𝜺(Φ(0)=1).\displaystyle 1\ \ \ \forall\,\boldsymbol{\varepsilon}\ \ \ (\Phi(0)=1).

Due to the linear independence of the exponential function in 𝜺\boldsymbol{\varepsilon} and the arbitrariness of Φ(𝝎)\Phi(\boldsymbol{\omega}), the only solution of Eq. (16) is:

G(m𝐫1k𝐫2)=τ1τ2δm,0δk,0.\mathrm{G}(-m\mathbf{r}_{1}-k\mathbf{r}_{2})=\tau_{1}\tau_{2}\,\delta_{m,0}\,\delta_{k,0}\ . (17)

This property introduces a drastic simplification in the derivation of 𝐫g\mathbf{r}_{g}; in fact, nonzero results are obtained by deriving the exponential and G(𝝎)(\boldsymbol{\omega}). The partial derivatives of Φ(𝝎)\Phi(\boldsymbol{\omega}) disappear due to Eq. (17) which suppresses those calculated outside the origin (𝝎=0)(\boldsymbol{\omega}=0). In the origin, the first partial derivatives of Φ(𝝎)\Phi(\boldsymbol{\omega}) are zero for Eq. (1). Hence, 𝐫g\mathbf{r}_{g} becomes:

𝐫g=𝜺+iτ1τ2m,kei(m𝐫1+k𝐫2)𝜺𝐆𝝎(m𝐫1k𝐫2)Φ(m𝐫1k𝐫2),\mathbf{r}_{g}=\boldsymbol{\varepsilon}+\frac{i}{\tau_{1}\tau_{2}}\sum_{m,k}\mathrm{e}^{i(m\mathbf{r}_{1}+k\mathbf{r}_{2})\cdot\boldsymbol{\varepsilon}}\,\mathrm{\mathbf{G}}_{\boldsymbol{\omega}}(-m\mathbf{r}_{1}-k\mathbf{r}_{2})\,\Phi(-m\mathbf{r}_{1}-k\mathbf{r}_{2}), (18)

where 𝐆𝝎(𝐚)=(\mathrm{\mathbf{G}}_{\boldsymbol{\omega}}(\mathbf{a})=(G(𝐚)x{}_{x}(\mathbf{a})\,; G(𝐚)y){}_{y}(\mathbf{a})) is the vector of the partial derivatives of G(𝝎+𝐚)(\boldsymbol{\omega}+\mathbf{a}) with respect to ωx\omega_{x} and ωy\omega_{y} and taking the limits 𝝎0\boldsymbol{\omega}\rightarrow 0. Equation (18) expresses the functional dependence of the COG on its parameters and the difference with respect to the true position. Even if it looks complex, its use is quite simple. Once the forms of the elementary detector—happily few—have been defined and calculated for all their FTs and partial derivatives, one can easily introduce various types of signal distributions limited only by the complexity of their expressions. In  [1], we showed a method to calculate the FT of very complex signal distributions such as those generated by an em-shower propagating in a homogeneous medium.

From Eq. (18), we can calculate the average square error of the COG; the 𝜺\boldsymbol{\varepsilon}-integration of the exponential function on the detector g(𝐱)(\mathbf{x}) has the same result as an integration of (xgε1)2(x_{g}-\varepsilon_{1})^{2} on a rectangle of size τ1\tau_{1} and τ2\tau_{2}. Thanks to Eq. (17), the 𝜺\boldsymbol{\varepsilon}-integration can be transformed in the FT of g(𝐱)(\mathbf{x}) calculated at 𝝎\boldsymbol{\omega}-values that are differences of the exponents of Eq. (18). In this case, Eq. (17) implements the orthogonality among exponential functions on a finite domain g(𝐱)(\mathbf{x}). Writing the integral of (xgε1)2(x_{g}-\varepsilon_{1})^{2} over a detector with the function g(𝐱)(\mathbf{x}), we obtain the Parseval identity:

2d𝜺τ1τ2g(𝜺)(xgε1)2=1(τ1τ2)2m,k|Gx(m𝐫1k𝐫2)|2|Φ(m𝐫1k𝐫2)|2,\int_{\mathbb{R}^{2}}\frac{\mathrm{d}\boldsymbol{\varepsilon}}{\tau_{1}\tau_{2}}\mathrm{g}(\boldsymbol{\varepsilon})(x_{g}-\varepsilon_{1})^{2}=\frac{1}{(\tau_{1}\tau_{2})^{2}}\sum_{m,k}\big{|}\mathrm{G}_{x}(-m\mathbf{r}_{1}-k\mathbf{r}_{2})\Big{|}^{2}\,\Big{|}\Phi(-m\mathbf{r}_{1}-k\mathbf{r}_{2})\Big{|}^{2}, (19)

and identically for (ygε2)2(y_{g}-\varepsilon_{2})^{2} where the only difference is a change of Gx with Gy. These results, which can be obtained from our general definitions, will be applied in selected cases of parallelograms, hexagons, and triangles.

4 Parallelograms, Hexagons, Triangles

4.1 Parallelograms

Let us consider parallelogram detectors of the dimensions and with the bending in Fig. 2. We assume that no crosstalk exists among neighboring detectors, that there are no dead spaces inbetween, and that their efficiency is constant everywhere. Then, G(ωx,ωy)p{}^{p}(\omega_{x},\omega_{y}) is given by the integral of the spatial shape g(x,y)p{}^{p}(x,y) that can be expressed with the interval function Π(x)\Pi(x) (Π(x)=1\Pi(x)=1 for |x|<1/2|x|<1/2 and Π(x)=0\Pi(x)=0 for |x|1/2|x|\geq 1/2). This gives g(x,y)p=Π(y/τ2)Π[(xy/α)/τ1]{}^{p}(x,y)=\Pi(y/\tau_{2})\Pi[(x-y/\alpha)/\tau_{1}], and its FT is expressed by:

Gp(ωx,ωy)=τ1τ2sinc(ωxτ12)sinc((ωy+ωxα)τ22)\displaystyle\mathrm{G}^{p}(\omega_{x},\omega_{y})=\tau_{1}\tau_{2}\,\mathrm{sinc}(\frac{\omega_{x}\tau_{1}}{2})\,\mathrm{sinc}\big{(}(\omega_{y}+\frac{\omega_{x}}{\alpha})\frac{\tau_{2}}{2}\big{)}
sinc(x)=sin(x)x.\displaystyle\mathrm{sinc}(x)=\frac{\sin(x)}{x}\ .

G(ωx,ωy)p{}^{p}(\omega_{x},\omega_{y}) saves the normalization, the system has no energy loss, and Eq. (17) is easily verified:

Gp(m𝐫1k𝐫2)=Gp(2mπτ1;2mπτ1α2kπτ2)=τ1τ2δm,0δk,0.\mathrm{G}^{p}(-m\mathbf{r}_{1}-k\mathbf{r}_{2})=\mathrm{G}^{p}(-\frac{2m\pi}{\tau_{1}};\frac{2m\pi}{\tau_{1}\alpha}-\frac{2k\pi}{\tau_{2}})=\tau_{1}\tau_{2}\,\delta_{m,0}\,\delta_{k,0}\ .

The calculation of G(m𝐫1k𝐫2)x,yp{}^{p}_{x,y}(-m\mathbf{r}_{1}-k\mathbf{r}_{2}) is similarly straightforward and almost always gives zero except in the following cases:

Gxp(m𝐫1k𝐫2)=τ1τ22π[τ1(1)mmδk,0+τ2(1)kαkδm,0]mk,\displaystyle\mathrm{G}^{p}_{x}(-m\mathbf{r}_{1}-k\mathbf{r}_{2})=-\frac{\tau_{1}\tau_{2}}{2\pi}\big{[}\frac{\tau_{1}(-1)^{m}}{m}\delta_{k,0}+\frac{\tau_{2}(-1)^{k}}{\alpha k}\delta_{m,0}\big{]}\ \ \ m\neq k,
Gyp(m𝐫1k𝐫2)=τ1τ222π(1)kkδm,0k0.\displaystyle\mathrm{G}^{p}_{y}(-m\mathbf{r}_{1}-k\mathbf{r}_{2})=-\frac{\tau_{1}{\tau_{2}}^{2}}{2\pi}\frac{(-1)^{k}}{k}\delta_{m,0}\ \ \ k\neq 0.

xgx_{g} and ygy_{g} are given by:

xg=ε1\displaystyle x_{g}=\varepsilon_{1} +τ1πm=1+(1)mmImag[ei2mπτ1(ε1ε2α)Φ(m𝐫1)]\displaystyle+\frac{\tau_{1}}{\pi}\sum_{m=1}^{+\infty}\frac{(-1)^{m}}{m}\mathrm{Imag}\big{[}\mathrm{e}^{i\frac{2m\pi}{\tau_{1}}(\varepsilon_{1}-\frac{\varepsilon_{2}}{\alpha})}\Phi(-m\mathbf{r}_{1})\big{]} (20)
+(ygε2)α\displaystyle+\frac{(y_{g}-\varepsilon_{2})}{\alpha}
yg=ε2\displaystyle y_{g}=\varepsilon_{2} +τ2πk=1+(1)kkImag[ei2kπτ2ε2Φ(k𝐫2)]\displaystyle+\frac{\tau_{2}}{\pi}\sum_{k=1}^{+\infty}\frac{(-1)^{k}}{k}\mathrm{Imag}\big{[}\mathrm{e}^{i\frac{2k\pi}{\tau_{2}}\varepsilon_{2}}\Phi(-k\mathbf{r}_{2})\big{]} (21)

where only the reality of φ(𝐱)\varphi(\mathbf{x}) is used. As symmetric φ(𝐱)\varphi(\mathbf{x}) has a real and symmetric Φ(𝝎)\Phi(\boldsymbol{\omega}), the imaginary part in Eqs. (20,21) is limited to the exponentials, and gives the sinussinus function of the respective argument.

The effect of the parallelogram bending is evident in Eqs. (20,21); the xgx_{g} systematic-error contains the

Refer to caption
Refer to caption
Figure 3: Map of the discretization error xgε1x_{g}-\varepsilon_{1} (left) and ygε2y_{g}-\varepsilon_{2} (right) for an array of parallelogram detectors with τ1=τ2=1\tau_{1}=\tau_{2}=1 and α=2\alpha=2. The signal distribution is a disk with radius R=1.5τR=1.5\tau.
Refer to caption
Figure 4: Average square errors of the array in Fig. 3 for a set of signal distributions with radius RR, normalized to the square errors of a Dirac δ\delta-distribution. The dashed line is the Δxg\Delta_{x_{g}} for rectangles, the dotted lines is Δyg\Delta_{y_{g}}. The solid line is Δxg\Delta_{x_{g}} for disks, the dashed-dotted line is Δyg\Delta_{y_{g}}. The thick lines are the errors for conic-like form given by the convolution of two disks.

yg/αy_{g}/\alpha and ε2/α\varepsilon_{2}/\alpha dependence, thus, when α\alpha\rightarrow\infty, the two COG errors decouple and xgx_{g} has no dependence on ε2\varepsilon_{2}. Hence, it becomes identical to that calculated in [1]. In all the other cases, mixed dependence on ε1\varepsilon_{1} and ε2\varepsilon_{2} is to be expected. Applying Eq. (19) with g(𝜺)p{}^{p}(\boldsymbol{\varepsilon}) in place of g(𝜺)(\boldsymbol{\varepsilon}), we find the average square errors:

Δx2=\displaystyle\Delta_{x}^{2}= (τ122π2)m=1+1m2|Φ(m𝐫1)|2+Δy2α2\displaystyle\big{(}\frac{\tau_{1}^{2}}{2\pi^{2}}\big{)}\ \sum_{m=1}^{+\infty}\frac{1}{m^{2}}\big{|}\Phi(-m\mathbf{r}_{1})\big{|}^{2}+\frac{\Delta_{y}^{2}}{\alpha^{2}} (22)
Δy2=\displaystyle\Delta_{y}^{2}= (τ222π2)k=1+1k2|Φ(k𝐫2)|2.\displaystyle\big{(}\frac{\tau_{2}^{2}}{2\pi^{2}}\big{)}\ \sum_{k=1}^{+\infty}\frac{1}{k^{2}}\big{|}\Phi(-k\mathbf{r}_{2})\big{|}^{2}. (23)

Figure 3 illustrates the two-dimensional map of the discretization errors of xgx_{g} and ygy_{g} of Eqs. (20,21) for a disk-shape signal distribution of radius R=1.5τR=1.5\,\tau. Here we can appreciate the differences of xgx_{g} and ygy_{g}: (xgε1)(x_{g}-\varepsilon_{1}) shows a simultaneous dependence on ε1\varepsilon_{1} and ε2\varepsilon_{2}, and (ygε2)(y_{g}-\varepsilon_{2}) does not depend on ε1\varepsilon_{1}. This is typical of all the parallelogram detectors.

Figure 4 plots the average errors in Eqs. (22,23) with RR increasing from zero to 3τ3\tau for various forms of signal distributions. The errors are normalized to the value of the error for a Dirac δ\delta-function signal distribution (Nx2=τ12/12+Ny2/αN_{x}^{2}=\tau_{1}^{2}/12+N_{y}^{2}/\alpha and Ny2=τ22/12N_{y}^{2}=\tau_{2}^{2}/12).

The thin dashed and dotted lines refer to a square signal distribution: The zeros are given by the sinussinus functions present in the FT. The thin solid and dashed-dotted lines are the errors (on xgx_{g} and ygy_{g}) of a disk. The origin of the diffraction-like aspect of the average errors is given by the zeros of the J(ω)1{}_{1}(\omega) (Bessel function of the first kind) which eliminates the m=1m=1 or k=1k=1 terms of (22) and (23), leaving only smaller higher order terms.

The thick solid and dashed-dotted lines are the errors of a conic-like signal distribution given by the convolution of two identical disks. Its FT is the square of the FT of a disk. We can see that, above R/τ=2R/\tau=2, the COG discretization error practically disappears. This is due to the first double zeros of J(ω)21{}_{1}(\omega)^{2} whose effects tends to overlap, thereby almost completely suppressing the COG discretization error for this signal distribution. This approximate cancellation is interesting for its efficiency.

4.2 Hexagons

As stated above, the sampling along the lines of a set of parallelograms is able to handle other types of detectors as well.

Refer to caption
Figure 5: Array of hexagonal detectors, τ1\tau_{1} and τ2\tau_{2} are the x-distance and y-distance of the centers of two neighboring detectors. The angle θ\theta is the bending of the parallelogram as in Fig. 2, here tan(θ)=2τ2/τ1\tan(\theta)=2\tau_{2}/\tau_{1}. The angle γ\gamma is the inclination of the upper and lower sides of the hexagons.

Figure 5 illustrates a hexagonal array showing the parallelogram sampling strategy. An example of a detector with a mosaic of hexagons is the 61-pixels HPD of DEP [7]. We shall limit ourselves to hexagons with two sides parallel to the yy-axis. Other types such as those with two sides inclined with respect to the yy-axis would be allowed, but, since we do not know of any detector of this type, we shall ignore them.

As is evident in Fig. 5, α=tan(θ)=2τ2τ1\alpha=\tan(\theta)=\frac{2\tau_{2}}{\tau_{1}}, and only τ1\tau_{1} and τ2\tau_{2} are the free parameters defining the array; any other parameter can be reduced to them. The angle γ\gamma is formed by the inclined lata with respect to the xx-axis. It turns out that β=tan(γ)=2τ23τ1\beta=\tan(\gamma)=\frac{2\tau_{2}}{3\tau_{1}}, and now 𝐧1=(τ1; 0)\mathbf{n}_{1}=(\tau_{1}\,;\,0) and 𝐧2=(τ1/2;τ2)\mathbf{n}_{2}=(\tau_{1}/2\,;\,\tau_{2}). Regular hexagons are obtained with γ=π6\gamma=\frac{\pi}{6} so τ2τ1=32\frac{\tau_{2}}{\tau_{1}}=\frac{\sqrt{3}}{2}. To apply the equations in Section 2, we need the FT of a hexagon, which can be calculated by:

Gh(ωx;ωy)=τ12+τ12dxy1(x)y2(x)dyei(ωxx+ωyy)\mathrm{G}^{h}(\omega_{x};\omega_{y})=\int_{-\frac{\tau_{1}}{2}}^{+\frac{\tau_{1}}{2}}\mathrm{d}x\int_{\mathrm{y}_{1}(x)}^{\mathrm{y}_{2}(x)}\mathrm{d}y\,\mathrm{e}^{-i(\omega_{x}x+\omega_{y}y)}

where y(x)1{}_{1}(x) and y(x)2{}_{2}(x) are the two set of lines:

y1(x)\displaystyle\mathrm{y}_{1}(x) =βx23τ2\displaystyle=-\beta x-\frac{2}{3}\tau_{2}\ \ \ \ y1(x)=βx23τ2\displaystyle\mathrm{y}_{1}(x)=\beta x-\frac{2}{3}\tau_{2}
x<0\displaystyle\ \ \ \ \ x<0\ \ \ \ x0\displaystyle\ \ \ \ \ x\geq 0
y2(x)\displaystyle\mathrm{y}_{2}(x) =βx+23τ2\displaystyle=\ \beta x+\frac{2}{3}\tau_{2}\ \ \ \quad y2(x)=βx+23τ2.\displaystyle\mathrm{y}_{2}(x)=-\beta x+\frac{2}{3}\tau_{2}.

With some effort, G(ωx;ωy)h{}^{h}(\omega_{x};\omega_{y}) assumes the form (one among the many possible):

Gh(ωx;ωy)=τ1ωy[\displaystyle\mathrm{G}^{h}(\omega_{x};\omega_{y})=\frac{\tau_{1}}{\omega_{y}}\big{[} sin(ωxτ14+ωyτ22)sinc(ωxτ14ωyτ26)\displaystyle\sin(\frac{\omega_{x}\tau_{1}}{4}+\frac{\omega_{y}\tau_{2}}{2})\mathrm{sinc}(\frac{\omega_{x}\tau_{1}}{4}-\frac{\omega_{y}\tau_{2}}{6})-
sin(ωxτ14ωyτ22)sinc(ωxτ14+ωyτ26)].\displaystyle\sin(\frac{\omega_{x}\tau_{1}}{4}-\frac{\omega_{y}\tau_{2}}{2})\mathrm{sinc}(\frac{\omega_{x}\tau_{1}}{4}+\frac{\omega_{y}\tau_{2}}{6})\big{]}\ .

This form allows easy verification of Eq. (17):

lim𝝎0Gh(𝝎m𝐫1k𝐫2)=τ1τ2δm,0δk,0.{\underset{\begin{subarray}{c}\boldsymbol{\omega}\rightarrow 0\end{subarray}}{\mathrm{lim}}}\mathrm{G}^{h}(\boldsymbol{\omega}-m\mathbf{r}_{1}-k\mathbf{r}_{2})=\tau_{1}\tau_{2}\delta_{m,0}\ \delta_{k,0}\ .

Now, 𝐫1=(2π/τ1;π/τ2)\mathbf{r}_{1}=(2\pi/\tau_{1}\,;\,-\pi/\tau_{2}) and 𝐫2=(0; 2π/τ2)\mathbf{r}_{2}=(0\,;\,2\pi/\tau_{2}) are reintroduced, and, as expected, this hexagon array saves the normalization of φ(𝐱)\varphi(\mathbf{x}).

The calculation of Ghx{}_{x}^{h} and Ghy{}_{y}^{h} is a bit more complicated, and some help is required of mathematica [8]. An easy form which coincides with the partial derivative at m,k2m,k\in\mathbb{Z}^{2} (as is our concern) can be derived:

lim𝝎0Gxh(𝝎m𝐫1k𝐫2)\displaystyle{\underset{\begin{subarray}{c}\boldsymbol{\omega}\rightarrow 0\end{subarray}}{\mathrm{lim}}}\mathrm{G}_{x}^{h}(\boldsymbol{\omega}-m\mathbf{r}_{1}-k\mathbf{r}_{2}) =9mτ12τ2sin(2(m+k)π3)4(m2k)(2mk)(m+k)π2m2k 2mkmk\displaystyle=\frac{9m\tau_{1}^{2}\tau_{2}\sin\big{(}2(m+k)\frac{\pi}{3}\big{)}}{4(m-2k)(2m-k)(m+k)\pi^{2}}\ \ \ m\neq 2k\ \ 2m\neq k\ \ m\neq-k
=τ12τ26kπm=2k\displaystyle=-\frac{\tau_{1}^{2}\tau_{2}}{6k\pi}\ \ \ \quad m=2k
=τ12τ212mπk=2mk=m.\displaystyle=-\frac{\tau_{1}^{2}\tau_{2}}{12m\pi}\ \ \ \ k=2m\ \ \ k=-m\ .

Using a similar procedure, we can obtain a simplified form of the partial derivative of G(𝝎)h{}^{h}(\boldsymbol{\omega}) with respect to ωy\omega_{y} for m,k2m,k\in\mathbb{Z}^{2}:

lim𝝎0Gyh(𝝎m𝐫1k𝐫2)\displaystyle{\underset{\begin{subarray}{c}\boldsymbol{\omega}\rightarrow 0\end{subarray}}{\mathrm{lim}}}\mathrm{G}_{y}^{h}(\boldsymbol{\omega}-m\mathbf{r}_{1}-k\mathbf{r}_{2}) =3τ1τ22sin(2(m+k)π3)2(2mk)(m+k)π2 2mkmk\displaystyle=\frac{-3\tau_{1}\tau_{2}^{2}\sin\big{(}2(m+k)\frac{\pi}{3}\big{)}}{2(2m-k)(m+k)\pi^{2}}\ \ \ 2m\neq k\ \ m\neq-k
=τ1τ226mπk=2m\displaystyle=-\frac{\tau_{1}\tau_{2}^{2}}{6m\pi}\ \ \ \quad k=2m
=τ1τ226mπk=m\displaystyle=\ \ \frac{\tau_{1}\tau_{2}^{2}}{6m\pi}\ \ \ \quad k=-m

For k=0k=0 and m=0m=0, G(0)xh{}_{x}^{h}(0) and G(0)yh{}_{y}^{h}(0) are the hexagon COG-coordinates, and these are zero for our choice of the reference system origin.

Selecting a signal distribution, we can use Eq. (18) to calculate the COG discretization error for the hexagonal detector array. The center (𝜺)(\boldsymbol{\varepsilon}) of the signal distribution must cover a hexagon, and, due to the periodicity of the array, the error identically reproduces for all the other hexagons.

Refer to caption
Refer to caption
Figure 6: Map of the discretization error xgε1x_{g}-\varepsilon_{1} (left) and ygε2y_{g}-\varepsilon_{2} (right) for an array of hexagonal detectors with τ1=τ2=1\tau_{1}=\tau_{2}=1. The signal distribution is a disk with radius R=1.5τR=1.5\tau.

The two errors are shown in Fig. 6. They are evidently different with respect to the parallelogram array in Fig. 3. Now, the (xgε1)(x_{g}-\varepsilon_{1}) and (ygε2)(y_{g}-\varepsilon_{2}) simultaneously depend on ε1\varepsilon_{1} and ε2\varepsilon_{2}. The effect of the hexagon’s symmetric points eliminates the discretization error on the vertices and in the middle. Being less symmetric, the parallelograms have a larger discretization error.

Refer to caption
Figure 7: Average square errors of an array of hexagonal detectors (τ1=τ2=1\tau_{1}=\tau_{2}=1) for a disk signal distributions with radius RR normalized to the square error of a Dirac δ\delta-distribution on a hexagon.

The average square errors can be calculated with Eq. (19). Figure 7 illustrates the results of its application which in this case is normalized to the errors of a Dirac δ\delta-function on a hexagon (N=x25τ12/72{}_{x}^{2}=5\tau_{1}^{2}/72 and N=y25τ22/54{}_{y}^{2}=5\tau_{2}^{2}/54). The plots in Fig. 7 greatly resemble those in Fig. 4. This is due to the normalization which always initializes the plots to one. The normalization constants are smaller for the hexagon compared to the parallelogram. As in Fig. 4, the minima are given by the zeros of the J(ω)1{}_{1}(\omega), the FT of a disk. The noticeable effect of the zeros assures that the higher-order terms of the double infinite series of Eq. (19) contribute only modestly to the results. As the other types of signal distributions in Fig. 4 resemble them, they are not illustrated.

4.3 Triangles

Detectors with triangular sections are rarely used in high energy physics, an exception is the Crystal Ball [2]. The Crystal Ball calorimeter is composed of 672672 NaINaI crystals in the form of a truncated pyramid with a triangular base. Each crystal points to the center of the sphere which circumscribes the calorimeter. The crystal dimensions and the two-dimensional arrangement are chosen so that the crystals fit inside two sealed hemispherical containers.

Refer to caption
Figure 8: Array of triangular detectors: τ1\tau_{1} is the xx-distance of the COG of two neighboring detectors, τ2\tau_{2} is the yy-distance, θ\theta is the bending angle of the inclined sides. Triangles with a point in the COG are sampled together with the sampling cell indicated by the solid-line parallelogram. Triangles with asterisk in the COG are sampled together and the dashed-dotted parallelogram is their sampling cell.

The spherical geometry can be approximated by our planar distribution only on a small region.

The sampling differs greatly from the cases considered so far. First, we have to observe (Fig. 8) that two different types of triangles are involved: One with a vertex pointing toward the xx-axis (indicated in Fig. 8 by a dot in the COG) and one oriented in the opposite direction (indicated in Fig. 8 by an asterisk in the COG). Therefore, two samplings are required. The periodicity of the samplings is identical, and a parallelogram is the elementary cell. The sampling cell is shifted a fixed amount with respect to the other, and two different convolutions f(𝐱)𝜺{}_{\boldsymbol{\varepsilon}}(\mathbf{x}) are sampled. Let us call f(𝐱)1{}_{1}(\mathbf{x}) the first convolution with the triangle pointing downward and f(𝐱)2{}_{2}(\mathbf{x}) the convolution with the triangle pointing upward:

f1(𝐱)=2d𝐱g1(𝐱𝐱)φ(𝐱),\displaystyle\mathrm{f}_{1}(\mathbf{x})=\int_{\mathbb{R}^{2}}\mathrm{d}\mathbf{x}^{\prime}\,\mathrm{g}_{1}(\mathbf{x}-\mathbf{x}^{\prime})\,\varphi(\mathbf{x}^{\prime})\,, (24)
f2(𝐱)=2d𝐱g2(𝐱𝐱)φ(𝐱).\displaystyle\mathrm{f}_{2}(\mathbf{x})=\int_{\mathbb{R}^{2}}\mathrm{d}\mathbf{x}^{\prime}\,\mathrm{g}_{2}(\mathbf{x}-\mathbf{x}^{\prime})\,\varphi(\mathbf{x}^{\prime})\,.

We will only consider isosceles triangles. From Fig. 8, we can see that α=tanθ=2τ2/τ1\alpha=\tan\theta=2\tau_{2}/\tau_{1}.

Let us define the samplings. The first is generated by a set of products of Dirac δ\delta-functions centered on the points {nτ1+lτ1/2;lτ2},n,l2\{n\tau_{1}+l\tau_{1}/2;l\tau_{2}\},n,l\in\mathbb{Z}^{2}. The second is generated by a set of products of Dirac δ\delta-functions centered on the points shifted by Δ2\Delta_{2} in the yy-direction {nτ1+lτ2/α;lτ2+Δ2},n,l2\{n\tau_{1}+l\tau_{2}/\alpha;l\tau_{2}+\Delta_{2}\},n,l\in\mathbb{Z}^{2} where Δ2=23τ2\Delta_{2}=\frac{2}{3}\tau_{2} (and 𝚫2=(0;Δ2)\boldsymbol{\Delta}_{2}=(0\,;\,\Delta_{2})) is the shift of the COG of the second type of triangle from that of the first type centered in the origin (Fig. 8). With these positions, s(𝐱)𝜺{}_{\boldsymbol{\varepsilon}}(\mathbf{x}) becomes:

s𝜺(𝐱)=n,l[δ(𝐱n𝐧1l𝐧2)f1(n𝐧1+l𝐧2𝜺)+δ(𝐱n𝐧1l𝐧2𝚫2)f2(n𝐧1+l𝐧2+𝚫2𝜺)].\begin{split}\mathrm{s}_{\boldsymbol{\varepsilon}}(\mathbf{x})=\sum_{n,l}\ &\big{[}\ \delta(\mathbf{x}-n\mathbf{n}_{1}-l\mathbf{n}_{2})\,\mathrm{f}_{1}(n\mathbf{n}_{1}+l\mathbf{n}_{2}-\boldsymbol{\varepsilon})+\\ &\delta(\mathbf{x}-n\mathbf{n}_{1}-l\mathbf{n}_{2}-\boldsymbol{\Delta}_{2})\mathrm{f}_{2}(n\mathbf{n}_{1}+l\mathbf{n}_{2}+\boldsymbol{\Delta}_{2}-\boldsymbol{\varepsilon})\big{]}.\end{split} (25)

The first term accounts for the first set of samplings; the second term is the shifted sampling on the second type of triangles.

Up to now, we have paid no attention to the difference in the definition of the detector forms and the function g(𝐱)(\mathbf{x}). We considered them identical, a simplification allowed by the symmetry of the forms used (rectangles, parallelograms, and hexagons). Since the triangles are not symmetric with respect to their COGs, i.e., g(x,y)1,2{}_{1,2}(x,y)\neqg(x,y)1,2{}_{1,2}(-x,-y), we only have a symmetry with respect to the yy-axis, i.e., g(x,y)1,2={}_{1,2}(x,y)=g(x,y)1,2{}_{1,2}(-x,y)). This difference must be highlighted and isolated to avoid incorrect results. The double sampling implies phase differences which must be recovered by the phase differences of the FTs of the triangles which are no longer real. The detector form can be indicated by the function:

z=gd(xx0,yy0)z=\mathrm{g}_{d}(x-x_{0},y-y_{0}) (26)

where zz is the surface generated by gd for the downward triangle (gu for the upward). It has a constant value or it is zero and is centered in x0x_{0} and y0y_{0} where x0x_{0}, y0y_{0} are the coordinates of the detector COG. Comparing Eq. (26) with Eqs. (24) and (25), we find the differences: Eq. (24) contains g(x0x;y0y)1{}_{1}(x_{0}-x^{\prime};y_{0}-y^{\prime}) where x0x_{0} and y0y_{0} are now the coordinates of the detector COG, yielding:

g1(x0x;y0y)=gd((xx0);(yy0)).\mathrm{g}_{1}(x_{0}-x;y_{0}-y)=\mathrm{g}_{d}(-(x-x_{0});-(y-y_{0})). (27)

For symmetric detectors, this difference is irrelevant, but for triangles it represents a complete inversion. In fact, having defined g(𝐱)d{}_{d}(\mathbf{x}) as the first type of triangle, we find g(𝐱)d{}_{d}(-\mathbf{x}) as the second type. If we incorrectly take for g(𝐱)1{}_{1}(\mathbf{x}) the function g(𝐱)d{}_{d}(\mathbf{x}) in the convolution (24), the function g(𝐱)1{}_{1}(-\mathbf{x}) is actually used. This implies an exchange between the two types of triangles; Eq. (17) is no longer verified due to the overlap of the triangles and the holes left in the plane. Let us calculate the form of G(𝝎)d{}_{d}(\boldsymbol{\omega}) the FT of g(𝐱)d{}_{d}(\mathbf{x}), and S(𝝎)𝜺{}_{\boldsymbol{\varepsilon}}(\boldsymbol{\omega}) the FT of s(𝐱)𝜺{}_{\boldsymbol{\varepsilon}}(\mathbf{x}). The function g(x,y)d{}_{d}(x,y) can be expressed by the interval function Π(x)\Pi(x) as defined in Section 3.1:

gd(x,y)=Π(y+τ26τ2)Π(x2α(y+23τ2))\displaystyle\mathrm{g}_{d}(x,y)=\Pi(\frac{y+\frac{\tau_{2}}{6}}{\tau_{2}})\Pi(\frac{x}{\frac{2}{\alpha}(y+\frac{2}{3}\tau_{2})}) (28)
Gd(ωx;ωy)=23τ213τ2dy(y+23τ2)1α(y+23τ2)1αdxei(ωxx+ωyy).\displaystyle\mathrm{G}_{d}(\omega_{x};\omega_{y})=\int_{-\frac{2}{3}\tau_{2}}^{\frac{1}{3}\tau_{2}}\mathrm{d}y\int_{-(y+\frac{2}{3}\tau_{2})\frac{1}{\alpha}}^{(y+\frac{2}{3}\tau_{2})\frac{1}{\alpha}}\mathrm{d}x\mathrm{e}^{-i(\omega_{x}x+\omega_{y}y)}\ .

Among the forms of G(ωx;ωy)d{}_{d}(\omega_{x};\omega_{y}) we shall indicate:

Gd(ωx;ωy)=4τ1τ2eiωyτ23(4ωy2τ22ωx2τ12)[cos(ωxτ12)eiωyτ2+iωyτ2sinc(ωxτ12)].\begin{split}\mathrm{G}_{d}(\omega_{x};\omega_{y})=\frac{4\tau_{1}\tau_{2}\ \mathrm{e}^{-i\frac{\omega_{y}\tau_{2}}{3}}}{(4\omega_{y}^{2}\tau_{2}^{2}-\omega_{x}^{2}\tau_{1}^{2})}\big{[}\cos(\frac{\omega_{x}\tau_{1}}{2})-\mathrm{e}^{i\omega_{y}\tau_{2}}+i\omega_{y}\tau_{2}\ \mathrm{sinc}(\frac{\omega_{x}\tau_{1}}{2})\big{]}\,.\end{split} (29)

Due to the double sampling, the calculation of the FT of s(𝐱)𝜺{}_{\boldsymbol{\varepsilon}}(\mathbf{x}) becomes more complicated. With two applications of the procedure described for Eq. (14), the Poisson relation for this case can be derived as:

S𝜺(𝝎)=\displaystyle\mathrm{S}_{\boldsymbol{\varepsilon}}(\boldsymbol{\omega})= m,kei(𝝎𝐋mk)𝜺[Gd(𝝎𝐋mk)+ei(m2k)23πGd(𝝎𝐋mk)]Φ(𝝎𝐋mk)\displaystyle\sum_{m,k}\mathrm{e}^{-i(\boldsymbol{\omega}-\mathbf{L}_{m\,k})\cdot\boldsymbol{\varepsilon}}\big{[}\mathrm{G}_{d}^{*}(\boldsymbol{\omega}-\mathbf{L}_{m\,k})+\mathrm{e}^{i(m-2k)\frac{2}{3}\pi}\mathrm{G}_{d}(\boldsymbol{\omega}-\mathbf{L}_{m\,k})\big{]}\Phi(\boldsymbol{\omega}-\mathbf{L}_{m\,k})
𝐋mk=\displaystyle\mathbf{L}_{m\,k}= m𝐫1+k𝐫2=(2mπτ1;πτ2(2km))\displaystyle m\mathbf{r}_{1}+k\mathbf{r}_{2}=\big{(}\frac{2m\pi}{\tau_{1}}\,;\,\frac{\pi}{\tau_{2}}(2k-m)\big{)}

where G(𝝎)d{}_{d}^{*}(\boldsymbol{\omega}) is the complex conjugate of G(𝝎)d{}_{d}(\boldsymbol{\omega}) defined by Eq. (28) and is the FT of g(x,y)2{}_{2}(x,y) of Eq. (24) as explained above.

We can verify that G(𝐋mk)d{}_{d}(-\mathbf{L}_{m\,k}) becomes zero for integers m0m\neq 0 and k0k\neq 0; nonzero contributions are obtained when m=0m=0 and k0k\neq 0 or m0m\neq 0 and k=0k=0. These terms are cancelled out by Gd{}^{*}_{d}. The phase factor behind Gd in Eq. (LABEL:eq:FTstria) is crucial for the cancellation: Only the term with m=0m=0 and k=0k=0 survives, and Eq. (17) is verified. The sampling arrangement of Eq. (25) effectively tessellates the plane with triangular detectors.

The combination of two triangles, one pointing upward and the other downward, forms a parallelogram. This property simplifies the partial derivatives of S(𝝎)𝜺{}_{\boldsymbol{\varepsilon}}(\boldsymbol{\omega}), and the nonzero elements needed to calculate the COG are:

Gt(𝝎)=Gd(𝝎)+eiπ23(m2k)Gd(𝝎)\displaystyle\mathrm{G}^{t}(\boldsymbol{\omega})=\mathrm{G}_{d}^{*}(\boldsymbol{\omega})+\mathrm{e}^{i\pi\frac{2}{3}(m-2k)}\mathrm{G}_{d}(\boldsymbol{\omega}) (31)
lim𝝎0k=0Gxt(𝝎𝐋m 0)=\displaystyle{\underset{\begin{subarray}{c}\boldsymbol{\omega}\rightarrow 0\\ k=0\end{subarray}}{\mathrm{lim}}}\mathrm{G}_{x}^{t}(\boldsymbol{\omega}-\mathbf{L}_{m\,0})=
lim𝝎0k=mGxt(𝝎𝐋mm)=τ12τ24ei43mπmπ\displaystyle{\underset{\begin{subarray}{c}\boldsymbol{\omega}\rightarrow 0\\ k=m\end{subarray}}{\mathrm{lim}}}\mathrm{G}_{x}^{t}(\boldsymbol{\omega}-\mathbf{L}_{m\,m})=\frac{-\tau_{1}^{2}\tau_{2}}{4}\frac{\mathrm{e}^{-i\frac{4}{3}m\pi}}{m\pi}

for mm integer and m0m\neq 0. Similarly, Gty{}_{y}^{t} is:

lim𝝎0k=0Gyt(𝝎𝐋m 0)=\displaystyle{\underset{\begin{subarray}{c}\boldsymbol{\omega}\rightarrow 0\\ k=0\end{subarray}}{\mathrm{lim}}}\mathrm{G}_{y}^{t}(\boldsymbol{\omega}-\mathbf{L}_{m\,0})= (32)
lim𝝎0k=mGyt(𝝎𝐋mm)=τ1τ226ei23mπmπ\displaystyle{\underset{\begin{subarray}{c}\boldsymbol{\omega}\rightarrow 0\\ k=m\end{subarray}}{\mathrm{lim}}}\mathrm{G}_{y}^{t}(\boldsymbol{\omega}-\mathbf{L}_{m\,m})=\frac{\tau_{1}\tau_{2}^{2}}{6}\frac{\mathrm{e}^{-i\frac{2}{3}m\pi}}{m\pi}

for m0m\neq 0 and mm integer. Using Eqs. (31) and (32), we can calculate xgx_{g} and ygy_{g}, which turn out to be:

xg=\displaystyle x_{g}= ε1+τ12πm=1+1mImag{eimπ(2ε1τ143)[eimπτ2ε2Φ(𝐋m 0)+eimπτ2ε2Φ(𝐋mm)]}\displaystyle\varepsilon_{1}+\frac{\tau_{1}}{2\pi}\sum_{m=1}^{+\infty}\frac{1}{m}\mathrm{Imag}\Big{\{}\mathrm{e}^{im\pi(\frac{2\varepsilon_{1}}{\tau_{1}}-\frac{4}{3})}\big{[}\mathrm{e}^{-i\frac{m\pi}{\tau_{2}}\varepsilon_{2}}\Phi(-\mathbf{L}_{m\,0})+\mathrm{e}^{i\frac{m\pi}{\tau_{2}}\varepsilon_{2}}\Phi(-\mathbf{L}_{m\,m})\big{]}\Big{\}}
yg=\displaystyle y_{g}= ε2τ23πm=1+1mImag{eimπ(2ε1τ123)[eimπτ2ε2Φ(𝐋m 0)+eimπτ2ε2Φ(𝐋mm)]}.\displaystyle\varepsilon_{2}-\frac{\tau_{2}}{3\pi}\sum_{m=1}^{+\infty}\frac{1}{m}\mathrm{Imag}\Big{\{}\mathrm{e}^{im\pi(\frac{2\varepsilon_{1}}{\tau_{1}}-\frac{2}{3})}\big{[}\mathrm{e}^{-i\frac{m\pi}{\tau_{2}}\varepsilon_{2}}\Phi(-\mathbf{L}_{m\,0})+\mathrm{e}^{i\frac{m\pi}{\tau_{2}}\varepsilon_{2}}\Phi(-\mathbf{L}_{m\,m})\big{]}\Big{\}}.
Refer to caption
Refer to caption
Figure 9: Map of the discretization error xgε1x_{g}-\varepsilon_{1} (left) and ygε2y_{g}-\varepsilon_{2} (right) for an array of triangular detectors as in Fig. 8, but calculated on a rectangular-elementary cell. The signal distribution is again a disk with radius R=1.5τR=1.5\tau.

Although the two sums in Eq. (LABEL:eq:COGtria) look identical, they actually differ by a phase factor contained in the first exponential. For Eq. (19), this phase difference is irrelevant for the square mean errors Δx2\Delta_{x}^{2} and Δy2\Delta_{y}^{2} that become proportional, and are given by:

Δx2=τ12m=1+18m2π2[|Φ(𝐋m 0)|2+|Φ(𝐋mm)|2]\displaystyle\Delta_{x}^{2}=\tau_{1}^{2}\sum_{m=1}^{+\infty}\frac{1}{8m^{2}\pi^{2}}\Big{[}\big{|}\Phi(-\mathbf{L}_{m\,0})\big{|}^{2}+\big{|}\Phi(-\mathbf{L}_{m\,m})\big{|}^{2}\Big{]} (34)
Δy2=4τ229τ12Δx2.\displaystyle\Delta_{y}^{2}=\frac{4\tau_{2}^{2}}{9\tau_{1}^{2}}\Delta_{x}^{2}\ .
Refer to caption
Figure 10: Average square errors of an array of triangular detectors (τ1=τ2=1\tau_{1}=\tau_{2}=1) for a disk signal distribution with radius RR ranging from zero to 3τ13\tau_{1} normalized to the square error of a Dirac δ\delta-distribution.

In the plots of (xgε1)(x_{g}-\varepsilon_{1}) and of (ygε2)(y_{g}-\varepsilon_{2}) shown in Fig. 9, the elementary cell is taken as a rectangle because, in the case of axisymmetric signal distribution, a few lines parallel to the yy-axis have zero discretization error. Figure 10 shows Δx,y\Delta_{x,y}. From the second equation (34), we can see that the normalized errors Δx,y\Delta_{x,y} are now identical, the errors are always proportional, and the normalization reabsorbs the constant. Here, too, the average square error is suppressed for the disk signal distribution of special sizes, which is always produced by the zeros of the J(ω)1{}_{1}(\omega) Bessel function (FT of a disk).

5 Special Signal Distributions

5.1 Signal Distributions Free of Discretization Error

In the previous sections, we illustrated the properties of some detector arrays. Our selection only partially covers the richness of possible configurations allowed by the two-dimensional geometry as compared with the one-dimensional geometry. We encounter a similar large set of configurations for signal distributions free of discretization error.

The easiest case of band-limited functions has some additional properties. From Eq. (19), we can see that Φ(𝝎)\Phi(\boldsymbol{\omega}) has two different band-limits: Φ(ωx,ωy)=0\Phi(\omega_{x},\omega_{y})=0 for |ωx|2π/τ1|\omega_{x}|\geq 2\pi/\tau_{1} and |ωy|2π/τ2|\omega_{y}|\geq 2\pi/\tau_{2}. If the FT of φ(𝐱)\varphi(\mathbf{x}) has these limitations, Δx2\Delta_{x}^{2} and Δy2\Delta_{y}^{2} are always zero, no matter what type of detectors are considered, granted that the detector array has a periodicity controlled by parameters τ1\tau_{1} and τ2\tau_{2}. Roughly speaking, we can say that, even in two dimensions, the origin of the discretization error Δx,y\Delta_{x,y} can be connected to the aliasing effects due to the improper sampling of the function f(𝐱)𝜺{}_{\boldsymbol{\varepsilon}}(\mathbf{x}) with overly large sampling steps for the band-limits (if any) of the function φ(𝐱)\varphi(\mathbf{x}). The band boundaries which could eliminate the discretization error are twice those required by the Wittaker-Kotel’nikov-Shannon (WKS) sampling theorem [10, 6] for a complete reconstruction of the function f(𝐱)𝜺{}_{\boldsymbol{\varepsilon}}(\mathbf{x}) from their sampled values at intervals τ1\tau_{1} and τ2\tau_{2}.

As demonstrated in Ref. [6, 11], a band-limited function cannot be zero on any finite part of the plane. This property rules out these functions from the set of functions usually encountered in experimental position measurements. Here, the functions φ(𝐱)\varphi(\mathbf{x}) become zero after only a few τ1\tau_{1} or τ2\tau_{2}, and no band-limitations can be invoked or postulated. The elimination of the COG discretization error can be obtained from other sources. We can see in some of the previous figures that the discretization error disappears for special forms and special sizes.

In the one-dimensional case, the interval function and all its convolutions with normalized functions have sizes without discretization error. In two dimensions, this set is much larger. It is evident from Eq. (19) that: All the signal distributions with the property of Eq. (17) with the same {α,τ1,τ2}\{\alpha,\tau_{1},\tau_{2}\} as the detector array are free of COG-discretization error. For example, for α=2\alpha=2 we explicitly demonstrate that a hexagonal distribution has the property (17). Therefore, a hexagonal signal distribution with sizes τ1\tau_{1} and τ2\tau_{2} or any of their multiples (and all the other related parameters as described in Fig. 5) has an exact x,yx,y-COG on an array of isosceles triangles with base τ1\tau_{1} and height τ2\tau_{2} and arranged as in Fig. 8. Highly irregular shapes such as those illustrated in Ref. [4] are prototypes of signal distributions free of the COG discretization errors. We can easily prove from the previous equations that even disconnected signal distributions have an exact COG. For example, any two triangles (one pointing upward and one downward) in Fig. 8 have exact COGs on the hexagon array in Fig. 5. Each triangle has a COG error, but, paired, the errors cancel out.

Evidently, all the convolutions of arbitrary functions with functions having the property (17) continue to maintain it and are free of COG-discretization errors. A rectangular signal distribution of dimensions τ1\tau_{1} and τ2\tau_{2} (or any of their multiples) is free of discretization error for any array with the same τ1\tau_{1}, τ2\tau_{2} and any value of α\alpha. We can easily figure out the geometric origin of the property. An array of rectangles of dimensions {τ1,τ2}\{\tau_{1},\tau_{2}\}, where each line of detectors is shifted with respect to the previous line of a fixed amount σ\sigma tessellate the plane. Therefore, Eq. (17) must hold, and due to α=τ2/σ\alpha=\tau_{2}/\sigma any type of array with the values {τ1,τ2,α}\{\tau_{1},\tau_{2},\alpha\} is easily generated. Even the parallelogram and triangle arrays continue to tessellate the plane after a shift of one detector line with respect to another and when the shift is repeated in all the detector lines. In the following subsection, we will describe a few properties of arrays of shifted rectangles.

Refer to caption
Figure 11: Array of shifted rectangular detectors. τ1\tau_{1} and τ2\tau_{2} are defined as usual. σ\sigma is the shift of the detector centers of a row with respect to the detector centers of the row below them. Tan(θ)=τ2/σ(\theta)=\tau_{2}/\sigma is the bending angle of the line connecting the centers of two rectangles pertaining to two different rows.

5.2 Shifted Rectangles

To exemplify the property of an array of shifted detectors, we shall describe the easiest one, i.e., that of the array of shifted rectangles (Fig. 11). It is evident that, at the variation of the shift σ\sigma, all the values of α=tan(θ)=τ2/σ\alpha=\tan(\theta)=\tau_{2}/\sigma are explored, and Eq. (10)-(19) must be applied to the sampling. The FT of g(x,y)r{}^{r}(x,y) of a rectangle is given by:

Gr(ωx,ωy)=τ1τ2sinc(ωxτ12)sinc(ωyτ22).\mathrm{G}^{r}(\omega_{x},\omega_{y})=\tau_{1}\tau_{2}\,\mathrm{sinc}(\frac{\omega_{x}\tau_{1}}{2})\,\mathrm{sinc}\big{(}\frac{\omega_{y}\tau_{2}}{2}\big{)}.

Writing Eq. (17) for this case, we get:

Gr(m𝐫1k𝐫2)=τ1τ2sinc(mπ)sinc(2mπτ2τ1αkπ)=τ1τ2δm,0δk,0.\mathrm{G}^{r}(-m\mathbf{r}_{1}-k\mathbf{r}_{2})=\tau_{1}\tau_{2}\,\mathrm{sinc}(-m\pi)\,\mathrm{sinc}\big{(}\frac{2m\pi\tau_{2}}{\tau_{1}\alpha}-k\pi\big{)}=\tau_{1}\tau_{2}\,\delta_{m,0}\,\delta_{k,0}\ . (35)

where the first sincsinc-function eliminates any mm and α\alpha dependence in the second one. The tessellation condition is verified for any α\alpha as expected by naive intuition. Equation (35) is what we need to prove that a rectangular form of dimensions τ1\tau_{1} and τ2\tau_{2} (and all the multiples of these dimensions) is free of discretization error for any array with the same τ1\tau_{1} and τ2\tau_{2}, any α\alpha and any form of detectors which tessellate the plane. We can easily verify that the same is true for parallelograms and triangles. The hexagons cannot be shifted.

5.3 Scaled Signal Distributions

In discussing Eq. (17), we considered an array of detectors covering the plane, but among the periodic forms that satisfy Eq. (17), we have to consider their scaled forms. For the scaling property of the FT, if we define gl(𝐱)=g(𝐱/l)/l2\mathrm{g}_{l}(\mathbf{x})=\mathrm{g}(\mathbf{x}/l)/l^{2} than Gl(𝝎)=G(l𝝎)\mathrm{G}_{l}(\boldsymbol{\omega})=\mathrm{G}(l\boldsymbol{\omega}). Thus, if g(𝐱)\mathrm{g}(\mathbf{x}) satisfies Eq. (17), then gl(𝐱)\mathrm{g}_{l}(\mathbf{x}) satisfies the same equation for any positive integer ll. The normalized signal distribution φ(𝐱)=gl(𝐱)/(τ1τ2)\varphi(\mathbf{x})=\mathrm{g}_{l}(\mathbf{x})/(\tau_{1}\tau_{2}) is free of discretization error. As detectors, the functions gl(𝐱)\mathrm{g}_{l}(\mathbf{x}) have crosstalk with the neighboring detectors.

5.4 Approximate Results

Some previous figures of the average square errors report deep minima for some R-values of disk-shaped signal distribution. These minima do not reach zero values of the square error, but are always suppressions of the COG discretization error worthy of exploration. For this reason, all the plots in Eq. (19) exhibit the error for the disk signal distribution. Cell bending α\alpha has some effect on the minima positions. For parallelograms and hexagons, we can see a slight shift in the minimum for Δx\Delta_{x} and Δy\Delta_{y} and α=2\alpha=2, for larger α\alpha-values the shift tends to disappear as can be verified from Eqs. (22) and (23) for parallelograms. The FT of a disk is 4J1(Rω)/(Rω)4J_{1}(R\omega)/(R\omega), and the discretized values of ωx\omega_{x} and ωy\omega_{y} modulate the effect of the zeros of J1(ω)J_{1}(\omega) in Eq. (19), giving a shift of the minimum. The interesting aspect of this approximate result is its applicability to almost all the detector arrays as far as τ1τ2\tau_{1}\sim\tau_{2}.

6 Crosstalk and Loss

6.1 Loss

If the detectors in the array have generic (nonuniform) crosstalk or they have some losses, Eq. (16) need some modification. We must consider:

S𝜺(0)=nlf(n𝐧1+l𝐧2𝜺)1.\mathrm{S}_{\boldsymbol{\varepsilon}}(0)=\sum_{nl}\mathrm{f}(n\mathbf{n}_{1}+l\mathbf{n}_{2}-\boldsymbol{\varepsilon})\leq 1\ . (36)

The detector array does not generate a constant (over the plane) efficiency function, and in some regions the efficiency drops below one. Now S(0)𝜺{}_{\boldsymbol{\varepsilon}}(0) retains its dependence on the position and form of the signal distribution, and Eq. (17) is no longer valid. To calculate the COG, we have to use Eq. (12) with the partial derivatives of Φ(𝝎)\Phi(\boldsymbol{\omega}):

𝐫g=𝜺+iτ1τ2S𝜺(0)m,kei𝐋mk𝜺[𝐆𝝎(𝐋mk)Φ(𝐋mk)+G(𝐋mk)𝚽𝝎(𝐋mk)]\displaystyle\mathbf{r}_{g}=\boldsymbol{\varepsilon}+\frac{i}{\tau_{1}\tau_{2}\mathrm{S}_{\boldsymbol{\varepsilon}}(0)}\,\sum_{m,\,k}\mathrm{e}^{i\mathbf{L}_{m\,k}\cdot\,\boldsymbol{\varepsilon}}[\,\mathrm{\mathbf{G}}_{\boldsymbol{\omega}}(-\mathbf{L}_{m\,k})\Phi(-\mathbf{L}_{m\,k})+\mathrm{G}(-\mathbf{L}_{m\,k})\boldsymbol{\Phi}_{\boldsymbol{\omega}}(-\mathbf{L}_{m\,k})\big{]} (37)
𝐋mk=m𝐫1+k𝐫2=(2mπτ1;2mπτ1α+2kπτ2).\displaystyle\mathbf{L}_{m\,k}=m\mathbf{r}_{1}+k\mathbf{r}_{2}=\big{(}\frac{2m\pi}{\tau_{1}}\,;\,-\frac{2m\pi}{\tau_{1}\alpha}+\frac{2k\pi}{\tau_{2}}\big{)}\,.

Here, 𝚽𝝎=(Φx;Φy)\boldsymbol{\Phi}_{\boldsymbol{\omega}}=(\Phi_{x}\,;\,\Phi_{y}) is the vector of the partial derivatives with respect to ωx\omega_{x} and ωy\omega_{y} of Φ(ωx,ωy)\Phi(\omega_{x},\omega_{y}). Equation (37) allows some simplification if the signal distribution is one of the special

Refer to caption
Figure 12: Set of error curves (ε2τ2\varepsilon_{2}-\tau_{2}) for a signal distribution formed by two disks, one of small radius (0.15 τ\tau) and considerable height (4.5), and a disk with a larger radius (1.5 τ\tau) and relative height 1; the detectors are squares with a region of loss at any border for a range of 0.025τ0.025\tau.

functions discussed in Section 4. If φ(𝐱)\varphi(\mathbf{x}) is a band-limited function with Φ(ωx,ωy)=0\Phi(\omega_{x},\omega_{y})=0 for |ωx|2π/τ1|\omega_{x}|\geq 2\pi/\tau_{1} and |ωy2π/τ2|\omega_{y}\geq 2\pi/\tau_{2}, the COG discretization error disappears for any type of loss or crosstalk; in this case, S(0)𝜺{}_{\boldsymbol{\varepsilon}}(0) is always constant. If φ(𝐱)\varphi(\mathbf{x}) is one of the finite support functions which have no COG error in absence of loss (or crosstalk), S(0)𝜺{}_{\boldsymbol{\varepsilon}}(0) is constant for any g(𝐱)(\mathbf{x}), and only the terms depending on the partial derivatives of Φ(𝝎)\Phi(\boldsymbol{\omega}) remain in Eq. (37). For functions whose first partial derivatives pertain to previous class, even the last term of Eq. (37) disappears for any type of loss or crosstalk.

Figure 12 shows one of the loss effects, i.e., the introduction of a simultaneous dependence on ε1\varepsilon_{1} and ε2\varepsilon_{2} in the COG error, even for an array of detectors that in Section 2 was proved to be dependent on ε1\varepsilon_{1} or on ε2\varepsilon_{2}, but not on both.

6.2 Uniform Crosstalk

Equations (8,13) give a definition of uniform crosstalk as a property of the function g(𝐱)(\mathbf{x}):

nlg(nτ1+lτ2αx;lτ2y)=1a.e.\sum_{nl}\mathrm{g}(n\tau_{1}+\frac{l\tau_{2}}{\alpha}-x;l\tau_{2}-y)=1\ \ \ \ \mathit{a.\ e.} (38)

Let us examine the possibility of verifying or building functions g(𝐱)(\mathbf{x}) with uniform crosstalk. The crosstalk is an effect of a detector on its neighbors in the array, so the true physical form of the detectors partially loses its meaning. Theoretically, this effect can be of any type, even completely independent of the detector form. In practice, this is probably rare, so we will retain some of the detector properties. To generate uniform crosstalk which retains memory of the detector form, the rule is simple: Any convolution of detector functions g(𝐱)(\mathbf{x}) of the type considered in Section 4 with an arbitrary normalized function g(𝐱)2{}_{2}(\mathbf{x}), generates uniform crosstalk. This condition allows us to verify Eqs. (38) and (13). If g(𝐱)1{}_{1}(\mathbf{x}) is one of the functions g(𝐱)(\mathbf{x}) studied in Section 4 and its corresponding array tessellates the plane for a set of values {τ1,τ2,α}\{\tau_{1},\tau_{2},\alpha\}, then g(𝐱)1{}_{1}(\mathbf{x}) definitely satisfies Eq. (17) and likewise any of its convolutions. It is evident that g(𝐱)(\mathbf{x}), convolution of g(𝐱)1{}_{1}(\mathbf{x}) and g(𝐱)2{}_{2}(\mathbf{x}) (or more), has no constant values over the detector surface. In fact, we assumed that g(𝐱)1{}_{1}(\mathbf{x}) tessellate the plane with constant values over a detector, and this cannot be true for all its convolutions. Thus, g(𝐱)(\mathbf{x}) can spread outside the physical boundaries of the detector and thereby generate an external crosstalk. Contrary to the intuition, this crosstalk does not induce a signal loss, and can improve the position reconstruction without deteriorating the energy measurement (if we are dealing with a calorimeter). Identical properties are valid for any integer scaling of the dimensions of g(𝐱)(\mathbf{x}) and for any of its convolutions.

6.3 A Form of the WKS-theorem

Equation (38) can even be the starting point for other mathematical extrapolations along the lines described in Refs. [10, 11]. We will limit to develop a connection to the nonseparable form of the WKS-theorem in two dimensions.

A straightforward extension of the WKS-theorem to a two-dimensional problem is executed with double application to the xx and yy variables. In this way, the sampling points are arranged on an orthogonal lattice, and the orthogonal set of functions is the tensorial product of the two one-dimensional set. For construction, each function of the set has a separable dependence from xx and yy that can be non optimal for some problems. Here we have a set of equations that allow a different expression of the theorem.

To directly use the equations in the previous sections, we will work in the dual space: The functions in the 𝐱\mathbf{x}-space are range-limited (the dual form of band-limited) and the functions in the 𝝎\boldsymbol{\omega}-space will be reconstructed by sampling at the appropriate frequencies.

Owing to the definitions we gave, the functions g(𝐱)(\mathbf{x}) for the parallelograms, hexagons, and triangles tessellate the plane and possess the property:

g2(𝐱)=g(𝐱).\mathrm{g}^{2}(\mathbf{x})=\mathrm{g}(\mathbf{x}).

For the convolution theorem, this implies:

2G(𝝎𝝎)G(𝝎𝝎′′)d𝝎4π2=G(𝝎𝝎′′).\int_{\mathbb{R}^{2}}\mathrm{G}(\boldsymbol{\omega}-\boldsymbol{\omega}^{\prime})\mathrm{G}(\boldsymbol{\omega}^{\prime}-\boldsymbol{\omega}^{\prime\prime})\frac{\mathrm{d}\boldsymbol{\omega}^{\prime}}{4\pi^{2}}=\mathrm{G}(\boldsymbol{\omega}-\boldsymbol{\omega}^{\prime\prime})\,.

The reality of g(𝐱)(\mathbf{x}) gives G(𝝎)=(\boldsymbol{\omega})=G(𝝎){}^{*}(-\boldsymbol{\omega}). Substituting this in the integral and taking 𝝎=m𝐫1+l𝐫2\boldsymbol{\omega}=m\mathbf{r}_{1}+l\mathbf{r}_{2} and 𝝎′′=n𝐫1+k𝐫2\boldsymbol{\omega}^{\prime\prime}=n\mathbf{r}_{1}+k\mathbf{r}_{2} with m,n,l,k4m,n,l,k\in\mathbb{Z}^{4}, Eq (17) imposes the orthogonality of the set of functions G(𝝎)m,l=G(𝝎m𝐫1l𝐫2){}_{m,l}(\boldsymbol{\omega})=\mathrm{G}(\boldsymbol{\omega}-m\mathbf{r}_{1}-l\mathbf{r}_{2}). This is a direct consequence of Eq. (38) and the plane tessellation implemented by g(𝐱)(\mathbf{x}) (and obviously by g(𝐱)2(\mathbf{x})^{2}).

For any function φ(𝐱)\varphi(\mathbf{x}) such that φ(𝐱)g(𝐱)=φ(𝐱)\varphi(\mathbf{x})\mathrm{g}(\mathbf{x})=\varphi(\mathbf{x}) (i.e.,for functions different from zero within the boundaries of g(𝐱)(\mathbf{x})), the FT can be written:

Φ(𝝎)=m,l2Φ(m𝐫1+l𝐫2)Gm,l(𝝎)τ1τ2\displaystyle\Phi(\boldsymbol{\omega})=\sum_{m,l\in\,\mathbb{Z}^{2}}\Phi(m\mathbf{r}_{1}+l\mathbf{r}_{2})\frac{\mathrm{G}_{m,l}(\boldsymbol{\omega})}{\tau_{1}\tau_{2}}
Φ(m𝐫1+l𝐫2)=2G(𝝎m𝐫1l𝐫2)Φ(𝝎)d𝝎4π2.\displaystyle\Phi(m\mathbf{r}_{1}+l\mathbf{r}_{2})=\int_{\mathbb{R}^{2}}\mathrm{G}^{*}(\boldsymbol{\omega}^{\prime}-m\mathbf{r}_{1}-l\mathbf{r}_{2})\Phi(\boldsymbol{\omega}^{\prime})\frac{\mathrm{d}\boldsymbol{\omega}^{\prime}}{4\pi^{2}}\,.

Again, given Eq. (17) for G(𝝎)(\boldsymbol{\omega}), Φ(m𝐫1+l𝐫2)\Phi(m\mathbf{r}_{1}+l\mathbf{r}_{2}) are the samples of the function Φ(𝝎)\Phi(\boldsymbol{\omega}) at frequencies m𝐫1+l𝐫2m\mathbf{r}_{1}+l\mathbf{r}_{2}. The completeness of the set of functions {\{G(𝝎)m,l}{}_{m,l}(\boldsymbol{\omega})\} is more complicated to prove, but expressing the functions G(𝝎)m,l{}_{m,l}(\boldsymbol{\omega}) as FT of g(𝐱)(\mathbf{x}) and using two times the formal relation in Eq. (14), we can prove that:

m,l2Gm,l(𝝎)Gm,l(𝝎)=τ1τ2G(𝝎𝝎).\sum_{m,l\in\mathbb{Z}^{2}}\mathrm{G}_{m,l}^{*}(\boldsymbol{\omega}^{\prime})\mathrm{G}_{m,l}(\boldsymbol{\omega})=\tau_{1}\tau_{2}\mathrm{G}(\boldsymbol{\omega}-\boldsymbol{\omega}^{\prime})\,.

Substituting in the previous equations, the completeness is verified. The basis Gp is very similar to a double application of the one-dimensional WKS-theorem, and becomes separable for α\alpha\rightarrow\infty. The bases Gh and Gt are nonseparable in a product of two functions dependent on ωx\omega_{x} and ωy\omega_{y}, and involve functions whose FTs have support contained in a hexagon or in a pair of triangles. This approach provides a physical model for the WKS-theorem as a property of an array of constant efficiency detectors.

6.4 Crosstalk Free of the COG Discretization Error: the Ideal Detector

Uniformity is only one of the crosstalk properties. Evidently, the signal spreading almost always reduces the COG error, but some forms of crosstalk are free of the COG discretization error for any signal distribution. We saw above that it is possible to select special signal distributions free of the COG-discretization errors; however, very few choices are possible in the case of the signal distribution. The detailed physical process generating the signal is usually beyond the control of detectors. Conversely, the crosstalk can be under the control of the detector fabrication and, at least theoretically, some possibilities exist to converge toward some form of crosstalk as described. Even if no concrete example can be given, let us discuss which form of crosstalk is free of the COG discretization errors for any signal distribution in a two-dimensional geometry.

Previously, we discussed how to generate crosstalk g(𝐱)(\mathbf{x}) functions with constant efficiency over the array. With such g(𝐱)(\mathbf{x}), the signal collected by a detector affects its neighbors. From the point of view of the calculation of 𝐫g\mathbf{r}_{g}, Eq. (18) remains identical. The uniformity of g(𝐱)(\mathbf{x}) as expressed by Eq. (38), eliminates the partial derivatives of the function Φ(𝝎)\Phi(\boldsymbol{\omega}) from the COG expression. A further condition can be imposed on g(𝐱)(\mathbf{x}) to eliminate even the partial derivatives of G(𝝎)(\boldsymbol{\omega}). We supposed above that g(𝐱)(\mathbf{x}) was the convolution of functions g(𝐱)1{}_{1}(\mathbf{x}) and g(𝐱)2{}_{2}(\mathbf{x}). The first, g(𝐱)1{}_{1}(\mathbf{x}), was constrained to tessellate the plane with the same {τ1,τ2,α}\{\tau_{1},\tau_{2},\alpha\} of this array, but no condition was posed on the g(𝐱)2{}_{2}(\mathbf{x}). If g(𝐱)2{}_{2}(\mathbf{x}) is constrained to tessellate the plane with the same {τ1,τ2,α}\{\tau_{1},\tau_{2},\alpha\}, the partial derivatives G(𝝎)(\boldsymbol{\omega}) are zero for ωx2mπ/τ1\omega_{x}\rightarrow-2m\pi/\tau_{1} and ωy2π(m/τ1αk/τ2)\omega_{y}\rightarrow 2\pi(m/\tau_{1}\alpha-k/\tau_{2}): i.e.,

Gx(a,b)=G1x(a,b)G2(a,b)+G1(a,b)G2x(a,b)\displaystyle\mathrm{G}_{x}(a,b)=\mathrm{G}_{1x}(a,b)\mathrm{G}_{2}(a,b)+\mathrm{G}_{1}(a,b)\mathrm{G}_{2x}(a,b) (39)
a=2mπτ1b=2π(mτ1αkτ2)\displaystyle a=-\frac{2m\pi}{\tau_{1}}\ \ \ \ \ \ b=2\pi(\frac{m}{\tau_{1}\alpha}-\frac{k}{\tau_{2}})
G1(a,b)=G2(a,b)=0G1x(0,0)=G2x(0,0)=0,\displaystyle\mathrm{G}_{1}(a,b)=\mathrm{G}_{2}(a,b)=0\ \ \ \ \ \ \mathrm{G}_{1x}(0,0)=\mathrm{G}_{2x}(0,0)=0,

and likewise for the yy-partial derivative. It is evident that, if g(𝐱)(\mathbf{x}) is the convolution of three or more functions in addition to g1 and g2, the absence of the COG discretization error is maintained. In the two-dimensional case, the set of the simplest forms free of COG errors for any signal distribution is much larger then in one-dimension. We proved in [1] that a triangle with base 2τ2\tau for g(x)(x) was the simplest shape for eliminating the COG error. Now, for α=2\alpha=2, we can select two functions among hexagons, triangles, parallelograms, or shifted rectangles with the same {τ1,τ2}\{\tau_{1},\tau_{2}\} to cite only the G(ωx,ωy)(\omega_{x},\omega_{y}) we explicitly calculated, but many more can be invented.

Refer to caption
Refer to caption
Figure 13: Convolution of two hexagons of an array with τ1=τ2\tau_{1}=\tau_{2} (left). Convolution of two rectangles (right). The first type of crosstalk eliminates the COG discretization error for any array of detectors with τ1=τ2\tau_{1}=\tau_{2} and α=2\alpha=2; the second eliminates it even for any α\alpha.

Figure 13 shows two forms of crosstalk. We can see that the convolution of two constant height hexagonal surface generates a surface with negligible edges much resembling a cone. The base is always hexagonal. In the convolution of two constant height square surfaces, two edges are present. If the two convolved forms are both sized τ1\tau_{1}xτ2\,\tau_{2}, their convolution is 2τ12\tau_{1}x 2τ2\,2\tau_{2}. These are the smallest sizes. The convolution of any crosstalk function free of discretization error with any normalized function saves the property, but the size of the resulting function is the sum of the sizes of the two convolved functions.

With a set of steps giving Eq. (9), it can be proved that any function g(x,y)(x,y) with the following property is free of the COG discretization error for xgx_{g} and for ygy_{g}:

n,l=+(nτ1+lτ2αx)g(nτ1+lτ2αx;lτ2y)=0\displaystyle\sum_{n,l=-\infty}^{+\infty}(n\tau_{1}+\frac{l\tau_{2}}{\alpha}-x)\ \mathrm{g}(n\tau_{1}+\frac{l\tau_{2}}{\alpha}-x;l\tau_{2}-y)=0\ \ \ (a. e.)\displaystyle(\text{a.\ e.}) (40)
n,l=+(lτ2y)g(nτ1+lτ2αx;lτ2y)=0\displaystyle\sum_{n,l=-\infty}^{+\infty}(l\tau_{2}-y)\ \mathrm{g}(n\tau_{1}+\frac{l\tau_{2}}{\alpha}-x;l\tau_{2}-y)=0\ \ \ \ \ \quad\quad (a. e.).\displaystyle(\text{a.\ e.})\ .

We are unable to give an example of detectors which implement or attempt to approach this feature. In the one-dimensional case, the silicon strip detector with floating strips probably approaches a crosstalk which tends to a form free of discretization error for any signal distribution.

It is useful to discuss the criticality of condition (40) in the presence of a size (or period) mismatch. For this,

Refer to caption
Figure 14: Effects of the crosstalk on a pair of near δ\delta-like signals. The upper curves are Δxg\Delta_{x_{g}} and Δyg\Delta_{y_{g}} for a square array without crosstalk. The lower curves are given by the presence of a square crosstalk and ranges running from R/τ=0.5R/\tau=0.5 up to R/τ=1.5R/\tau=1.5. For R/τ=1R/\tau=1, the error is completely suppressed.

we construct a simulation with a narrow signal distribution and a large discretization error on an array with τ1=τ2=1\tau_{1}=\tau_{2}=1, and a crosstalk function dimensioned around the optimal value. A dramatic improvement — even for large discrepancies with respect to the exact value — can be seen in Fig. 14. The crosstalk is a square of varying dimensions. This form is probably of interest for the pixel detector of CMS [12], but it is impractical for homogeneous detectors where axisymmetric shapes are more probable. The smallest size axisymmetric crosstalk which heavily suppresses the COG discretization error is the disk of R/τ1.2R/\tau\approx 1.2 due to the first zero of J(ω)1{}_{1}(\omega) FT of a disk (in this case g(x,y)(x,y) has a range of 2.2τ2.2\tau). Even if this is not an exact suppression, it looks very efficient and almost independent of α\alpha, at least for large (or small) α\alpha values.

Another approximate suppression of the COG error is given by the conoid form of the crosstalk, which is obtained by the convolution of two disks. Here the overlap of the zeros of J(ω)21{}_{1}(\omega)^{2} almost completely suppresses the COG error beyond R/τ2R/\tau\approx 2. Axial symmetry is granted even in this case, and the insensibility to the α\alpha values is more pronounced than in the case of a disk. On the basis of these considerations, Fig. 4 can be read as the effects of various types of crosstalk on a δ\delta-like signal distribution.

7 Finite Array of Detectors

7.1 Imaging on a Pixel Detector

Up to now, we have explored an infinite periodic array of detectors, and the sampling-function periodicity was the key property in extracting explicit analytical results. With a finite set of detectors, periodicity disappears and calculation of the convolutions is unavoidable. But, as proved in Ref. [1], the solution to the problem lies in the finite range of the signal distribution φ(𝐱)\varphi(\mathbf{x}) and the limited number of detectors (22x3, 33,\ 3x3, 53,\ 5x5,5,\dots). Without losing the locality property of 𝐫g\mathbf{r}_{g}, we can use a periodic repetition of φ(𝐱)\varphi(\mathbf{x}) (indicated with φp(𝐱)\varphi^{p}(\mathbf{x})) or the periodic repetition of the set of detectors. Since the second looks more involved analytically, we will use the first approach. The periodic φp(𝐱)\varphi^{p}(\mathbf{x}) explores the set of detectors, and if the periods are sufficiently ample, the (periodic) convolution with the sensor function g(𝐱)(\mathbf{x}) coincides with the convolution of φ(𝐱)\varphi(\mathbf{x}) on a period. As in [1], the periodic function φp(𝐱)\varphi^{p}(\mathbf{x}) with periods T1T_{1} and T2T_{2} is defined as (for r,s2\,r,s\in\mathbb{Z}^{2} and with the vectors 𝐓1=(T1; 0)\mathbf{T}_{1}=(T_{1}\,;\,0), and 𝐓2=(0;T2)\mathbf{T}_{2}=(0\,;\,T_{2})):

φp(𝐱)=r,sφ(𝐱r𝐓1s𝐓2).\varphi^{p}(\mathbf{x})=\sum_{r,s}\varphi(\mathbf{x}-r\mathbf{T}_{1}-s\mathbf{T}_{2})\,.

The FT of φp(𝐱)\varphi^{p}(\mathbf{x}) (indicated with Φp(𝝎)\Phi^{p}(\boldsymbol{\omega})) has components at frequencies that are multiples of the fundamental frequencies 2π/T12\pi/T_{1} and 2π/T22\pi/T_{2} and introducing the vectors 𝐑1=(2π/T1; 0)\mathbf{R}_{1}=(2\pi/T_{1}\,;\,0) and 𝐑2=(0; 2π/T2)\mathbf{R}_{2}=(0\,;\,2\pi/T_{2}):

Φp(𝝎)=(2π)2T1T2m,kδ(𝝎m𝐑1k𝐑2)Φ(mR1;kR2),\Phi^{p}(\boldsymbol{\omega})=\frac{(2\pi)^{2}}{T_{1}T_{2}}\sum_{m,k}\delta(\boldsymbol{\omega}-m\mathbf{R}_{1}-k\mathbf{R}_{2})\,\Phi(m\,R_{1};k\,R_{2}), (41)

where the amplitudes Φ(mR1;kR2)\Phi(m\,R_{1};k\,R_{2}) are the values of the FT of φ(𝐱)\varphi(\mathbf{x}) taken at the corresponding values. We will assume that T1T_{1} and T2T_{2} are larger than the region involved in the sampling (i.e., the set of sensors are well contained in a rectangle T1T_{1}xT2T_{2}), so we can write:

fp(n𝐧1+l𝐧2𝜺)=f(n𝐧1+l𝐧2𝜺)n,lϵI0ε1,ε2ϵC1.\displaystyle\mathrm{f}^{p}(n\mathbf{n}_{1}+l\mathbf{n}_{2}-\boldsymbol{\varepsilon})=\mathrm{f}(n\mathbf{n}_{1}+l\mathbf{n}_{2}-\boldsymbol{\varepsilon})\ \ \ \text{n,l}\ \epsilon\ I_{0}\ \ \ \varepsilon_{1},\varepsilon_{2}\ \epsilon\ C_{1}\,.
fp(𝐱)=m,kei(m𝐑1+k𝐑2)𝐱G(mR1;kR2)Φ(mR1;kR2)1T1T2.\displaystyle\mathrm{f}^{p}(\mathbf{x})=\sum_{m,k}\mathrm{e}^{i(m\,\mathbf{R}_{1}+k\,\mathbf{R}_{2})\cdot\,\mathbf{x}}\mathrm{G}(mR_{1}\,;\,kR_{2})\Phi(mR_{1}\,;kR_{2})\frac{1}{T_{1}T_{2}}\,.

Now, the set I0I_{0} of the detector indexes nn and ll is some subset of integers and 𝜺\boldsymbol{\varepsilon} covers a detector. We define a function s(𝐱)𝜺p{}^{p}_{\boldsymbol{\varepsilon}}(\mathbf{x}) as:

s𝜺p(𝐱)=n,lI0δ(𝐱n𝐧1l𝐧2)fp(𝐱𝜺)\mathrm{s}^{p}_{\boldsymbol{\varepsilon}}(\mathbf{x})=\sum_{n,l\,\in\,I_{0}}\delta(\mathbf{x}-n\mathbf{n}_{1}-l\mathbf{n}_{2})\,\mathrm{f}^{p}(\mathbf{x}-\boldsymbol{\varepsilon})

where s(𝐱)𝜺p{}^{p}_{\boldsymbol{\varepsilon}}(\mathbf{x}) is expressed as sum of products of two 𝐱\mathbf{x}-functions. The FT of s(𝐱)𝜺p{}^{p}_{\boldsymbol{\varepsilon}}(\mathbf{x}) is the convolution of the FTs of the two functions. However, f(𝐱)p{}^{p}(\mathbf{x}) is periodic and has a FT similar to that of Eq. (41). This eliminates the integrations in the convolution and blocks the integration variables to the values of their δ\delta-functions. Then, S(𝝎)𝜺p{}^{p}_{\boldsymbol{\varepsilon}}(\boldsymbol{\omega}) becomes:

S𝜺p(𝝎)=\displaystyle\mathrm{S}^{p}_{\boldsymbol{\varepsilon}}(\boldsymbol{\omega})= 2d𝝎4π2H(𝝎𝝎)Fp(𝝎)\displaystyle\int_{\mathbb{R}^{2}}\frac{d\boldsymbol{\omega}}{4\pi^{2}}\mathrm{H}(\boldsymbol{\omega}-\boldsymbol{\omega}^{\prime})\mathrm{F}^{p}(\boldsymbol{\omega}^{\prime}) (42)
S𝜺p(𝝎)=\displaystyle\mathrm{S}^{p}_{\boldsymbol{\varepsilon}}(\boldsymbol{\omega})= 1T1T2m,k2n,lI0ei(n𝐧1+l𝐧2)(𝝎m𝐑1k𝐑2)\displaystyle\frac{1}{T_{1}T_{2}}\sum_{m,k\,\in\,\mathbb{Z}^{2}}\ \sum_{n,l\,\in\,I_{0}}\mathrm{e}^{-i(n\mathbf{n}_{1}+l\mathbf{n}_{2})(\boldsymbol{\omega}-m\mathbf{R}_{1}-k\mathbf{R}_{2})}
ei(m𝐑1+k𝐑2)𝜺G(mR1;kR2)Φ(mR1;kR2),\displaystyle\mathrm{e}^{-i(m\mathbf{R}_{1}+k\mathbf{R}_{2})\cdot\,\boldsymbol{\varepsilon}}\mathrm{G}(mR_{1};kR_{2})\Phi(mR_{1};kR_{2})\ ,

where H(𝝎)(\boldsymbol{\omega}) is the FT of the set of Dirac δ\delta-functions that define the detector positions.

Applying Eqs. (18) to Eq. (42), we can calculate the two components of 𝐫g\mathbf{r}_{g}. These equations can be easily generalized to a finite array of different detectors as the type discussed in [15], or to a subset of detectors of Penrose tessellation [5]. Each type of detector is introduced with its proper (different) f(𝐱)n,lp{}^{p}_{n,l}(\mathbf{x}) produced by a g(𝐱)n,l{}_{n,l}(\mathbf{x}) function convolving the same signal distribution. The g(𝐱)n,l{}_{n,l}(\mathbf{x}) functions account for the properties of the detectors located in the points labelled by the indexes {n,l}\{n,l\}. Then, we must modify Eq. (42) accordingly, introducing functions G(𝝎)n,l{}_{n,l}(\boldsymbol{\omega}), FT of g(𝐱)n,l{}_{n,l}(\mathbf{x}), that contain the shape, efficiency etc. of the detectors with their COGs in position {xn,yl}\{x_{n},y_{l}\}.

7.2 3x3 and 5x5 Detector Arrays

Let us describe the 33x33 and 55x55 arrays of rectangular detectors of the same type. In Eq. (42), the two sets of indexes nn and ll run on the integers {1, 0, 1}\{-1,\ 0,\ 1\}, for the 33x33 array, and {2,1, 0, 1, 2}\{-2,-1,\ 0,\ 1,\ 2\} for the 55x55. H(𝝎)5x5{}^{5\mathrm{x}5}(\boldsymbol{\omega}) and H(𝝎)3x3{}^{3\mathrm{x}3}(\boldsymbol{\omega}) becomes:

H5x5(𝝎)=\displaystyle\mathrm{H}^{5\mathrm{x}5}(\boldsymbol{\omega})= [2cos(2ωxτ1)+2cos(2ωxτ1)+1][2cos(2ωyτ2)+2cos(2ωyτ2)+1]\displaystyle[2\cos(2\omega_{x}\tau_{1})+2\cos(2\omega_{x}\tau_{1})+1][2\cos(2\omega_{y}\tau_{2})+2\cos(2\omega_{y}\tau_{2})+1] (43)
H3x3(𝝎)=\displaystyle\mathrm{H}^{3\mathrm{x}3}(\boldsymbol{\omega})= [2cos(2ωxτ1)+1][2cos(2ωyτ2)+1]\displaystyle[2\cos(2\omega_{x}\tau_{1})+1][2\cos(2\omega_{y}\tau_{2})+1]

and xgx_{g} for a 33x33 array becomes:

xg3x3=iT1T2m,k\displaystyle x^{3\mathrm{x}3}_{g}=\frac{i}{T_{1}T_{2}}\sum_{m,k} 2τ1sin(mR1τ1)[2cos(kR2τ2)+1]ei(m𝐑1+k𝐑2)𝜺\displaystyle 2\tau_{1}\sin(mR_{1}\tau_{1})\big{[}2\cos(kR_{2}\tau_{2})+1\big{]}\,\mathrm{e}^{-i(m\mathbf{R}_{1}+k\mathbf{R}_{2})\,\cdot\,\boldsymbol{\varepsilon}}\, (44)
G(mR1;kR2)Φ(mR1;kR2).\displaystyle\mathrm{G}(mR_{1};kR_{2})\,\Phi(mR_{1};kR_{2})\,.

Similar expressions can be easily obtained for ygy_{g} and for a 55x55 array. As discussed in [1], a set of discontinuities are present in 𝐫g(𝜺)\mathbf{r}_{g}(\boldsymbol{\varepsilon}) if the signal distribution extends beyond the limits of the array. In both cases, the discontinuities are located at the borders of the central detector. Near the borders, the suppressed tails of the signal distributions tend to differ, thereby inducing an error in the COGs. Beyond the borders, a different set of detectors are inserted in the algorithm, and the error changes sign, generating a

Refer to caption
Refer to caption
Figure 15: The surface on the left is the efficiency for energy collection of the 55x55 algorithm (i.e., S(0,0)5x5{}^{5\mathrm{x}5}(0,0)). The surface on the right is the efficiency of the 33x33 algorithm (S(0,0)3x3{}^{3\mathrm{x}3}(0,0)).

discontinuity.

To show how the 33x33 and 55x55 algorithms work, we will apply them to a detector similar to the CMS em calorimeter [13] with a signal distribution generated as described in [1] for a set of tracks. In [1], we explored the form of the average signal distribution generated by a set of random tracks whose parameters where tuned to reproduce the average lateral signal distribution of an em shower as extracted from the data in Ref. [14]. The shower’s axis is parallel to the detector’s zz-axis, so the tracks’ useful parameters do not contain their zz-origin. In the CMS em calorimeter, the crystals have a nonprojective geometry with a 33^{\circ}x 3\,3^{\circ} off-center pointing. In the simulation the shower axis is bent respect to the detector’s zz-axis, and the longitudinal distribution of the track origins must be introduced. This can be produced by adding a zz-dependent probability distribution of the track origins whose average reproduces the average longitudinal energy distribution of a 200200 GeV photon-shower as parameterized in [16]. The set of tracks are globally bent 33^{\circ} in yy- and in xx-direction to simulate the off-axis distortion of the CMS-crystals. The average over 150150 distributions is used to calculate the efficiency surfaces of the 55x55 and 33x33 energy reconstruction algorithms. It should be stressed that this is not a Monte Carlo simulation, but a toy model that allows easy calculation of S(0,0)5x5{}^{5\mathrm{x}5}(0,0) and S(0,0)3x3{}^{3\mathrm{x}3}(0,0). Most likely, the average signal distribution is realistic enough for our needs: In fact, the signal distribution is filtered by a low-pass filter and very few details are relevant to this simulation.

The bending of the em-shower axis renders the signal distribution slightly asymmetric. The COG shower does not coincide with the impact point of the photon on the face of the central crystal. To reconstruct the impact point, further assumptions are required. Our natural reference point is the COG signal distribution, which sets the maximum of the efficiency plots in the center of the detector. The range of allowed 𝜺\boldsymbol{\varepsilon}-values is limited by the central-detector boundaries.

Figure 15 shows the efficiency plots of algorithms 55x55 and 33x33. There is evidently greater signal loss and greater suppression of the signal tails in the 33x33 array. The marked reductions at the borders of the 55x55 array are due to the loss at the boundaries between crystals. This loss is simulated as a dead space whose length is the fraction of effective radiation length of the interspersed material. In these plots, we neglect an effect of the asymmetry of the signal distribution that, at a pair of corners, moves the maximum collected energy on a nearby crystal not containing the COG shower.

Refer to caption
Figure 16: Energy collected by the 5x5 array E5x5\,{}^{5x5}in function of the quantity E/5x5\,{}^{5x5}/E11{}^{1}-1. This plot cannot be reduced to a line as is usually done for the energy reconstruction.
Refer to caption
Figure 17: Set of plots for various values of ε2\varepsilon_{2} of COG error ε1xg\varepsilon_{1}-x_{g}, each shown in function of xgx_{g}.

The efficiency surfaces of Fig. 15 show a decrease at the borders. The decrease is usually recovered by ad hoc reconstruction methods. One method [13] is to consider the plot of E5x5\,{}^{5\mathrm{x}5} in relation to E5x5\,{}^{5\mathrm{x}5}/E11{}^{1}-1 and fit the resulting distribution (E1 is the energy collected by the central detector). It is evident from Fig. 16 that this function cannot be fit to a line without introducing an effective broadening of the energy resolution. The functions E5x5 and E1 are surfaces and have a complex correspondence. It is our guess that accounting for them could improve the energy reconstruction.

The COG error (ε1xg)(\varepsilon_{1}-x_{g}) in relation to xgx_{g} is illustrated in Fig. 17 for an array of 33x33 detectors. This quantity is a function of ε1\varepsilon_{1} and ε2\varepsilon_{2}, but, contrary to expectations, the dependence on ε2\varepsilon_{2} is negligible. This almost decoupling of the xgx_{g} error from ε2\varepsilon_{2} and ygy_{g} error from ε1\varepsilon_{1} allows each error to be corrected independently with the methods discussed in [1]. A slight dependence of xgx_{g} on ε2\varepsilon_{2} is probably introduced by the border regions where the maximum signal detector is not that containing the COG shower. These regions are at the corners of the central detector, where the signal spreads almost evenly over four detectors, and the COG error is very small.

7.3 Triangular Detectors

This subsection is devoted to describe the energy and position reconstructions in the Crystal Ball (CB) detector [2], a first-generation em calorimeter still in operation at the BNL [17] which is applied to the study of barionic resonances. This application illustrates the effectiveness of Eqs. (41,42) to a complex geometry such as that of the CB. As mentioned in Section 3.3, the CB calorimeter is composed of 672 optically isolated NaI(Tl) crystals. Each crystal is shaped as a truncated triangular pyramid, 40.6 cm long, pointing toward the interaction point, with 5.1 cm sides at the inner end and 12.7 cm sides at the outer end. The crystal setup is based on the geometry of an icosahedron having an equatorial plane that allows the separation of the ball into two hemispheres for easily opening. Each of the twenty main triangular faces of the icosahedron (majortrianglesmajor\ triangles) is divided into four minortrianglesminor\ triangles, each one consisting of nine individual crystals. Some crystals are removed at two sides of the equatorial plane to make room for the beam pipe.

Some details are ignored in the simulation. Having to work on a plane, we project a restricted set of triangular detectors. The significant differences in size of the top and bottom are neglected; each detector’s size will be that measured at the shower maximum (4040 cm from the center of the CB for electron showers and 0.80.8 radiation lengths more for photon showers). The energy reconstruction algorithm (as used long ago in the CB experiment in DESY at the DORIS II accelerator [18]) sums all the energy released in 12 crystals around the crystal with the maximum energy of the cluster and the maximum itself (E13).

The triangles’ relative positions in the array are crucial. The nn and ll values for the downward triangles to be used in Eq. (42) are: [(0,1)[(0,1) (1,1)(-1,1) (1,0)(-1,0) (0,0)(0,0) (1,0)(1,0) (0,1)(0,-1) (1,1)](1,-1)]. The upward triangles have nn and ll given by: [(1,0)[(-1,0) (0,0)(0,0) (1,0)(1,0) (0,1)(0,-1) (1,1)(1,-1) (1,2)](1,-2)]. It should be recalled that the origin of the sampling for the upward triangles is shifted by 2τ2/32\,\tau_{2}/3 and α\alpha is 2τ2/τ12\,\tau_{2}/\tau_{1}. The triangles are equilateral with τ1=3.37\tau_{1}=3.37 radiation lengths and high τ2\tau_{2}. Using Eq. (12) in Eq. (42), we obtain 𝐫g(𝜺)\mathbf{r}_{g}(\boldsymbol{\varepsilon}). Due to the lack of symmetry, we must carefully account for the relative phases of the complex quantities involved.

Refer to caption
Refer to caption
Figure 18: The surface on the left is S(0,0)ε1,ε2{}_{\varepsilon_{1},\varepsilon_{2}}(0,0) for the array of 13 crystals. ε1\varepsilon_{1} and ε2\varepsilon_{2} explore the central crystal. The surface on the right is the ration E/4{}_{4}/E13. Here, the efficiency drop at the borders of a crystal disappears, while the drop at the corners increases.

We apply Eqs. (41,42) to the set of triangles, remembering the differences of the upward and downward triangles as discussed in Section 3.3. We must use Eq. (29) in Eq. (42) for the upward triangles and its complex conjugate for the downward triangles. The average signal distribution is the model distribution generated as described in [1] to reproduce the lateral signal distribution of an em shower. Here no zz-distribution of the tracks is needed due to the coincidence of the CB center with the interaction point (projective geometry). The loss at the crystal borders is probably underestimated, since the model assumes that all the photons convert. Theoretically, the projective geometry allows photons to escape detection with an efficiency dropping near zero.

The efficiency plot in Fig. 18 is calculated for the range of 𝜺\boldsymbol{\varepsilon}-value covering the central triangle. As expected, the plot is a surface, and surfaces are the ratios with other partial sums of the collected energy. For example, histograms of E/4{}_{4}/E13 were used in cuts to reduce the π0\pi_{0} contamination, where E4 is the energy collected by the central crystal and by its three nearest ones. Even if our simulation of E/4{}_{4}/E13 recovers the drop in signal collection caused by the loss at the crystal borders, it is unable to recover the signal spread in neighboring crystals. Therefore, dealing with these distributions as parameters, effective broadening due to geometrical effects is introduced in the reconstructions, and good events are eliminated.

Refer to caption
Refer to caption
Figure 19: The COG error (ε1xg)(\varepsilon_{1}-x_{g}) in function of xgx_{g} (left), each curve plots a specific ε2\varepsilon_{2}-value. The COG error ε2yg\varepsilon_{2}-y_{g} in function of ygy_{g} (right), each curve plots a specific ε1\varepsilon_{1}-value.

The COG error in CB, as shown in Fig. 19, is very large, and without correction, errors of the order of τ1/4\tau_{1}/4 are often encountered. This is due to the very narrow core of our—very realistic—shower model that concentrates a large fraction of signal in the central crystal. The plots in Fig. 19 are rounded at the borders due to the signal collected by the lateral detectors, and the range of xgx_{g}-values covers almost all the central detector. In contrast to Fig. 17, (ε1xg)(\varepsilon_{1}-x_{g}) has a strong dependence on ε1\varepsilon_{1} and ε2\varepsilon_{2}, and, similarly (ε2yg)(\varepsilon_{2}-y_{g}). It is evident that the correction of these COG errors is a very complex operation, and the programs developed by CB collaboration were accordingly complex.

This example illustrates one of the more complicated cases, but the application of our equations is not more involved than the case of an array of square detectors. The equations and considerations in Section 3.3 are crucial to rapidly generate the simulation.

8 Conclusions

The COG error calculation for a two-dimensional array of sensors has been explored in detail. All the relevant equations have been discussed to allow safe applications with similar or different systems. This approach generalizes the results of [1], with the evident complexity of the two-dimensional geometry. All the equations contain double infinite sums and look very involved. The sums converge rapidly and a fairly limited number of terms are required to get satisfactory results; the applications and figures presented were obtained with only a few lines of MATLAB [19] code.

Forms of crosstalk which save the signal collection efficiency, and those in which the COG algorithm is free of discretization errors for any form of signal distributions may be isolated. The set of special forms is now much larger than in the one-dimensional case. These properties are collected in easily verifiable conditions on the function g(𝐱)(\mathbf{x}).

The set of properties of the g(𝐱)(\mathbf{x})-functions without crosstalk made it possible to prove that orthogonal and complete bases can be extracted from their Fourier transforms, giving a nonseparable two-dimensional form of the Wittaker-Kotel’nikov-Shannon theorem.

A type of crosstalk, which turned out to be largely independent of the shape and periodicity of the array, was detected. This crosstalk only generates an approximate cancellation of the COG discretization error for any signal distribution. The effect is given by the first zero of the J1-Bessel function which suppresses the first element of the COG error series. The fast decrease with the frequency of the Fourier-Series terms forming the COG error assigns an important contribution to the first term. The remaining terms contribute only slightly to the total COG-error. Not being exact, the result must be tested for the specific problem, but from the structure of the terms forming the COG errors, it can be inferred that the error reduction is substantial for any signal distribution.

To prove the previous general (or approximate) results, we worked with an infinite array of identical detectors, these equations can be used for detector optimizations.

In the experiments, reconstructions with a selection of detectors is a standard procedure to reduce the noise. To study the effects of these selections, we developed methods to handle a finite set of detectors. It is evident that the exact results are only of approximate validity in these cases. If the crosstalk completely suppresses the COG discretization error for any signal distribution in an infinite array, the suppression could not be complete for a finite set of detectors and could be (slightly) dependent upon the signal distribution.

The simulation of the energy reconstruction in an em-calorimeter such that of the CMS experiment highlights a position dependence of the reconstruction efficiency. This dependence does not appear to be recoverable using the standard tools for extracting parameters from ratios of signal collected by a different number of detectors. The 𝜺\boldsymbol{\varepsilon}-dependence of these ratios does not allow their use as parameters. The fluctuations of the Monte Carlo simulations cover the distribution of their mean values due to the shower position.

References

  • [1] G. Landi, Nucl. Instr. and Meth. A 485 (2002) 698 (also arXiv:1908.04447).
  • [2] E.D. Bloom and C.W. Peck, Annu. Rev. Nucl. Part. Sci. 33 (1983) 143.
  • [3] R.N. Bracewell, The Fourier Transform and Its Application. (McGraw-Hill, New York, NY, 1986).
  • [4] M.C. Escher, J.W. Vermeulen, Escher on Escher: Exploring the Infinite. (H.N.Adams. New York, NY, 1989).
  • [5] R. Penrose, The Emperor’s New Mind: Concerning Computers, Minds, and the Laws of Physics. (Oxford University Press, Oxford, UK, 1989)
  • [6] D.C. Champeney, A Handbook of Fourier Theorems. (Cambridge University Press, Cambridge, UK, 1987).
  • [7] B.V. Delft Electronische Producten, Roden, The Netherlands.
  • [8] MATHEMATICA 3. Wolfram Research, Inc.
  • [9] H. Dym, H.P. McKean, Fourier Series and Integrals. (Academic Press, London, 1972).
  • [10] A.J. Jerri, Proceedings IEEE 65, 1565 (1977).
    J.M. Whittaker, Proc. Math. Soc. 1, 169 (1929).
    V.A. Kotel’nikov, Izd. Red. Upr. Svyazi RKKA (Moscow, URSS, 1933).
    C.E. Shannon, Proc. IRE 37, 10 (1949).
  • [11] S. Mallat, A Wavelet Tour of Signal Processing. (Academic Press, London, UK, 1999).
  • [12] CMS. The Tracker Project. TDR. CERN/LHCC 98-3.
  • [13] CMS. The Electromagnetic Calorimeter. TDR. CERN/LHCC 97-33.
  • [14] A.A. Lednev, Nucl. Instr. Meth. A 366, 298 (1995).
  • [15] S. Hillert et. al., Nucl. Instr. Meth. A 458, 710 (2001).
  • [16] E. Longo and I. Sestili, Nucl. Instr. Meth. 128, 283 (1975).
  • [17] T.D.S. Stanislaus et al., Nucl. Instr. Meth. A 462, 463 (2001).
  • [18] D. Antreasyan et al., Z. Phys. C 48, 553 (1990).
  • [19] MATLAB 6.1, The MathWorks, Inc.