1 /**************************************************************************
2 * This file is property of and copyright by *
3 * the Relativistic Heavy Ion Group (RHIG), Yale University, US, 2009 *
5 * Primary Author: Per Thomas Hille <perthomas.hille@yale.edu> *
7 * Contributors are mentioned in the code where appropriate. *
8 * Please report bugs to p.t.hille@fys.uio.no *
10 * Permission to use, copy, modify and distribute this software and its *
11 * documentation strictly for non-commercial purposes is hereby granted *
12 * without fee, provided that the above copyright notice appears in all *
13 * copies and that both the copyright notice and this permission notice *
14 * appear in the supporting documentation. The authors make no claims *
15 * about the suitability of this software for any purpose. It is *
16 * provided "as is" without express or implied warranty. *
17 **************************************************************************/
20 // Base class for extraction
21 // of signal amplitude and peak position
22 // From CALO Calorimeter RAW data (from the RCU)
23 // Contains some utilities for preparing / selecting
24 // Signals suitable for signal extraction
28 #include "AliCaloRawAnalyzer.h"
29 #include "AliCaloBunchInfo.h"
30 #include "AliCaloFitResults.h"
35 ClassImp(AliCaloRawAnalyzer)
37 AliCaloRawAnalyzer::AliCaloRawAnalyzer(const char *name, const char *nameshort) : TObject(),
45 fIsZerosupressed( false ),
49 sprintf(fName, "%s", name);
50 sprintf(fNameShort, "%s", nameshort);
52 for(int i=0; i < MAXSAMPLES; i++ )
58 AliCaloRawAnalyzer::~AliCaloRawAnalyzer()
65 AliCaloRawAnalyzer::SetTimeConstraint(const int min, const int max )
67 //Require that the bin if the maximum ADC value is between min and max (timebin)
68 if( ( min > max ) || min > MAXSAMPLES || max > MAXSAMPLES )
70 AliWarning( Form( "Attempt to set Invalid time bin range (Min , Max) = (%d, %d), Ingored", min, max ) );
81 AliCaloRawAnalyzer::Max(const UShort_t *data, const int length ) const
84 UShort_t tmpmax = data[0];
86 for(int i=0; i < length; i++)
88 if( tmpmax < data[i] )
98 AliCaloRawAnalyzer::SelectSubarray( const Double_t *fData, const int length, const short maxindex, int *const first, int *const last ) const
100 //Selection of subset of data from one bunch that will be used for fitting or
101 //Peak finding. Go to the left and right of index of the maximum time bin
102 //Until the ADC value is less that fFitArrayCut, or derivative changes sign (data jump)
103 int tmpfirst = maxindex;
104 int tmplast = maxindex;
105 Double_t prevFirst = fData[maxindex];
106 Double_t prevLast = fData[maxindex];
107 bool firstJump = false;
108 bool lastJump = false;
110 while( (tmpfirst >= 0) && (fData[tmpfirst] >= fFitArrayCut) && (!firstJump) )
113 if (tmpfirst != maxindex) { // neighbor to maxindex can share peak with maxindex
114 if (fData[tmpfirst] >= prevFirst) {
118 prevFirst = fData[tmpfirst];
122 while( (tmplast < length) && (fData[tmplast] >= fFitArrayCut) && (!lastJump) )
125 if (tmplast != maxindex) { // neighbor to maxindex can share peak with maxindex
126 if (fData[tmplast] >= prevLast) {
130 prevLast = fData[tmplast];
134 // we keep one pre- or post- sample if we can (as in online)
135 // check though if we ended up on a 'jump', or out of bounds: if so, back up
136 if (firstJump || tmpfirst<0) tmpfirst ++;
137 if (lastJump || tmplast>=length) tmplast --;
147 AliCaloRawAnalyzer::ReverseAndSubtractPed( const AliCaloBunchInfo *bunch, const UInt_t /*altrocfg1*/, const UInt_t /*altrocfg2*/, double *outarray ) const
149 //Time sample comes in reversed order, revers them back
150 //Subtract the baseline based on content of altrocfg1 and altrocfg2.
151 Int_t length = bunch->GetLength();
152 const UShort_t *sig = bunch->GetData();
154 double ped = EvaluatePedestal( sig , length);
156 for( int i=0; i < length; i++ )
158 outarray[i] = sig[length -i -1] - ped;
167 AliCaloRawAnalyzer::EvaluatePedestal(const UShort_t * const data, const int /*length*/ ) const
172 if( fIsZerosupressed == false )
174 for(int i=0; i < fNsamplePed; i++ )
180 return tmp/fNsamplePed;
185 AliCaloRawAnalyzer::Max( const AliCaloBunchInfo *const bunch , int *const maxindex ) const
190 const UShort_t *sig = bunch->GetData();
192 for(int i=0; i < bunch->GetLength(); i++ )
194 if( sig[i] > tmpmax )
203 // *maxindex = bunch->GetLength() -1 - tmpindex + bunch->GetStartBin();
204 *maxindex = bunch->GetLength() -1 - tmpindex + bunch->GetStartBin();
212 AliCaloRawAnalyzer::CheckBunchEdgesForMax( const AliCaloBunchInfo *const bunch ) const
214 // a bunch is considered invalid if the maximum is in the first or last time-bin
217 const UShort_t *sig = bunch->GetData();
219 for(int i=0; i < bunch->GetLength(); i++ )
221 if( sig[i] > tmpmax )
229 if (tmpindex == 0 || tmpindex == (bunch->GetLength()-1) )
239 AliCaloRawAnalyzer::SelectBunch( const vector<AliCaloBunchInfo> &bunchvector,short *const maxampbin, short *const maxamplitude ) const
241 //We select the bunch with the highest amplitude unless any time constraints is set
243 short bunchindex = -1;
247 for(unsigned int i=0; i < bunchvector.size(); i++ )
249 max = Max( &bunchvector.at(i), &indx ); // CRAP PTH, bug fix, trouble if more than one bunches
250 if( IsInTimeRange( indx) )
262 if (bunchindex >= 0) {
263 bool bunchOK = CheckBunchEdgesForMax( &bunchvector.at(bunchindex) );
274 AliCaloRawAnalyzer::IsInTimeRange( const int maxindex ) const
276 // Ckeck if the index of the max ADC vaue is consistent with trigger.
277 if( ( fMinTimeIndex < 0 && fMaxTimeIndex < 0) ||fMaxTimeIndex < 0 )
281 return ( maxindex < fMaxTimeIndex ) && ( maxindex > fMinTimeIndex ) ? true : false;
286 AliCaloRawAnalyzer::PrintBunches( const vector<AliCaloBunchInfo> &bvctr ) const
289 cout << __FILE__ << __LINE__<< "*************** Printing Bunches *******************" << endl;
290 cout << __FILE__ << __LINE__<< "*** There are " << bvctr.size() << ", bunches" << endl;
292 for(unsigned int i=0; i < bvctr.size() ; i++ )
294 PrintBunch( bvctr.at(i) );
295 cout << " bunch = " << i << endl;
297 cout << __FILE__ << __LINE__<< "*************** Done ... *******************" << endl;
302 AliCaloRawAnalyzer::PrintBunch( const AliCaloBunchInfo &bunch ) const
305 cout << __FILE__ << ":" << __LINE__ << endl;
306 cout << __FILE__ << __LINE__ << ", startimebin = " << bunch.GetStartBin() << ", length =" << bunch.GetLength() << endl;
307 const UShort_t *sig = bunch.GetData();
309 for ( Int_t j = 0; j < bunch.GetLength(); j++)
311 printf("%d\t", sig[j] );
318 AliCaloRawAnalyzer::CalculateChi2(const Double_t amp, const Double_t time,
319 const Int_t first, const Int_t last,
320 const Double_t adcErr,
324 // amp - max amplitude;
325 // time - time of max amplitude;
326 // first, last - sample array indices to be used
327 // adcErr - nominal error of amplitude measurement (one value for all channels)
328 // if adcErr<0 that mean adcErr=1.
329 // tau - filter time response (in timebin units)
333 if (first == last || first<0 ) { // signal consists of single sample, chi2 estimate (0) not too well defined..
334 // or, first is negative, the indices are not valid
335 return AliCaloFitResults::kDummy;
338 int nsamples = last - first + 1;
339 // printf(" AliCaloRawAnalyzer::CalculateChi2 : first %i last %i : nsamples %i : amp %3.2f time %3.2f \n", first, last, nsamples, amp, time);
343 Double_t dy = 0.0, xx = 0.0, f=0.0;
345 for (Int_t i=0; i<nsamples; i++) {
346 x = first + i; // timebin
347 xx = (x - time + tau) / tau; // help variable
350 f = amp * xx*xx * TMath::Exp(2 * (1 - xx )) ;
352 dy = fReversed[x] - f;
354 // printf(" AliCaloRawAnalyzer::CalculateChi2 : %i : y %f -> f %f : dy %f \n", i, fReversed[first+i], f, dy);
357 if (adcErr>0.0) { // weight chi2
358 chi2 /= (adcErr*adcErr);
365 AliCaloRawAnalyzer::CalculateMeanAndRMS(const Int_t first, const Int_t last,
366 Double_t & mean, Double_t & rms)
369 // first, last - sample array indices to be used
371 // mean and RMS of samples
373 // To possibly be used to differentiate good signals from bad before fitting
375 mean = AliCaloFitResults::kDummy;
376 rms = AliCaloFitResults::kDummy;
378 if (first == last || first<0 ) { // signal consists of single sample, chi2 estimate (0) not too well defined..
379 // or, first is negative, the indices are not valid
383 int nsamples = last - first + 1;
384 // printf(" AliCaloRawAnalyzer::CalculateMeanAndRMS : first %i last %i : nsamples %i \n", first, last, nsamples);
387 Double_t sampleSum = 0; // sum of samples
388 Double_t squaredSampleSum = 0; // sum of samples squared
390 for (Int_t i=0; i<nsamples; i++) {
392 sampleSum += fReversed[x];
393 squaredSampleSum += (fReversed[x] * fReversed[x]);
396 mean = sampleSum / nsamples;
397 Double_t squaredMean = squaredSampleSum / nsamples;
398 // The variance (rms squared) is equal to the mean of the squares minus the square of the mean..
399 rms = sqrt(squaredMean - mean*mean);
405 AliCaloRawAnalyzer::Evaluate( const vector<AliCaloBunchInfo> &/*bunchvector*/, const UInt_t /*altrocfg1*/, const UInt_t /*altrocfg2*/)
406 { // method to do the selection of what should possibly be fitted
407 // not implemented for base class
408 return AliCaloFitResults( 0, 0 );
413 AliCaloRawAnalyzer::PreFitEvaluateSamples( const vector<AliCaloBunchInfo> &bunchvector, const UInt_t altrocfg1, const UInt_t altrocfg2, Int_t & index, Float_t & maxf, short & maxamp, short & maxrev, Float_t & ped, int & first, int & last)
414 { // method to do the selection of what should possibly be fitted
416 short maxampindex = 0;
417 index = SelectBunch( bunchvector, &maxampindex, &maxamp ); // select the bunch with the highest amplitude unless any time constraints is set
420 if( index >= 0 && maxamp >= fAmpCut) // something valid was found, and non-zero amplitude
422 // use more convenient numbering and possibly subtract pedestal
423 ped = ReverseAndSubtractPed( &(bunchvector.at(index)), altrocfg1, altrocfg2, fReversed );
424 maxf = TMath::MaxElement( bunchvector.at(index).GetLength(), fReversed );
426 if ( maxf >= fAmpCut ) // possibly significant signal
428 // select array around max to possibly be used in fit
429 maxrev = maxampindex - bunchvector.at(index).GetStartBin();
430 SelectSubarray( fReversed, bunchvector.at(index).GetLength(), maxrev, &first, &last);
432 // sanity check: maximum should not be in first or last bin
433 // if we should do a fit
434 if (first!=maxrev && last!=maxrev) {
435 // calculate how many samples we have
436 nsamples = last - first + 1;