1 /**************************************************************************
2 * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
4 * Author: The ALICE Off-line Project. *
5 * Contributors are mentioned in the code where appropriate. *
7 * Permission to use, copy, modify and distribute this software and its *
8 * documentation strictly for non-commercial purposes is hereby granted *
9 * without fee, provided that the above copyright notice appears in all *
10 * copies and that both the copyright notice and this permission notice *
11 * appear in the supporting documentation. The authors make no claims *
12 * about the suitability of this software for any purpose. It is *
13 * provided "as is" without express or implied warranty. *
14 **************************************************************************/
18 Revision 1.28 2002/10/22 14:45:29 alibrary
19 Introducing Riostream.h
21 Revision 1.27 2002/10/14 14:57:00 hristov
22 Merging the VirtualMC branch to the main development branch (HEAD)
24 Revision 1.23.4.2 2002/10/14 13:14:07 hristov
25 Updating VirtualMC to v3-09-02
27 Revision 1.26 2002/09/09 17:23:28 nilsen
28 Minor changes in support of changes to AliITSdigitS?D class'.
30 Revision 1.25 2002/05/10 22:29:40 nilsen
31 Change my Massimo Masera in the default constructor to bring things into
34 Revision 1.24 2002/04/24 22:02:31 nilsen
35 New SDigits and Digits routines, and related changes, (including new
40 #include <Riostream.h>
45 #include "AliITSClusterFinderSDD.h"
46 #include "AliITSMapA1.h"
48 #include "AliITSdigit.h"
49 #include "AliITSRawCluster.h"
50 #include "AliITSRecPoint.h"
51 #include "AliITSsegmentation.h"
52 #include "AliITSresponseSDD.h"
55 ClassImp(AliITSClusterFinderSDD)
57 //______________________________________________________________________
58 AliITSClusterFinderSDD::AliITSClusterFinderSDD(AliITSsegmentation *seg,
59 AliITSresponse *response,
62 // standard constructor
68 fNclusters = fClusters->GetEntriesFast();
72 SetMinPeak((Int_t)(((AliITSresponseSDD*)fResponse)->GetNoiseAfterElectronics()*5));
78 fMap = new AliITSMapA1(fSegmentation,fDigits,fCutAmplitude);
80 //______________________________________________________________________
81 AliITSClusterFinderSDD::AliITSClusterFinderSDD(){
82 // default constructor
101 SetMinPeak((Int_t)(((AliITSresponseSDD*)fResponse)->GetNoiseAfterElectronics()*5));
108 //____________________________________________________________________________
109 AliITSClusterFinderSDD::~AliITSClusterFinderSDD(){
112 if(fMap) delete fMap;
114 //______________________________________________________________________
115 void AliITSClusterFinderSDD::SetCutAmplitude(Float_t nsigma){
116 // set the signal threshold for cluster finder
117 Float_t baseline,noise,noise_after_el;
119 fResponse->GetNoiseParam(noise,baseline);
120 noise_after_el = ((AliITSresponseSDD*)fResponse)->GetNoiseAfterElectronics();
121 fCutAmplitude = (Int_t)((baseline + nsigma*noise_after_el));
123 //______________________________________________________________________
124 void AliITSClusterFinderSDD::Find1DClusters(){
126 static AliITS *iTS = (AliITS*)gAlice->GetModule("ITS");
128 // retrieve the parameters
129 Int_t fNofMaps = fSegmentation->Npz();
130 Int_t fMaxNofSamples = fSegmentation->Npx();
131 Int_t fNofAnodes = fNofMaps/2;
133 Float_t fTimeStep = fSegmentation->Dpx(dummy);
134 Float_t fSddLength = fSegmentation->Dx();
135 Float_t fDriftSpeed = fResponse->DriftSpeed();
136 Float_t anodePitch = fSegmentation->Dpz(dummy);
140 fMap->SetThreshold(fCutAmplitude);
145 fResponse->GetNoiseParam(noise,baseline);
147 Int_t nofFoundClusters = 0;
149 Float_t **dfadc = new Float_t*[fNofAnodes];
150 for(i=0;i<fNofAnodes;i++) dfadc[i] = new Float_t[fMaxNofSamples];
156 for(k=0;k<fNofAnodes;k++) {
157 idx = j*fNofAnodes+k;
158 // signal (fadc) & derivative (dfadc)
160 for(l=0; l<fMaxNofSamples; l++) {
161 fadc2=(Float_t)fMap->GetSignal(idx,l);
162 if(l>0) fadc1=(Float_t)fMap->GetSignal(idx,l-1);
163 if(l>0) dfadc[k][l-1] = fadc2-fadc1;
167 for(k=0;k<fNofAnodes;k++) {
168 //cout << "Anode: " << k+1 << ", Wing: " << j+1 << endl;
169 idx = j*fNofAnodes+k;
173 while(it <= fMaxNofSamples-3) {
177 Float_t fadcmax = 0.;
178 Float_t dfadcmax = 0.;
185 if(id>=fMaxNofSamples) break;
186 fadc=(float)fMap->GetSignal(idx,id);
187 if(fadc > fadcmax) { fadcmax = fadc; imax = id;}
188 if(fadc > (float)fCutAmplitude) {
191 if(dfadc[k][id] > dfadcmax) {
192 dfadcmax = dfadc[k][id];
197 if(fMap->TestHit(idx,imax) == kEmpty) {it++; continue;}
200 if(tstart < 0) tstart = 0;
202 if(lthrt >= lthrmint && lthra >= lthrmina) ilcl = 1;
205 Int_t tstop = tstart;
206 Float_t dfadcmin = 10000.;
208 for(ij=0; ij<20; ij++) {
209 if(tstart+ij > 255) { tstop = 255; break; }
210 fadc=(float)fMap->GetSignal(idx,tstart+ij);
211 if((dfadc[k][tstart+ij] < dfadcmin) &&
212 (fadc > fCutAmplitude)) {
214 if(tstop > 255) tstop = 255;
215 dfadcmin = dfadc[k][it+ij];
219 Float_t clusterCharge = 0.;
220 Float_t clusterAnode = k+0.5;
221 Float_t clusterTime = 0.;
222 Int_t clusterMult = 0;
223 Float_t clusterPeakAmplitude = 0.;
224 Int_t its,peakpos = -1;
226 fResponse->GetNoiseParam(n,baseline);
227 for(its=tstart; its<=tstop; its++) {
228 fadc=(float)fMap->GetSignal(idx,its);
229 if(fadc>baseline) fadc -= baseline;
231 clusterCharge += fadc;
232 // as a matter of fact we should take the peak
234 // to get the list of tracks !!!
235 if(fadc > clusterPeakAmplitude) {
236 clusterPeakAmplitude = fadc;
237 //peakpos=fMap->GetHitIndex(idx,its);
238 Int_t shift = (int)(fTimeCorr/fTimeStep);
239 if(its>shift && its<(fMaxNofSamples-shift))
240 peakpos = fMap->GetHitIndex(idx,its+shift);
241 else peakpos = fMap->GetHitIndex(idx,its);
242 if(peakpos<0) peakpos =fMap->GetHitIndex(idx,its);
244 clusterTime += fadc*its;
245 if(fadc > 0) clusterMult++;
247 clusterTime /= (clusterCharge/fTimeStep); // ns
248 if(clusterTime>fTimeCorr) clusterTime -=fTimeCorr;
253 Float_t clusteranodePath = (clusterAnode - fNofAnodes/2)*
255 Float_t clusterDriftPath = clusterTime*fDriftSpeed;
256 clusterDriftPath = fSddLength-clusterDriftPath;
257 if(clusterCharge <= 0.) break;
258 AliITSRawClusterSDD clust(j+1,//i
259 clusterAnode,clusterTime,//ff
261 clusterPeakAmplitude, //f
263 0.,0.,clusterDriftPath,//fff
264 clusteranodePath, //f
267 iTS->AddCluster(1,&clust);
275 for(i=0;i<fNofAnodes;i++) delete[] dfadc[i];
283 //______________________________________________________________________
284 void AliITSClusterFinderSDD::Find1DClustersE(){
286 static AliITS *iTS=(AliITS*)gAlice->GetModule("ITS");
287 // retrieve the parameters
288 Int_t fNofMaps = fSegmentation->Npz();
289 Int_t fMaxNofSamples = fSegmentation->Npx();
290 Int_t fNofAnodes = fNofMaps/2;
292 Float_t fTimeStep = fSegmentation->Dpx( dummy );
293 Float_t fSddLength = fSegmentation->Dx();
294 Float_t fDriftSpeed = fResponse->DriftSpeed();
295 Float_t anodePitch = fSegmentation->Dpz( dummy );
297 fResponse->GetNoiseParam( n, baseline );
300 fMap->SetThreshold( fCutAmplitude );
304 // cout << "Search cluster... "<< endl;
305 for( Int_t j=0; j<2; j++ ){
306 for( Int_t k=0; k<fNofAnodes; k++ ){
307 Int_t idx = j*fNofAnodes+k;
315 Float_t anode = k+0.5;
317 for( Int_t l=0; l<fMaxNofSamples; l++ ){
318 Float_t fadc = (Float_t)fMap->GetSignal( idx, l );
320 if( on == kFALSE && l<fMaxNofSamples-4){
321 // star RawCluster (reset var.)
322 Float_t fadc1 = (Float_t)fMap->GetSignal( idx, l+1 );
323 if( fadc1 < fadc ) continue;
333 if( fadc > baseline ) fadc -= baseline;
340 Int_t shift = (Int_t)(fTimeCorr/fTimeStep + 0.5);
341 if( l > shift && l < (fMaxNofSamples-shift) )
342 peakpos = fMap->GetHitIndex( idx, l+shift );
344 peakpos = fMap->GetHitIndex( idx, l );
345 if( peakpos < 0) peakpos = fMap->GetHitIndex( idx, l );
350 // min # of timesteps for a RawCluster
351 // Found a RawCluster...
353 time /= (charge/fTimeStep); // ns
354 // time = lmax*fTimeStep; // ns
355 if( time > fTimeCorr ) time -= fTimeCorr; // ns
356 Float_t anodePath = (anode - fNofAnodes/2)*anodePitch;
357 Float_t driftPath = time*fDriftSpeed;
358 driftPath = fSddLength-driftPath;
359 AliITSRawClusterSDD clust(j+1,anode,time,charge,
363 start, stop, 1, k, k );
364 iTS->AddCluster( 1, &clust );
365 // clust.PrintInfo();
369 } // end if on==kTRUE
374 // cout << "# Rawclusters " << nClu << endl;
377 //_______________________________________________________________________
378 Int_t AliITSClusterFinderSDD::SearchPeak(Float_t *spect,Int_t xdim,Int_t zdim,
379 Int_t *peakX, Int_t *peakZ,
380 Float_t *peakAmp, Float_t minpeak ){
381 // search peaks on a 2D cluster
382 Int_t npeak = 0; // # peaks
385 for( Int_t z=1; z<zdim-1; z++ ){
386 for( Int_t x=1; x<xdim-2; x++ ){
387 Float_t sxz = spect[x*zdim+z];
388 Float_t sxz1 = spect[(x+1)*zdim+z];
389 Float_t sxz2 = spect[(x-1)*zdim+z];
390 // search a local max. in s[x,z]
391 if( sxz < minpeak || sxz1 <= 0 || sxz2 <= 0 ) continue;
392 if( sxz >= spect[(x+1)*zdim+z ] && sxz >= spect[(x-1)*zdim+z ] &&
393 sxz >= spect[x*zdim +z+1] && sxz >= spect[x*zdim +z-1] &&
394 sxz >= spect[(x+1)*zdim+z+1] && sxz >= spect[(x+1)*zdim+z-1] &&
395 sxz >= spect[(x-1)*zdim+z+1] && sxz >= spect[(x-1)*zdim+z-1] ){
399 peakAmp[npeak] = sxz;
404 // search groups of peaks with same amplitude.
405 Int_t *flag = new Int_t[npeak];
406 for( i=0; i<npeak; i++ ) flag[i] = 0;
407 for( i=0; i<npeak; i++ ){
408 for( j=0; j<npeak; j++ ){
410 if( flag[j] > 0 ) continue;
411 if( peakAmp[i] == peakAmp[j] &&
412 TMath::Abs(peakX[i]-peakX[j])<=1 &&
413 TMath::Abs(peakZ[i]-peakZ[j])<=1 ){
414 if( flag[i] == 0) flag[i] = i+1;
419 // make average of peak groups
420 for( i=0; i<npeak; i++ ){
422 if( flag[i] <= 0 ) continue;
423 for( j=0; j<npeak; j++ ){
425 if( flag[j] != flag[i] ) continue;
426 peakX[i] += peakX[j];
427 peakZ[i] += peakZ[j];
430 for( Int_t k=j; k<npeak; k++ ){
431 peakX[k] = peakX[k+1];
432 peakZ[k] = peakZ[k+1];
433 peakAmp[k] = peakAmp[k+1];
446 //______________________________________________________________________
447 void AliITSClusterFinderSDD::PeakFunc( Int_t xdim, Int_t zdim, Float_t *par,
448 Float_t *spe, Float_t *integral){
449 // function used to fit the clusters
450 // par -> parameters..
451 // par[0] number of peaks.
452 // for each peak i=1, ..., par[0]
458 Int_t electronics = fResponse->Electronics(); // 1 = PASCAL, 2 = OLA
459 const Int_t knParam = 5;
460 Int_t npeak = (Int_t)par[0];
462 memset( spe, 0, sizeof( Float_t )*zdim*xdim );
465 for( Int_t i=0; i<npeak; i++ ){
466 if( integral != 0 ) integral[i] = 0.;
467 Float_t sigmaA2 = par[k+4]*par[k+4]*2.;
468 Float_t T2 = par[k+3]; // PASCAL
469 if( electronics == 2 ) { T2 *= T2; T2 *= 2; } // OLA
470 for( Int_t z=0; z<zdim; z++ ){
471 for( Int_t x=0; x<xdim; x++ ){
472 Float_t z2 = (z-par[k+2])*(z-par[k+2])/sigmaA2;
475 if( electronics == 1 ){ // PASCAL
476 x2 = (x-par[k+1]+T2)/T2;
477 signal = (x2>0.) ? par[k]*x2*exp(-x2+1.-z2) :0.0; // RCCR2
478 // signal =(x2>0.) ? par[k]*x2*x2*exp(-2*x2+2.-z2 ):0.0;//RCCR
479 }else if( electronics == 2 ) { // OLA
480 x2 = (x-par[k+1])*(x-par[k+1])/T2;
481 signal = par[k] * exp( -x2 - z2 );
483 cout << "Wrong SDD Electronics =" << electronics << endl;
485 } // end if electronicx
486 spe[x*zdim+z] += signal;
487 if( integral != 0 ) integral[i] += signal;
494 //__________________________________________________________________________
495 Float_t AliITSClusterFinderSDD::ChiSqr( Int_t xdim, Int_t zdim, Float_t *spe,
497 // EVALUATES UNNORMALIZED CHI-SQUARED
499 for( Int_t z=0; z<zdim; z++ ){
500 for( Int_t x=1; x<xdim-1; x++ ){
501 Int_t index = x*zdim+z;
502 Float_t tmp = spe[index] - speFit[index];
508 //_______________________________________________________________________
509 void AliITSClusterFinderSDD::Minim( Int_t xdim, Int_t zdim, Float_t *param,
510 Float_t *prm0,Float_t *steprm,
511 Float_t *chisqr,Float_t *spe,
514 Int_t k, nnn, mmm, i;
515 Float_t p1, delta, d1, chisq1, p2, chisq2, t, p3, chisq3, a, b, p0, chisqt;
516 const Int_t knParam = 5;
517 Int_t npeak = (Int_t)param[0];
518 for( k=1; k<(npeak*knParam+1); k++ ) prm0[k] = param[k];
519 for( k=1; k<(npeak*knParam+1); k++ ){
523 // ENSURE THAT STEP SIZE IS SENSIBLY LARGER THAN MACHINE ROUND OFF
524 if( fabs( p1 ) > 1.0E-6 )
525 if ( fabs( delta/p1 ) < 1.0E-4 ) delta = p1/1000;
526 else delta = (Float_t)1.0E-4;
527 // EVALUATE CHI-SQUARED AT FIRST TWO SEARCH POINTS
528 PeakFunc( xdim, zdim, param, speFit );
529 chisq1 = ChiSqr( xdim, zdim, spe, speFit );
532 PeakFunc( xdim, zdim, param, speFit );
533 chisq2 = ChiSqr( xdim, zdim, spe, speFit );
534 if( chisq1 < chisq2 ){
535 // REVERSE DIRECTION OF SEARCH IF CHI-SQUARED IS INCREASING
545 do { // INCREMENT param(K) UNTIL CHI-SQUARED STARTS TO INCREASE
548 mmm = nnn - (nnn/5)*5; // multiplo de 5
551 // INCREASE STEP SIZE IF STEPPING TOWARDS MINIMUM IS TOO SLOW
555 // Constrain paramiters
556 Int_t kpos = (k-1) % knParam;
559 if( param[k] <= 20 ) param[k] = fMinPeak;
562 if( fabs( param[k] - prm0[k] ) > 1.5 ) param[k] = prm0[k];
565 if( fabs( param[k] - prm0[k] ) > 1. ) param[k] = prm0[k];
568 if( param[k] < .5 ) param[k] = .5;
571 if( param[k] < .288 ) param[k] = .288; // 1/sqrt(12) = 0.288
572 if( param[k] > zdim*.5 ) param[k] = zdim*.5;
575 PeakFunc( xdim, zdim, param, speFit );
576 chisq3 = ChiSqr( xdim, zdim, spe, speFit );
577 if( chisq3 < chisq2 && nnn < 50 ){
584 // FIND MINIMUM OF PARABOLA DEFINED BY LAST THREE POINTS
585 a = chisq1*(p2-p3)+chisq2*(p3-p1)+chisq3*(p1-p2);
586 b = chisq1*(p2*p2-p3*p3)+chisq2*(p3*p3-p1*p1)+chisq3*(p1*p1-p2*p2);
587 if( a!=0 ) p0 = (Float_t)(0.5*b/a);
589 //--IN CASE OF NEARLY EQUAL CHI-SQUARED AND TOO SMALL STEP SIZE PREVENT
590 // ERRONEOUS EVALUATION OF PARABOLA MINIMUM
591 //---NEXT TWO LINES CAN BE OMITTED FOR HIGHER PRECISION MACHINES
592 //dp = (Float_t) max (fabs(p3-p2), fabs(p2-p1));
593 //if( fabs( p2-p0 ) > dp ) p0 = p2;
595 // Constrain paramiters
596 Int_t kpos = (k-1) % knParam;
599 if( param[k] <= 20 ) param[k] = fMinPeak;
602 if( fabs( param[k] - prm0[k] ) > 1.5 ) param[k] = prm0[k];
605 if( fabs( param[k] - prm0[k] ) > 1. ) param[k] = prm0[k];
608 if( param[k] < .5 ) param[k] = .5;
611 if( param[k] < .288 ) param[k] = .288; // 1/sqrt(12) = 0.288
612 if( param[k] > zdim*.5 ) param[k] = zdim*.5;
615 PeakFunc( xdim, zdim, param, speFit );
616 chisqt = ChiSqr( xdim, zdim, spe, speFit );
617 // DO NOT ALLOW ERRONEOUS INTERPOLATION
618 if( chisqt <= *chisqr ) *chisqr = chisqt;
619 else param[k] = prm0[k];
620 // OPTIMIZE SEARCH STEP FOR EVENTUAL NEXT CALL OF MINIM
621 steprm[k] = (param[k]-prm0[k])/5;
622 if( steprm[k] >= d1 ) steprm[k] = d1/5;
624 // EVALUATE FIT AND CHI-SQUARED FOR OPTIMIZED PARAMETERS
625 PeakFunc( xdim, zdim, param, speFit );
626 *chisqr = ChiSqr( xdim, zdim, spe, speFit );
629 //_________________________________________________________________________
630 Int_t AliITSClusterFinderSDD::NoLinearFit( Int_t xdim, Int_t zdim,
631 Float_t *param, Float_t *spe,
632 Int_t *niter, Float_t *chir ){
633 // fit method from Comput. Phys. Commun 46(1987) 149
634 const Float_t kchilmt = 0.01; // relative accuracy
635 const Int_t knel = 3; // for parabolic minimization
636 const Int_t knstop = 50; // Max. iteration number
637 const Int_t knParam = 5;
638 Int_t npeak = (Int_t)param[0];
639 // RETURN IF NUMBER OF DEGREES OF FREEDOM IS NOT POSITIVE
640 if( (xdim*zdim - npeak*knParam) <= 0 ) return( -1 );
641 Float_t degFree = (xdim*zdim - npeak*knParam)-1;
642 Int_t n, k, iterNum = 0;
643 Float_t *prm0 = new Float_t[npeak*knParam+1];
644 Float_t *step = new Float_t[npeak*knParam+1];
645 Float_t *schi = new Float_t[npeak*knParam+1];
647 sprm[0] = new Float_t[npeak*knParam+1];
648 sprm[1] = new Float_t[npeak*knParam+1];
649 sprm[2] = new Float_t[npeak*knParam+1];
650 Float_t chi0, chi1, reldif, a, b, prmin, dp;
651 Float_t *speFit = new Float_t[ xdim*zdim ];
652 PeakFunc( xdim, zdim, param, speFit );
653 chi0 = ChiSqr( xdim, zdim, spe, speFit );
655 for( k=1; k<(npeak*knParam+1); k++) prm0[k] = param[k];
656 for( k=1 ; k<(npeak*knParam+1); k+=knParam ){
657 step[k] = param[k] / 20.0 ;
658 step[k+1] = param[k+1] / 50.0;
659 step[k+2] = param[k+2] / 50.0;
660 step[k+3] = param[k+3] / 20.0;
661 step[k+4] = param[k+4] / 20.0;
667 Minim( xdim, zdim, param, prm0, step, &chi1, spe, speFit );
668 reldif = ( chi1 > 0 ) ? ((Float_t) fabs( chi1-chi0)/chi1 ) : 0;
670 if( reldif < (float) kchilmt ){
671 *chir = (chi1>0) ? (float) TMath::Sqrt (chi1/degFree) :0;
676 if( (reldif < (float)(5*kchilmt)) && (iterNum > knstop) ){
677 *chir = (chi1>0) ?(float) TMath::Sqrt (chi1/degFree):0;
682 if( iterNum > 5*knstop ){
683 *chir = (chi1>0) ?(float) TMath::Sqrt (chi1/degFree):0;
688 if( iterNum <= knel ) continue;
689 n = iterNum - (iterNum/knel)*knel; // EXTRAPOLATION LIMIT COUNTER N
690 if( n > 3 || n == 0 ) continue;
692 for( k=1; k<(npeak*knParam+1); k++ ) sprm[n-1][k] = param[k];
693 if( n != 3 ) continue;
694 // -EVALUATE EXTRAPOLATED VALUE OF EACH PARAMETER BY FINDING MINIMUM OF
695 // PARABOLA DEFINED BY LAST THREE CALLS OF MINIM
696 for( k=1; k<(npeak*knParam+1); k++ ){
697 Float_t tmp0 = sprm[0][k];
698 Float_t tmp1 = sprm[1][k];
699 Float_t tmp2 = sprm[2][k];
700 a = schi[0]*(tmp1-tmp2) + schi[1]*(tmp2-tmp0);
701 a += (schi[2]*(tmp0-tmp1));
702 b = schi[0]*(tmp1*tmp1-tmp2*tmp2);
703 b += (schi[1]*(tmp2*tmp2-tmp0*tmp0)+(schi[2]*
704 (tmp0*tmp0-tmp1*tmp1)));
705 if ((double)a < 1.0E-6) prmin = 0;
706 else prmin = (float) (0.5*b/a);
708 if( fabs(prmin-tmp2) > fabs(dp) ) prmin = tmp2+dp;
710 step[k] = dp/10; // OPTIMIZE SEARCH STEP
723 //______________________________________________________________________
724 void AliITSClusterFinderSDD::ResolveClustersE(){
725 // The function to resolve clusters if the clusters overlapping exists
727 static AliITS *iTS = (AliITS*)gAlice->GetModule( "ITS" );
728 // get number of clusters for this module
729 Int_t nofClusters = fClusters->GetEntriesFast();
730 nofClusters -= fNclusters;
731 Int_t fNofMaps = fSegmentation->Npz();
732 Int_t fNofAnodes = fNofMaps/2;
733 Int_t fMaxNofSamples = fSegmentation->Npx();
735 Double_t fTimeStep = fSegmentation->Dpx( dummy );
736 Double_t fSddLength = fSegmentation->Dx();
737 Double_t fDriftSpeed = fResponse->DriftSpeed();
738 Double_t anodePitch = fSegmentation->Dpz( dummy );
740 fResponse->GetNoiseParam( n, baseline );
741 Int_t electronics = fResponse->Electronics(); // 1 = PASCAL, 2 = OLA
743 for( Int_t j=0; j<nofClusters; j++ ){
744 // get cluster information
745 AliITSRawClusterSDD *clusterJ=(AliITSRawClusterSDD*) fClusters->At(j);
746 Int_t astart = clusterJ->Astart();
747 Int_t astop = clusterJ->Astop();
748 Int_t tstart = clusterJ->Tstartf();
749 Int_t tstop = clusterJ->Tstopf();
750 Int_t wing = (Int_t)clusterJ->W();
752 astart += fNofAnodes;
755 Int_t xdim = tstop-tstart+3;
756 Int_t zdim = astop-astart+3;
757 if(xdim > 50 || zdim > 30) { cout << "Warning: xdim: " << xdim << ", zdim: " << zdim << endl; continue; }
758 Float_t *sp = new Float_t[ xdim*zdim+1 ];
759 memset( sp, 0, sizeof(Float_t)*(xdim*zdim+1) );
761 // make a local map from cluster region
762 for( Int_t ianode=astart; ianode<=astop; ianode++ ){
763 for( Int_t itime=tstart; itime<=tstop; itime++ ){
764 Float_t fadc = fMap->GetSignal( ianode, itime );
765 if( fadc > baseline ) fadc -= (Double_t)baseline;
767 Int_t index = (itime-tstart+1)*zdim+(ianode-astart+1);
772 // search peaks on cluster
773 const Int_t kNp = 150;
776 Float_t peakAmp1[kNp];
777 Int_t npeak = SearchPeak(sp,xdim,zdim,peakX1,peakZ1,peakAmp1,fMinPeak);
779 // if multiple peaks, split cluster
782 // cout << "npeak " << npeak << endl;
783 // clusterJ->PrintInfo();
784 Float_t *par = new Float_t[npeak*5+1];
785 par[0] = (Float_t)npeak;
786 // Initial parameters in cell dimentions
788 for( i=0; i<npeak; i++ ){
789 par[k1] = peakAmp1[i];
790 par[k1+1] = peakX1[i]; // local time pos. [timebin]
791 par[k1+2] = peakZ1[i]; // local anode pos. [anodepitch]
792 if( electronics == 1 )
793 par[k1+3] = 2.; // PASCAL
794 else if( electronics == 2 )
795 par[k1+3] = 0.7; // tau [timebin] OLA
796 par[k1+4] = .4; // sigma [anodepich]
801 NoLinearFit( xdim, zdim, par, sp, &niter, &chir );
806 Float_t peakAmp[kNp];
807 Float_t integral[kNp];
808 //get integrals => charge for each peak
809 PeakFunc( xdim, zdim, par, sp, integral );
811 for( i=0; i<npeak; i++ ){
812 peakAmp[i] = par[k1];
813 peakX[i] = par[k1+1];
814 peakZ[i] = par[k1+2];
816 sigma[i] = par[k1+4];
819 // calculate parameter for new clusters
820 for( i=0; i<npeak; i++ ){
821 AliITSRawClusterSDD clusterI( *clusterJ );
822 Int_t newAnode = peakZ1[i]-1 + astart;
823 Int_t newiTime = peakX1[i]-1 + tstart;
824 Int_t shift = (Int_t)(fTimeCorr/fTimeStep + 0.5);
825 if( newiTime > shift && newiTime < (fMaxNofSamples-shift) )
827 Int_t peakpos = fMap->GetHitIndex( newAnode, newiTime+shift );
828 clusterI.SetPeakPos( peakpos );
829 clusterI.SetPeakAmpl( peakAmp1[i] );
830 Float_t newAnodef = peakZ[i] - 0.5 + astart;
831 Float_t newiTimef = peakX[i] - 1 + tstart;
832 if( wing == 2 ) newAnodef -= fNofAnodes;
833 Float_t anodePath = (newAnodef - fNofAnodes/2)*anodePitch;
834 newiTimef *= fTimeStep;
835 if( newiTimef > fTimeCorr ) newiTimef -= fTimeCorr;
836 if( electronics == 1 ){
837 // newiTimef *= 0.999438; // PASCAL
838 // newiTimef += (6./fDriftSpeed - newiTimef/3000.);
839 }else if( electronics == 2 )
840 newiTimef *= 0.99714; // OLA
841 Float_t driftPath = fSddLength - newiTimef * fDriftSpeed;
842 Float_t sign = ( wing == 1 ) ? -1. : 1.;
843 clusterI.SetX( driftPath*sign * 0.0001 );
844 clusterI.SetZ( anodePath * 0.0001 );
845 clusterI.SetAnode( newAnodef );
846 clusterI.SetTime( newiTimef );
847 clusterI.SetAsigma( sigma[i]*anodePitch );
848 clusterI.SetTsigma( tau[i]*fTimeStep );
849 clusterI.SetQ( integral[i] );
850 // clusterI.PrintInfo();
851 iTS->AddCluster( 1, &clusterI );
853 fClusters->RemoveAt( j );
855 } else { // something odd
856 cout << " --- Peak not found!!!! minpeak=" << fMinPeak<<
857 " cluster peak=" << clusterJ->PeakAmpl() <<
858 " module=" << fModule << endl;
859 clusterJ->PrintInfo();
860 cout << " xdim=" << xdim-2 << " zdim=" << zdim-2 << endl << endl;
864 fClusters->Compress();
869 //________________________________________________________________________
870 void AliITSClusterFinderSDD::GroupClusters(){
873 Float_t fTimeStep = fSegmentation->Dpx(dummy);
874 // get number of clusters for this module
875 Int_t nofClusters = fClusters->GetEntriesFast();
876 nofClusters -= fNclusters;
877 AliITSRawClusterSDD *clusterI;
878 AliITSRawClusterSDD *clusterJ;
879 Int_t *label = new Int_t [nofClusters];
881 for(i=0; i<nofClusters; i++) label[i] = 0;
882 for(i=0; i<nofClusters; i++) {
883 if(label[i] != 0) continue;
884 for(j=i+1; j<nofClusters; j++) {
885 if(label[j] != 0) continue;
886 clusterI = (AliITSRawClusterSDD*) fClusters->At(i);
887 clusterJ = (AliITSRawClusterSDD*) fClusters->At(j);
889 if(clusterI->T() < fTimeStep*60) fDAnode = 4.2; // TB 3.2
890 if(clusterI->T() < fTimeStep*10) fDAnode = 1.5; // TB 1.
891 Bool_t pair = clusterI->Brother(clusterJ,fDAnode,fDTime);
893 // clusterI->PrintInfo();
894 // clusterJ->PrintInfo();
895 clusterI->Add(clusterJ);
897 fClusters->RemoveAt(j);
902 fClusters->Compress();
907 //________________________________________________________________________
908 void AliITSClusterFinderSDD::SelectClusters(){
909 // get number of clusters for this module
910 Int_t nofClusters = fClusters->GetEntriesFast();
912 nofClusters -= fNclusters;
914 for(i=0; i<nofClusters; i++) {
915 AliITSRawClusterSDD *clusterI =(AliITSRawClusterSDD*) fClusters->At(i);
918 if(clusterI->Anodes() != 0.) {
919 wy = ((Float_t) clusterI->Samples())/clusterI->Anodes();
921 Int_t amp = (Int_t) clusterI->PeakAmpl();
922 Int_t cha = (Int_t) clusterI->Q();
923 if(amp < fMinPeak) rmflg = 1;
924 if(cha < fMinCharge) rmflg = 1;
925 if(wy < fMinNCells) rmflg = 1;
926 //if(wy > fMaxNCells) rmflg = 1;
927 if(rmflg) fClusters->RemoveAt(i);
929 fClusters->Compress();
932 //__________________________________________________________________________
933 void AliITSClusterFinderSDD::ResolveClusters(){
934 // The function to resolve clusters if the clusters overlapping exists
935 /* AliITS *iTS=(AliITS*)gAlice->GetModule("ITS");
936 // get number of clusters for this module
937 Int_t nofClusters = fClusters->GetEntriesFast();
938 nofClusters -= fNclusters;
939 //cout<<"Resolve Cl: nofClusters, fNclusters ="<<nofClusters<<","
940 // <<fNclusters<<endl;
941 Int_t fNofMaps = fSegmentation->Npz();
942 Int_t fNofAnodes = fNofMaps/2;
944 Double_t fTimeStep = fSegmentation->Dpx(dummy);
945 Double_t fSddLength = fSegmentation->Dx();
946 Double_t fDriftSpeed = fResponse->DriftSpeed();
947 Double_t anodePitch = fSegmentation->Dpz(dummy);
949 fResponse->GetNoiseParam(n,baseline);
950 Float_t dzz_1A = anodePitch * anodePitch / 12;
951 // fill Map of signals
953 Int_t j,i,ii,ianode,anode,itime;
954 Int_t wing,astart,astop,tstart,tstop,nanode;
955 Double_t fadc,ClusterTime;
956 Double_t q[400],x[400],z[400]; // digit charges and coordinates
957 for(j=0; j<nofClusters; j++) {
958 AliITSRawClusterSDD *clusterJ=(AliITSRawClusterSDD*) fClusters->At(j);
960 astart=clusterJ->Astart();
961 astop=clusterJ->Astop();
962 tstart=clusterJ->Tstartf();
963 tstop=clusterJ->Tstopf();
964 nanode=clusterJ->Anodes(); // <- Ernesto
965 wing=(Int_t)clusterJ->W();
967 astart += fNofAnodes;
970 // cout<<"astart,astop,tstart,tstop ="<<astart<<","<<astop<<","
971 // <<tstart<<","<<tstop<<endl;
972 // clear the digit arrays
973 for(ii=0; ii<400; ii++) {
979 for(ianode=astart; ianode<=astop; ianode++) {
980 for(itime=tstart; itime<=tstop; itime++) {
981 fadc=fMap->GetSignal(ianode,itime);
983 fadc-=(Double_t)baseline;
984 q[ndigits] = fadc*(fTimeStep/160); // KeV
986 if(wing == 2) anode -= fNofAnodes;
987 z[ndigits] = (anode + 0.5 - fNofAnodes/2)*anodePitch;
988 ClusterTime = itime*fTimeStep;
989 if(ClusterTime > fTimeCorr) ClusterTime -= fTimeCorr;// ns
990 x[ndigits] = fSddLength - ClusterTime*fDriftSpeed;
991 if(wing == 1) x[ndigits] *= (-1);
992 // cout<<"ianode,itime,fadc ="<<ianode<<","<<itime<<","
994 // cout<<"wing,anode,ndigits,charge ="<<wing<<","
995 // <<anode<<","<<ndigits<<","<<q[ndigits]<<endl;
1000 // cout<<"fadc=0, ndigits ="<<ndigits<<endl;
1003 // cout<<"for new cluster ndigits ="<<ndigits<<endl;
1004 // Fit cluster to resolve for two separate ones --------------------
1005 Double_t qq=0., xm=0., zm=0., xx=0., zz=0., xz=0.;
1006 Double_t dxx=0., dzz=0., dxz=0.;
1007 Double_t scl = 0., tmp, tga, elps = -1.;
1008 Double_t xfit[2], zfit[2], qfit[2];
1009 Double_t pitchz = anodePitch*1.e-4; // cm
1010 Double_t pitchx = fTimeStep*fDriftSpeed*1.e-4; // cm
1013 Int_t nbins = ndigits;
1015 // now, all lengths are in microns
1016 for (ii=0; ii<nbins; ii++) {
1020 xx += x[ii]*x[ii]*q[ii];
1021 zz += z[ii]*z[ii]*q[ii];
1022 xz += x[ii]*z[ii]*q[ii];
1033 // shrink the cluster in the time direction proportionaly to the
1034 // dxx/dzz, which lineary depends from the drift path
1035 // new Ernesto........
1037 dzz = dzz_1A; // for one anode cluster dzz = anode**2/12
1038 scl = TMath::Sqrt( 7.2/(-0.57*xm*1.e-3+71.8) );
1041 scl = TMath::Sqrt( (-0.18*xm*1.e-3+21.3)/(-0.57*xm*1.e-3+71.8) );
1044 scl = TMath::Sqrt( (-0.5*xm*1.e-3+34.5)/(-0.57*xm*1.e-3+71.8) );
1047 scl = TMath::Sqrt( (1.3*xm*1.e-3+49.)/(-0.57*xm*1.e-3+71.8) );
1049 // cout<<"1 microns: zm,dzz,xm,dxx,dxz,qq ="<<zm<<","<<dzz<<","
1050 // <<xm<<","<<dxx<<","<<dxz<<","<<qq<<endl;
1051 // old Boris.........
1052 // tmp=29730. - 585.*fabs(xm/1000.);
1053 // scl=TMath::Sqrt(tmp/130000.);
1060 // dzz = zz - zm*zm;
1062 // cout<<"microns: zm,dzz,xm,dxx,xz,dxz,qq ="<<zm<<","<<dzz<<","
1063 // <<xm<<","<<dxx<<","<<xz<<","<<dxz<<","<<qq<<endl;
1064 // if(dzz < 7200.) dzz=7200.;//for one anode cluster dzz = anode**2/12
1066 if (dxx < 0.) dxx=0.;
1067 // the data if no cluster overlapping (the coordunates are in cm)
1072 // if(nbins < 7) cout<<"**** nbins ="<<nbins<<endl;
1075 if (dxz==0.) tga=0.;
1077 tmp=0.5*(dzz-dxx)/dxz;
1078 tga = (dxz<0.) ? tmp-TMath::Sqrt(tmp*tmp+1) :
1079 tmp+TMath::Sqrt(tmp*tmp+1);
1081 elps=(tga*tga*dxx-2*tga*dxz+dzz)/(dxx+2*tga*dxz+tga*tga*dzz);
1082 // change from microns to cm
1091 // cout<<"cm: zm,dzz,xm,dxx,xz,dxz,qq ="<<zm<<","<<dzz<<","
1092 // <<xm<<","<<dxx<<","<<xz<<","<<dxz<<","<<qq<<endl;
1093 for (i=0; i<nbins; i++) {
1095 x[i] = x[i] *= 1.e-4;
1096 z[i] = z[i] *= 1.e-4;
1098 // cout<<"!!! elps ="<<elps<<endl;
1099 if (elps < 0.3) { // try to separate hits
1102 Double_t cosa=cos(tmp),sina=sin(tmp);
1103 Double_t a1=0., x1=0., xxx=0.;
1104 for (i=0; i<nbins; i++) {
1105 tmp=x[i]*cosa + z[i]*sina;
1110 xxx += tmp*tmp*tmp*q[i];
1113 Double_t z12=-sina*xm + cosa*zm;
1114 sigma2=(sina*sina*xx-2*cosa*sina*xz+cosa*cosa*zz) - z12*z12;
1115 xm=cosa*xm + sina*zm;
1116 xx=cosa*cosa*xx + 2*cosa*sina*xz + sina*sina*zz;
1117 Double_t x2=(xx - xm*x1 - sigma2)/(xm - x1);
1118 Double_t r=a1*2*TMath::ACos(-1.)*sigma2/(qq*pitchx*pitchz);
1119 for (i=0; i<33; i++) { // solve a system of equations
1120 Double_t x1_old=x1, x2_old=x2, r_old=r;
1124 Double_t c21=x1*x1 - x2*x2;
1125 Double_t c22=2*r*x1;
1126 Double_t c23=2*(1-r)*x2;
1127 Double_t c31=3*sigma2*(x1-x2) + x1*x1*x1 - x2*x2*x2;
1128 Double_t c32=3*r*(sigma2 + x1*x1);
1129 Double_t c33=3*(1-r)*(sigma2 + x2*x2);
1130 Double_t f1=-(r*x1 + (1-r)*x2 - xm);
1131 Double_t f2=-(r*(sigma2+x1*x1)+(1-r)*(sigma2+x2*x2)- xx);
1132 Double_t f3=-(r*x1*(3*sigma2+x1*x1)+(1-r)*x2*
1133 (3*sigma2+x2*x2)-xxx);
1134 Double_t d=c11*c22*c33+c21*c32*c13+c12*c23*c31-
1135 c31*c22*c13 - c21*c12*c33 - c32*c23*c11;
1137 cout<<"*********** d=0 ***********\n";
1140 Double_t dr=f1*c22*c33 + f2*c32*c13 + c12*c23*f3 -
1141 f3*c22*c13 - f2*c12*c33 - c32*c23*f1;
1142 Double_t d1=c11*f2*c33 + c21*f3*c13 + f1*c23*c31 -
1143 c31*f2*c13 - c21*f1*c33 - f3*c23*c11;
1144 Double_t d2=c11*c22*f3 + c21*c32*f1 + c12*f2*c31 -
1145 c31*c22*f1 - c21*c12*f3 - c32*f2*c11;
1149 if (fabs(x1-x1_old) > 0.0001) continue;
1150 if (fabs(x2-x2_old) > 0.0001) continue;
1151 if (fabs(r-r_old)/5 > 0.001) continue;
1152 a1=r*qq*pitchx*pitchz/(2*TMath::ACos(-1.)*sigma2);
1153 Double_t a2=a1*(1-r)/r;
1154 qfit[0]=a1; xfit[0]=x1*cosa - z12*sina; zfit[0]=x1*sina +
1156 qfit[1]=a2; xfit[1]=x2*cosa - z12*sina; zfit[1]=x2*sina +
1161 if (i==33) cerr<<"No more iterations ! "<<endl;
1162 } // end of attempt to separate overlapped clusters
1163 } // end of nbins cut
1164 if(elps < 0.) cout<<" elps=-1 ="<<elps<<endl;
1165 if(elps >0. && elps< 0.3 && nfhits == 1) cout<<" small elps, nfh=1 ="
1166 <<elps<<","<<nfhits<<endl;
1167 if(nfhits == 2) cout<<" nfhits=2 ="<<nfhits<<endl;
1168 for (i=0; i<nfhits; i++) {
1169 xfit[i] *= (1.e+4/scl);
1170 if(wing == 1) xfit[i] *= (-1);
1172 // cout<<" --------- i,xfiti,zfiti,qfiti ="<<i<<","
1173 // <<xfit[i]<<","<<zfit[i]<<","<<qfit[i]<<endl;
1176 if(nfhits == 1 && separate == 1) {
1177 cout<<"!!!!! no separate"<<endl;
1181 cout << "Split cluster: " << endl;
1182 clusterJ->PrintInfo();
1183 cout << " in: " << endl;
1184 for (i=0; i<nfhits; i++) {
1185 // AliITSRawClusterSDD *clust = new AliITSRawClusterSDD(wing,
1186 -1,-1,(Float_t)qfit[i],ncl,0,0,
1188 (Float_t)zfit[i],0,0,0,0,
1189 tstart,tstop,astart,astop);
1190 // AliITSRawClusterSDD *clust = new AliITSRawClusterSDD(wing,-1,
1191 // -1,(Float_t)qfit[i],0,0,0,
1192 // (Float_t)xfit[i],
1193 // (Float_t)zfit[i],0,0,0,0,
1194 // tstart,tstop,astart,astop,ncl);
1196 // if(wing == 1) xfit[i] *= (-1);
1197 Float_t Anode = (zfit[i]/anodePitch+fNofAnodes/2-0.5);
1198 Float_t Time = (fSddLength - xfit[i])/fDriftSpeed;
1199 Float_t clusterPeakAmplitude = clusterJ->PeakAmpl();
1200 Float_t peakpos = clusterJ->PeakPos();
1201 Float_t clusteranodePath = (Anode - fNofAnodes/2)*anodePitch;
1202 Float_t clusterDriftPath = Time*fDriftSpeed;
1203 clusterDriftPath = fSddLength-clusterDriftPath;
1204 AliITSRawClusterSDD *clust = new AliITSRawClusterSDD(wing,Anode,
1206 clusterPeakAmplitude,peakpos,
1207 0.,0.,clusterDriftPath,
1208 clusteranodePath,clusterJ->Samples()/2
1209 ,tstart,tstop,0,0,0,astart,astop);
1211 iTS->AddCluster(1,clust);
1212 // cout<<"new cluster added: tstart,tstop,astart,astop,x,ncl ="
1213 // <<tstart<<","<<tstop<<","<<astart<<","<<astop<<","<<xfit[i]
1214 // <<","<<ncl<<endl;
1217 fClusters->RemoveAt(j);
1220 fClusters->Compress();
1225 //______________________________________________________________________
1226 void AliITSClusterFinderSDD::GetRecPoints(){
1228 static AliITS *iTS=(AliITS*)gAlice->GetModule("ITS");
1229 // get number of clusters for this module
1230 Int_t nofClusters = fClusters->GetEntriesFast();
1231 nofClusters -= fNclusters;
1232 const Float_t kconvGeV = 1.e-6; // GeV -> KeV
1233 const Float_t kconv = 1.0e-4;
1234 const Float_t kRMSx = 38.0*kconv; // microns->cm ITS TDR Table 1.3
1235 const Float_t kRMSz = 28.0*kconv; // microns->cm ITS TDR Table 1.3
1237 Int_t ix, iz, idx=-1;
1238 AliITSdigitSDD *dig=0;
1239 Int_t ndigits=fDigits->GetEntriesFast();
1240 for(i=0; i<nofClusters; i++) {
1241 AliITSRawClusterSDD *clusterI = (AliITSRawClusterSDD*)fClusters->At(i);
1242 if(!clusterI) Error("SDD: GetRecPoints","i clusterI ",i,clusterI);
1243 if(clusterI) idx=clusterI->PeakPos();
1244 if(idx>ndigits) Error("SDD: GetRecPoints","idx ndigits",idx,ndigits);
1245 // try peak neighbours - to be done
1246 if(idx&&idx<= ndigits) dig =(AliITSdigitSDD*)fDigits->UncheckedAt(idx);
1249 fSegmentation->GetPadIxz(clusterI->X(),clusterI->Z(),ix,iz);
1250 dig = (AliITSdigitSDD*)fMap->GetHit(iz-1,ix-1);
1251 // if null try neighbours
1252 if (!dig) dig = (AliITSdigitSDD*)fMap->GetHit(iz-1,ix);
1253 if (!dig) dig = (AliITSdigitSDD*)fMap->GetHit(iz-1,ix+1);
1254 if (!dig) printf("SDD: cannot assign the track number!\n");
1256 AliITSRecPoint rnew;
1257 rnew.SetX(clusterI->X());
1258 rnew.SetZ(clusterI->Z());
1259 rnew.SetQ(clusterI->Q()); // in KeV - should be ADC
1260 rnew.SetdEdX(kconvGeV*clusterI->Q());
1261 rnew.SetSigmaX2(kRMSx*kRMSx);
1262 rnew.SetSigmaZ2(kRMSz*kRMSz);
1264 rnew.fTracks[0] = dig->fTracks[0];
1265 rnew.fTracks[1] = -3;
1266 rnew.fTracks[2] = -3;
1268 while(rnew.fTracks[0]==dig->fTracks[j] &&
1269 j<dig->GetNTracks()) j++;
1270 if(j<dig->GetNTracks()){
1271 rnew.fTracks[1] = dig->fTracks[j];
1272 while((rnew.fTracks[0]==dig->fTracks[j] ||
1273 rnew.fTracks[1]==dig->fTracks[j] )&&
1274 j<dig->GetNTracks()) j++;
1275 if(j<dig->GetNTracks()) rnew.fTracks[2] = dig->fTracks[j];
1278 //printf("SDD: i %d track1 track2 track3 %d %d %d x y %f %f\n",
1279 // i,rnew.fTracks[0],rnew.fTracks[1],rnew.fTracks[2],c
1280 // lusterI->X(),clusterI->Z());
1281 iTS->AddRecPoint(rnew);
1283 // fMap->ClearMap();
1285 //______________________________________________________________________
1286 void AliITSClusterFinderSDD::FindRawClusters(Int_t mod){
1287 // find raw clusters
1297 //_______________________________________________________________________
1298 void AliITSClusterFinderSDD::Print(){
1299 // Print SDD cluster finder Parameters
1301 cout << "**************************************************" << endl;
1302 cout << " Silicon Drift Detector Cluster Finder Parameters " << endl;
1303 cout << "**************************************************" << endl;
1304 cout << "Number of Clusters: " << fNclusters << endl;
1305 cout << "Anode Tolerance: " << fDAnode << endl;
1306 cout << "Time Tolerance: " << fDTime << endl;
1307 cout << "Time correction (electronics): " << fTimeCorr << endl;
1308 cout << "Cut Amplitude (threshold): " << fCutAmplitude << endl;
1309 cout << "Minimum Amplitude: " << fMinPeak << endl;
1310 cout << "Minimum Charge: " << fMinCharge << endl;
1311 cout << "Minimum number of cells/clusters: " << fMinNCells << endl;
1312 cout << "Maximum number of cells/clusters: " << fMaxNCells << endl;
1313 cout << "**************************************************" << endl;