source: trunk/MagicSoft/Mars/mcalib/MHCalibrationChargeBlindPix.h@ 4198

Last change on this file since 4198 was 4198, checked in by gaug, 20 years ago
*** empty log message ***
File size: 17.7 KB
Line 
1#ifndef MARS_MHCalibrationChargeBlindPix
2#define MARS_MHCalibrationChargeBlindPix
3
4
5#ifndef MARS_MHCalibrationChargePix
6#include "MHCalibrationChargePix.h"
7#endif
8
9#ifndef ROOT_TMatrix
10#include <TMatrix.h>
11#endif
12
13#ifndef ROOT_TF1
14#include <TF1.h>
15#endif
16
17class TH1F;
18class TF1;
19class TPaveText;
20class TText;
21class MRawEvtData;
22class MRawEvtPixelIter;
23class MCalibrationChargeBlindPix;
24class MExtractedSignalBlindPixel;
25class MHCalibrationChargeBlindPix : public MHCalibrationChargePix
26{
27private:
28
29 static const Int_t fgChargeNbins; //! Default for fNBins (now set to: 5300 )
30 static const Axis_t fgChargeFirst; //! Default for fFirst (now set to: -100.5 )
31 static const Axis_t fgChargeLast; //! Default for fLast (now set to: 5199.5 )
32 static const Float_t fgSinglePheCut; //! Default for fSinglePheCut (now set to: 200 )
33 static const Float_t fgNumSinglePheLimit; //! Default for fNumSinglePheLimit (now set to: 50 )
34
35 static const Double_t gkElectronicAmp; // Electronic Amplification after the PMT (in FADC counts/N_e)
36 static const Double_t gkElectronicAmpErr; // Error of the electronic amplification
37
38 Float_t fSinglePheCut; // Value of summed FADC slices upon which event considered as single-phe
39 Float_t fNumSinglePheLimit; // Minimum number of single-phe events
40
41 MCalibrationChargeBlindPix *fBlindPix; //! Storage container results
42 MExtractedSignalBlindPixel *fSignal; //! Storage container extracted signal
43 MRawEvtData *fRawEvt; //! Storage container raw data
44
45 TVector fASinglePheFADCSlices; // Averaged FADC slice entries supposed single-phe events
46 TVector fAPedestalFADCSlices; // Averaged FADC slice entries supposed pedestal events
47
48 TF1 *fSinglePheFit; // Single Phe Fit (Gaussians convoluted with Poisson)
49
50 UInt_t fNumSinglePhes; // Number of entries in fASinglePheFADCSlices
51 UInt_t fNumPedestals; // Number of entries in fAPedestalFADCSlices
52
53 Double_t fLambda; // Poisson mean from Single-phe fit
54 Double_t fLambdaCheck; // Poisson mean from Pedestal fit alone
55 Double_t fMu0; // Mean of the pedestal
56 Double_t fMu1; // Mean of single-phe peak
57 Double_t fSigma0; // Sigma of the pedestal
58 Double_t fSigma1; // Sigma of single-phe peak
59
60 Double_t fLambdaErr; // Error of Poisson mean from Single-phe fit
61 Double_t fLambdaCheckErr; // Error of Poisson mean from Pedestal fit alone
62 Double_t fMu0Err; // Error of Mean of the pedestal
63 Double_t fMu1Err; // Error of Mean of single-phe peak
64 Double_t fSigma0Err; // Error of Sigma of the pedestal
65 Double_t fSigma1Err; // Error of Sigma of single-phe peak
66
67 Double_t fChisquare; // Chisquare of single-phe fit
68 Int_t fNDF; // Ndof of single-phe fit
69 Double_t fProb; // Probability of singleo-phe fit
70
71 Double_t fMeanPedestal; // Mean pedestal from pedestal run
72 Double_t fSigmaPedestal; // Sigma pedestal from pedestal run
73
74 Double_t fMeanPedestalErr; // Error of Mean pedestal from pedestal run
75 Double_t fSigmaPedestalErr; // Error of Sigma pedestal from pedestal run
76
77 Byte_t fFlags; // Bit-field for the flags
78 enum { kSinglePheFitOK, kPedestalFitOK }; // Possible bits to be set
79
80 TPaveText *fFitLegend; //! Some legend to display the fit results
81 TH1F *fHSinglePheFADCSlices; //! A histogram created and deleted only in Draw()
82 TH1F *fHPedestalFADCSlices; //! A histogram created and deleted only in Draw()
83
84 // Fill histos
85 void FillSinglePheFADCSlices(const MRawEvtPixelIter &iter);
86 void FillPedestalFADCSlices( const MRawEvtPixelIter &iter);
87
88 // Fit
89 Bool_t InitFit();
90 void ExitFit();
91
92public:
93
94 MHCalibrationChargeBlindPix(const char *name=NULL, const char *title=NULL);
95 ~MHCalibrationChargeBlindPix();
96
97 void Clear(Option_t *o="");
98
99 Bool_t SetupFill(const MParList *pList);
100 Bool_t ReInit ( MParList *pList);
101 Bool_t Fill (const MParContainer *par, const Stat_t w=1);
102 Bool_t Finalize();
103
104 // Setters
105 void SetSinglePheCut ( const Float_t cut =fgSinglePheCut ) { fSinglePheCut = cut; }
106 void SetNumSinglePheLimit ( const Float_t lim =fgNumSinglePheLimit ) { fNumSinglePheLimit = lim; }
107
108 void SetMeanPedestal ( const Float_t f ) { fMeanPedestal = f; }
109 void SetMeanPedestalErr ( const Float_t f ) { fMeanPedestalErr = f; }
110 void SetSigmaPedestal ( const Float_t f ) { fSigmaPedestal = f; }
111 void SetSigmaPedestalErr ( const Float_t f ) { fSigmaPedestalErr = f; }
112
113 void SetSinglePheFitOK ( const Bool_t b=kTRUE);
114 void SetPedestalFitOK ( const Bool_t b=kTRUE);
115
116 // Getters
117 const Double_t GetLambda() const { return fLambda; }
118 const Double_t GetLambdaCheck() const { return fLambdaCheck; }
119 const Double_t GetMu0() const { return fMu0; }
120 const Double_t GetMu1() const { return fMu1; }
121 const Double_t GetSigma0() const { return fSigma0; }
122 const Double_t GetSigma1() const { return fSigma1; }
123
124 const Double_t GetLambdaErr() const { return fLambdaErr; }
125 const Double_t GetLambdaCheckErr() const { return fLambdaCheckErr; }
126 const Double_t GetMu0Err() const { return fMu0Err; }
127 const Double_t GetMu1Err() const { return fMu1Err; }
128 const Double_t GetSigma0Err() const { return fSigma0Err; }
129 const Double_t GetSigma1Err() const { return fSigma1Err; }
130
131 TVector &GetASinglePheFADCSlices() { return fASinglePheFADCSlices; }
132 const TVector &GetASinglePheFADCSlices() const { return fASinglePheFADCSlices; }
133
134 TVector &GetAPedestalFADCSlices() { return fAPedestalFADCSlices; }
135 const TVector &GetAPedestalFADCSlices() const { return fAPedestalFADCSlices; }
136
137 const Bool_t IsSinglePheFitOK() const;
138 const Bool_t IsPedestalFitOK() const;
139
140 // Draws
141 void Draw(Option_t *opt="");
142
143private:
144 void DrawLegend();
145
146 // Fits
147public:
148 enum FitFunc_t { kEPoisson4, kEPoisson5, kEPoisson6, kEPoisson7, kEPolya, kEMichele }; // The possible fit functions
149
150private:
151 FitFunc_t fFitFunc;
152
153public:
154 Bool_t FitSinglePhe (Option_t *opt="RL0+Q");
155 void FitPedestal (Option_t *opt="RL0+Q");
156
157 void ChangeFitFunc(const FitFunc_t func) { fFitFunc = func; }
158
159 // Simulation
160 Bool_t SimulateSinglePhe(const Double_t lambda,
161 const Double_t mu0, const Double_t mu1,
162 const Double_t sigma0, const Double_t sigma1);
163
164private:
165
166 inline static Double_t fFitFuncMichele(Double_t *x, Double_t *par)
167 {
168
169 Double_t lambda1cat = par[0];
170 Double_t lambda1dyn = par[1];
171 Double_t mu0 = par[2];
172 Double_t mu1cat = par[3];
173 Double_t mu1dyn = par[4];
174 Double_t sigma0 = par[5];
175 Double_t sigma1cat = par[6];
176 Double_t sigma1dyn = par[7];
177 Double_t offset = par[9];
178
179 Double_t sumcat = 0.;
180 Double_t sumdyn = 0.;
181 Double_t arg = 0.;
182
183 if (mu1cat < mu0)
184 return FLT_MAX;
185
186 if (sigma1cat < sigma0)
187 return FLT_MAX;
188
189 // if (sigma1cat < sigma1dyn)
190 // return NoWay;
191
192 //if (mu1cat < mu1dyn)
193 // return NoWay;
194
195 // if (lambda1cat < lambda1dyn)
196 // return NoWay;
197
198 Double_t mu2cat = (2.*mu1cat)-mu0;
199 Double_t mu2dyn = (2.*mu1dyn)-mu0;
200 Double_t mu3cat = (3.*mu1cat)-(2.*mu0);
201 Double_t mu3dyn = (3.*mu1dyn)-(2.*mu0);
202
203 Double_t sigma2cat = TMath::Sqrt((2.*sigma1cat*sigma1cat) - (sigma0*sigma0));
204 Double_t sigma2dyn = TMath::Sqrt((2.*sigma1dyn*sigma1dyn) - (sigma0*sigma0));
205 Double_t sigma3cat = TMath::Sqrt((3.*sigma1cat*sigma1cat) - (2.*sigma0*sigma0));
206 Double_t sigma3dyn = TMath::Sqrt((3.*sigma1dyn*sigma1dyn) - (2.*sigma0*sigma0));
207
208 Double_t lambda2cat = lambda1cat*lambda1cat;
209 Double_t lambda2dyn = lambda1dyn*lambda1dyn;
210 Double_t lambda3cat = lambda2cat*lambda1cat;
211 Double_t lambda3dyn = lambda2dyn*lambda1dyn;
212
213 // k=0:
214 arg = (x[0] - mu0)/sigma0;
215 sumcat = TMath::Exp(-0.5*arg*arg)/sigma0;
216 sumdyn =sumcat;
217
218 // k=1cat:
219 arg = (x[0] - mu1cat)/sigma1cat;
220 sumcat += lambda1cat*TMath::Exp(-0.5*arg*arg)/sigma1cat;
221 // k=1dyn:
222 arg = (x[0] - mu1dyn)/sigma1dyn;
223 sumdyn += lambda1dyn*TMath::Exp(-0.5*arg*arg)/sigma1dyn;
224
225 // k=2cat:
226 arg = (x[0] - mu2cat)/sigma2cat;
227 sumcat += 0.5*lambda2cat*TMath::Exp(-0.5*arg*arg)/sigma2cat;
228 // k=2dyn:
229 arg = (x[0] - mu2dyn)/sigma2dyn;
230 sumdyn += 0.5*lambda2dyn*TMath::Exp(-0.5*arg*arg)/sigma2dyn;
231
232
233 // k=3cat:
234 arg = (x[0] - mu3cat)/sigma3cat;
235 sumcat += 0.1666666667*lambda3cat*TMath::Exp(-0.5*arg*arg)/sigma3cat;
236 // k=3dyn:
237 arg = (x[0] - mu3dyn)/sigma3dyn;
238 sumdyn += 0.1666666667*lambda3dyn*TMath::Exp(-0.5*arg*arg)/sigma3dyn;
239
240 sumcat = TMath::Exp(-1.*lambda1cat)*sumcat;
241 sumdyn = TMath::Exp(-1.*lambda1dyn)*sumdyn;
242
243 return par[8]*(sumcat+sumdyn)/2. + offset;
244
245 }
246
247 inline static Double_t fPoissonKto4(Double_t *x, Double_t *par)
248 {
249
250 Double_t lambda = par[0];
251
252 Double_t sum = 0.;
253 Double_t arg = 0.;
254
255 Double_t mu0 = par[1];
256 Double_t mu1 = par[2];
257
258 if (mu1 < mu0)
259 return FLT_MAX;
260
261 Double_t sigma0 = par[3];
262 Double_t sigma1 = par[4];
263
264 if (sigma1 < sigma0)
265 return FLT_MAX;
266
267 Double_t mu2 = (2.*mu1)-mu0;
268 Double_t mu3 = (3.*mu1)-(2.*mu0);
269 Double_t mu4 = (4.*mu1)-(3.*mu0);
270
271 Double_t sigma2 = TMath::Sqrt((2.*sigma1*sigma1) - (sigma0*sigma0));
272 Double_t sigma3 = TMath::Sqrt((3.*sigma1*sigma1) - (2.*sigma0*sigma0));
273 Double_t sigma4 = TMath::Sqrt((4.*sigma1*sigma1) - (3.*sigma0*sigma0));
274
275 Double_t lambda2 = lambda*lambda;
276 Double_t lambda3 = lambda2*lambda;
277 Double_t lambda4 = lambda3*lambda;
278
279 // k=0:
280 arg = (x[0] - mu0)/sigma0;
281 sum = TMath::Exp(-0.5*arg*arg)/sigma0;
282
283 // k=1:
284 arg = (x[0] - mu1)/sigma1;
285 sum += lambda*TMath::Exp(-0.5*arg*arg)/sigma1;
286
287 // k=2:
288 arg = (x[0] - mu2)/sigma2;
289 sum += 0.5*lambda2*TMath::Exp(-0.5*arg*arg)/sigma2;
290
291 // k=3:
292 arg = (x[0] - mu3)/sigma3;
293 sum += 0.1666666667*lambda3*TMath::Exp(-0.5*arg*arg)/sigma3;
294
295 // k=4:
296 arg = (x[0] - mu4)/sigma4;
297 sum += 0.041666666666667*lambda4*TMath::Exp(-0.5*arg*arg)/sigma4;
298
299 return TMath::Exp(-1.*lambda)*par[5]*sum;
300
301 }
302
303
304 inline static Double_t fPoissonKto5(Double_t *x, Double_t *par)
305 {
306
307 Double_t lambda = par[0];
308
309 Double_t sum = 0.;
310 Double_t arg = 0.;
311
312 Double_t mu0 = par[1];
313 Double_t mu1 = par[2];
314
315 if (mu1 < mu0)
316 return FLT_MAX;
317
318 Double_t sigma0 = par[3];
319 Double_t sigma1 = par[4];
320
321 if (sigma1 < sigma0)
322 return FLT_MAX;
323
324
325 Double_t mu2 = (2.*mu1)-mu0;
326 Double_t mu3 = (3.*mu1)-(2.*mu0);
327 Double_t mu4 = (4.*mu1)-(3.*mu0);
328 Double_t mu5 = (5.*mu1)-(4.*mu0);
329
330 Double_t sigma2 = TMath::Sqrt((2.*sigma1*sigma1) - (sigma0*sigma0));
331 Double_t sigma3 = TMath::Sqrt((3.*sigma1*sigma1) - (2.*sigma0*sigma0));
332 Double_t sigma4 = TMath::Sqrt((4.*sigma1*sigma1) - (3.*sigma0*sigma0));
333 Double_t sigma5 = TMath::Sqrt((5.*sigma1*sigma1) - (4.*sigma0*sigma0));
334
335 Double_t lambda2 = lambda*lambda;
336 Double_t lambda3 = lambda2*lambda;
337 Double_t lambda4 = lambda3*lambda;
338 Double_t lambda5 = lambda4*lambda;
339
340 // k=0:
341 arg = (x[0] - mu0)/sigma0;
342 sum = TMath::Exp(-0.5*arg*arg)/sigma0;
343
344 // k=1:
345 arg = (x[0] - mu1)/sigma1;
346 sum += lambda*TMath::Exp(-0.5*arg*arg)/sigma1;
347
348 // k=2:
349 arg = (x[0] - mu2)/sigma2;
350 sum += 0.5*lambda2*TMath::Exp(-0.5*arg*arg)/sigma2;
351
352 // k=3:
353 arg = (x[0] - mu3)/sigma3;
354 sum += 0.1666666667*lambda3*TMath::Exp(-0.5*arg*arg)/sigma3;
355
356 // k=4:
357 arg = (x[0] - mu4)/sigma4;
358 sum += 0.041666666666667*lambda4*TMath::Exp(-0.5*arg*arg)/sigma4;
359
360 // k=5:
361 arg = (x[0] - mu5)/sigma5;
362 sum += 0.008333333333333*lambda5*TMath::Exp(-0.5*arg*arg)/sigma5;
363
364 return TMath::Exp(-1.*lambda)*par[5]*sum;
365
366 }
367
368
369 inline static Double_t fPoissonKto6(Double_t *x, Double_t *par)
370 {
371
372 Double_t lambda = par[0];
373
374 Double_t sum = 0.;
375 Double_t arg = 0.;
376
377 Double_t mu0 = par[1];
378 Double_t mu1 = par[2];
379
380 if (mu1 < mu0)
381 return FLT_MAX;
382
383 Double_t sigma0 = par[3];
384 Double_t sigma1 = par[4];
385
386 if (sigma1 < sigma0)
387 return FLT_MAX;
388
389
390 Double_t mu2 = (2.*mu1)-mu0;
391 Double_t mu3 = (3.*mu1)-(2.*mu0);
392 Double_t mu4 = (4.*mu1)-(3.*mu0);
393 Double_t mu5 = (5.*mu1)-(4.*mu0);
394 Double_t mu6 = (6.*mu1)-(5.*mu0);
395
396 Double_t sigma2 = TMath::Sqrt((2.*sigma1*sigma1) - (sigma0*sigma0));
397 Double_t sigma3 = TMath::Sqrt((3.*sigma1*sigma1) - (2.*sigma0*sigma0));
398 Double_t sigma4 = TMath::Sqrt((4.*sigma1*sigma1) - (3.*sigma0*sigma0));
399 Double_t sigma5 = TMath::Sqrt((5.*sigma1*sigma1) - (4.*sigma0*sigma0));
400 Double_t sigma6 = TMath::Sqrt((6.*sigma1*sigma1) - (5.*sigma0*sigma0));
401
402 Double_t lambda2 = lambda*lambda;
403 Double_t lambda3 = lambda2*lambda;
404 Double_t lambda4 = lambda3*lambda;
405 Double_t lambda5 = lambda4*lambda;
406 Double_t lambda6 = lambda5*lambda;
407
408 // k=0:
409 arg = (x[0] - mu0)/sigma0;
410 sum = TMath::Exp(-0.5*arg*arg)/sigma0;
411
412 // k=1:
413 arg = (x[0] - mu1)/sigma1;
414 sum += lambda*TMath::Exp(-0.5*arg*arg)/sigma1;
415
416 // k=2:
417 arg = (x[0] - mu2)/sigma2;
418 sum += 0.5*lambda2*TMath::Exp(-0.5*arg*arg)/sigma2;
419
420 // k=3:
421 arg = (x[0] - mu3)/sigma3;
422 sum += 0.1666666667*lambda3*TMath::Exp(-0.5*arg*arg)/sigma3;
423
424 // k=4:
425 arg = (x[0] - mu4)/sigma4;
426 sum += 0.041666666666667*lambda4*TMath::Exp(-0.5*arg*arg)/sigma4;
427
428 // k=5:
429 arg = (x[0] - mu5)/sigma5;
430 sum += 0.008333333333333*lambda5*TMath::Exp(-0.5*arg*arg)/sigma5;
431
432 // k=6:
433 arg = (x[0] - mu6)/sigma6;
434 sum += 0.001388888888889*lambda6*TMath::Exp(-0.5*arg*arg)/sigma6;
435
436 return TMath::Exp(-1.*lambda)*par[5]*sum;
437
438 }
439
440 inline static Double_t fPolya(Double_t *x, Double_t *par)
441 {
442
443 const Double_t QEcat = 0.247; // mean quantum efficiency
444 const Double_t sqrt2 = 1.4142135623731;
445 const Double_t sqrt3 = 1.7320508075689;
446 const Double_t sqrt4 = 2.;
447
448 const Double_t lambda = par[0]; // mean number of photons
449
450 const Double_t excessPoisson = par[1]; // non-Poissonic noise contribution
451 const Double_t delta1 = par[2]; // amplification first dynode
452 const Double_t delta2 = par[3]; // amplification subsequent dynodes
453
454 const Double_t electronicAmpl = par[4]; // electronic amplification and conversion to FADC charges
455
456 const Double_t pmtAmpl = delta1*delta2*delta2*delta2*delta2*delta2; // total PMT gain
457 const Double_t A = 1. + excessPoisson - QEcat
458 + 1./delta1
459 + 1./delta1/delta2
460 + 1./delta1/delta2/delta2; // variance contributions from PMT and QE
461
462 const Double_t totAmpl = QEcat*pmtAmpl*electronicAmpl; // Total gain and conversion
463
464 const Double_t mu0 = par[7]; // pedestal
465 const Double_t mu1 = totAmpl; // single phe position
466 const Double_t mu2 = 2*totAmpl; // double phe position
467 const Double_t mu3 = 3*totAmpl; // triple phe position
468 const Double_t mu4 = 4*totAmpl; // quadruple phe position
469
470 const Double_t sigma0 = par[5];
471 const Double_t sigma1 = electronicAmpl*pmtAmpl*TMath::Sqrt(QEcat*A);
472 const Double_t sigma2 = sqrt2*sigma1;
473 const Double_t sigma3 = sqrt3*sigma1;
474 const Double_t sigma4 = sqrt4*sigma1;
475
476 const Double_t lambda2 = lambda*lambda;
477 const Double_t lambda3 = lambda2*lambda;
478 const Double_t lambda4 = lambda3*lambda;
479
480 //-- calculate the area----
481 Double_t arg = (x[0] - mu0)/sigma0;
482 Double_t sum = TMath::Exp(-0.5*arg*arg)/sigma0;
483
484 // k=1:
485 arg = (x[0] - mu1)/sigma1;
486 sum += lambda*TMath::Exp(-0.5*arg*arg)/sigma1;
487
488 // k=2:
489 arg = (x[0] - mu2)/sigma2;
490 sum += 0.5*lambda2*TMath::Exp(-0.5*arg*arg)/sigma2;
491
492 // k=3:
493 arg = (x[0] - mu3)/sigma3;
494 sum += 0.1666666667*lambda3*TMath::Exp(-0.5*arg*arg)/sigma3;
495
496 // k=4:
497 arg = (x[0] - mu4)/sigma4;
498 sum += 0.041666666666667*lambda4*TMath::Exp(-0.5*arg*arg)/sigma4;
499
500 return TMath::Exp(-1.*lambda)*par[6]*sum;
501 }
502
503
504
505 ClassDef(MHCalibrationChargeBlindPix, 1) // Histogram class for Charge Blind Pixel Calibration
506};
507
508#endif /* MARS_MHCalibrationChargeBlindPix */
Note: See TracBrowser for help on using the repository browser.