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.30 2003/03/03 16:34:35 masera
19 Corrections to comply with coding conventions
21 Revision 1.29 2002/10/25 18:54:22 barbera
22 Various improvements and updates from B.S.Nilsen and T. Virgili
24 Revision 1.28 2002/10/22 14:45:29 alibrary
25 Introducing Riostream.h
27 Revision 1.27 2002/10/14 14:57:00 hristov
28 Merging the VirtualMC branch to the main development branch (HEAD)
30 Revision 1.23.4.2 2002/10/14 13:14:07 hristov
31 Updating VirtualMC to v3-09-02
33 Revision 1.26 2002/09/09 17:23:28 nilsen
34 Minor changes in support of changes to AliITSdigitS?D class'.
36 Revision 1.25 2002/05/10 22:29:40 nilsen
37 Change my Massimo Masera in the default constructor to bring things into
40 Revision 1.24 2002/04/24 22:02:31 nilsen
41 New SDigits and Digits routines, and related changes, (including new
50 #include <Riostream.h>
55 #include "AliITSClusterFinderSDD.h"
56 #include "AliITSMapA1.h"
58 #include "AliITSdigit.h"
59 #include "AliITSRawCluster.h"
60 #include "AliITSRecPoint.h"
61 #include "AliITSsegmentation.h"
62 #include "AliITSresponseSDD.h"
65 ClassImp(AliITSClusterFinderSDD)
67 //______________________________________________________________________
68 AliITSClusterFinderSDD::AliITSClusterFinderSDD(AliITSsegmentation *seg,
69 AliITSresponse *response,
72 // standard constructor
78 fNclusters = fClusters->GetEntriesFast();
82 SetMinPeak((Int_t)(((AliITSresponseSDD*)fResponse)->GetNoiseAfterElectronics()*5));
88 fMap = new AliITSMapA1(fSegmentation,fDigits,fCutAmplitude);
90 //______________________________________________________________________
91 AliITSClusterFinderSDD::AliITSClusterFinderSDD(){
92 // default constructor
111 SetMinPeak((Int_t)(((AliITSresponseSDD*)fResponse)->GetNoiseAfterElectronics()*5));
118 //____________________________________________________________________________
119 AliITSClusterFinderSDD::~AliITSClusterFinderSDD(){
122 if(fMap) delete fMap;
124 //______________________________________________________________________
125 void AliITSClusterFinderSDD::SetCutAmplitude(Float_t nsigma){
126 // set the signal threshold for cluster finder
127 Float_t baseline,noise,noiseAfterEl;
129 fResponse->GetNoiseParam(noise,baseline);
130 noiseAfterEl = ((AliITSresponseSDD*)fResponse)->GetNoiseAfterElectronics();
131 fCutAmplitude = (Int_t)((baseline + nsigma*noiseAfterEl));
133 //______________________________________________________________________
134 void AliITSClusterFinderSDD::Find1DClusters(){
136 static AliITS *iTS = (AliITS*)gAlice->GetModule("ITS");
138 // retrieve the parameters
139 Int_t fNofMaps = fSegmentation->Npz();
140 Int_t fMaxNofSamples = fSegmentation->Npx();
141 Int_t fNofAnodes = fNofMaps/2;
143 Float_t fTimeStep = fSegmentation->Dpx(dummy);
144 Float_t fSddLength = fSegmentation->Dx();
145 Float_t fDriftSpeed = fResponse->DriftSpeed();
146 Float_t anodePitch = fSegmentation->Dpz(dummy);
150 fMap->SetThreshold(fCutAmplitude);
155 fResponse->GetNoiseParam(noise,baseline);
157 Int_t nofFoundClusters = 0;
159 Float_t **dfadc = new Float_t*[fNofAnodes];
160 for(i=0;i<fNofAnodes;i++) dfadc[i] = new Float_t[fMaxNofSamples];
166 for(k=0;k<fNofAnodes;k++) {
167 idx = j*fNofAnodes+k;
168 // signal (fadc) & derivative (dfadc)
170 for(l=0; l<fMaxNofSamples; l++) {
171 fadc2=(Float_t)fMap->GetSignal(idx,l);
172 if(l>0) fadc1=(Float_t)fMap->GetSignal(idx,l-1);
173 if(l>0) dfadc[k][l-1] = fadc2-fadc1;
177 for(k=0;k<fNofAnodes;k++) {
178 //cout << "Anode: " << k+1 << ", Wing: " << j+1 << endl;
179 idx = j*fNofAnodes+k;
183 while(it <= fMaxNofSamples-3) {
187 Float_t fadcmax = 0.;
188 Float_t dfadcmax = 0.;
195 if(id>=fMaxNofSamples) break;
196 fadc=(float)fMap->GetSignal(idx,id);
197 if(fadc > fadcmax) { fadcmax = fadc; imax = id;}
198 if(fadc > (float)fCutAmplitude) {
201 if(dfadc[k][id] > dfadcmax) {
202 dfadcmax = dfadc[k][id];
207 if(fMap->TestHit(idx,imax) == kEmpty) {it++; continue;}
210 if(tstart < 0) tstart = 0;
212 if(lthrt >= lthrmint && lthra >= lthrmina) ilcl = 1;
215 Int_t tstop = tstart;
216 Float_t dfadcmin = 10000.;
218 for(ij=0; ij<20; ij++) {
219 if(tstart+ij > 255) { tstop = 255; break; }
220 fadc=(float)fMap->GetSignal(idx,tstart+ij);
221 if((dfadc[k][tstart+ij] < dfadcmin) &&
222 (fadc > fCutAmplitude)) {
224 if(tstop > 255) tstop = 255;
225 dfadcmin = dfadc[k][it+ij];
229 Float_t clusterCharge = 0.;
230 Float_t clusterAnode = k+0.5;
231 Float_t clusterTime = 0.;
232 Int_t clusterMult = 0;
233 Float_t clusterPeakAmplitude = 0.;
234 Int_t its,peakpos = -1;
236 fResponse->GetNoiseParam(n,baseline);
237 for(its=tstart; its<=tstop; its++) {
238 fadc=(float)fMap->GetSignal(idx,its);
239 if(fadc>baseline) fadc -= baseline;
241 clusterCharge += fadc;
242 // as a matter of fact we should take the peak
244 // to get the list of tracks !!!
245 if(fadc > clusterPeakAmplitude) {
246 clusterPeakAmplitude = fadc;
247 //peakpos=fMap->GetHitIndex(idx,its);
248 Int_t shift = (int)(fTimeCorr/fTimeStep);
249 if(its>shift && its<(fMaxNofSamples-shift))
250 peakpos = fMap->GetHitIndex(idx,its+shift);
251 else peakpos = fMap->GetHitIndex(idx,its);
252 if(peakpos<0) peakpos =fMap->GetHitIndex(idx,its);
254 clusterTime += fadc*its;
255 if(fadc > 0) clusterMult++;
257 clusterTime /= (clusterCharge/fTimeStep); // ns
258 if(clusterTime>fTimeCorr) clusterTime -=fTimeCorr;
263 Float_t clusteranodePath = (clusterAnode - fNofAnodes/2)*
265 Float_t clusterDriftPath = clusterTime*fDriftSpeed;
266 clusterDriftPath = fSddLength-clusterDriftPath;
267 if(clusterCharge <= 0.) break;
268 AliITSRawClusterSDD clust(j+1,//i
269 clusterAnode,clusterTime,//ff
271 clusterPeakAmplitude, //f
273 0.,0.,clusterDriftPath,//fff
274 clusteranodePath, //f
277 iTS->AddCluster(1,&clust);
285 for(i=0;i<fNofAnodes;i++) delete[] dfadc[i];
293 //______________________________________________________________________
294 void AliITSClusterFinderSDD::Find1DClustersE(){
296 static AliITS *iTS=(AliITS*)gAlice->GetModule("ITS");
297 // retrieve the parameters
298 Int_t fNofMaps = fSegmentation->Npz();
299 Int_t fMaxNofSamples = fSegmentation->Npx();
300 Int_t fNofAnodes = fNofMaps/2;
302 Float_t fTimeStep = fSegmentation->Dpx( dummy );
303 Float_t fSddLength = fSegmentation->Dx();
304 Float_t fDriftSpeed = fResponse->DriftSpeed();
305 Float_t anodePitch = fSegmentation->Dpz( dummy );
307 fResponse->GetNoiseParam( n, baseline );
310 fMap->SetThreshold( fCutAmplitude );
314 // cout << "Search cluster... "<< endl;
315 for( Int_t j=0; j<2; j++ ){
316 for( Int_t k=0; k<fNofAnodes; k++ ){
317 Int_t idx = j*fNofAnodes+k;
325 Float_t anode = k+0.5;
327 for( Int_t l=0; l<fMaxNofSamples; l++ ){
328 Float_t fadc = (Float_t)fMap->GetSignal( idx, l );
330 if( on == kFALSE && l<fMaxNofSamples-4){
331 // star RawCluster (reset var.)
332 Float_t fadc1 = (Float_t)fMap->GetSignal( idx, l+1 );
333 if( fadc1 < fadc ) continue;
343 if( fadc > baseline ) fadc -= baseline;
350 Int_t shift = (Int_t)(fTimeCorr/fTimeStep + 0.5);
351 if( l > shift && l < (fMaxNofSamples-shift) )
352 peakpos = fMap->GetHitIndex( idx, l+shift );
354 peakpos = fMap->GetHitIndex( idx, l );
355 if( peakpos < 0) peakpos = fMap->GetHitIndex( idx, l );
360 // min # of timesteps for a RawCluster
361 // Found a RawCluster...
363 time /= (charge/fTimeStep); // ns
364 // time = lmax*fTimeStep; // ns
365 if( time > fTimeCorr ) time -= fTimeCorr; // ns
366 Float_t anodePath = (anode - fNofAnodes/2)*anodePitch;
367 Float_t driftPath = time*fDriftSpeed;
368 driftPath = fSddLength-driftPath;
369 AliITSRawClusterSDD clust(j+1,anode,time,charge,
373 start, stop, 1, k, k );
374 iTS->AddCluster( 1, &clust );
375 // clust.PrintInfo();
379 } // end if on==kTRUE
384 // cout << "# Rawclusters " << nClu << endl;
387 //_______________________________________________________________________
388 Int_t AliITSClusterFinderSDD::SearchPeak(Float_t *spect,Int_t xdim,Int_t zdim,
389 Int_t *peakX, Int_t *peakZ,
390 Float_t *peakAmp, Float_t minpeak ){
391 // search peaks on a 2D cluster
392 Int_t npeak = 0; // # peaks
395 for( Int_t z=1; z<zdim-1; z++ ){
396 for( Int_t x=1; x<xdim-2; x++ ){
397 Float_t sxz = spect[x*zdim+z];
398 Float_t sxz1 = spect[(x+1)*zdim+z];
399 Float_t sxz2 = spect[(x-1)*zdim+z];
400 // search a local max. in s[x,z]
401 if( sxz < minpeak || sxz1 <= 0 || sxz2 <= 0 ) continue;
402 if( sxz >= spect[(x+1)*zdim+z ] && sxz >= spect[(x-1)*zdim+z ] &&
403 sxz >= spect[x*zdim +z+1] && sxz >= spect[x*zdim +z-1] &&
404 sxz >= spect[(x+1)*zdim+z+1] && sxz >= spect[(x+1)*zdim+z-1] &&
405 sxz >= spect[(x-1)*zdim+z+1] && sxz >= spect[(x-1)*zdim+z-1] ){
409 peakAmp[npeak] = sxz;
414 // search groups of peaks with same amplitude.
415 Int_t *flag = new Int_t[npeak];
416 for( i=0; i<npeak; i++ ) flag[i] = 0;
417 for( i=0; i<npeak; i++ ){
418 for( j=0; j<npeak; j++ ){
420 if( flag[j] > 0 ) continue;
421 if( peakAmp[i] == peakAmp[j] &&
422 TMath::Abs(peakX[i]-peakX[j])<=1 &&
423 TMath::Abs(peakZ[i]-peakZ[j])<=1 ){
424 if( flag[i] == 0) flag[i] = i+1;
429 // make average of peak groups
430 for( i=0; i<npeak; i++ ){
432 if( flag[i] <= 0 ) continue;
433 for( j=0; j<npeak; j++ ){
435 if( flag[j] != flag[i] ) continue;
436 peakX[i] += peakX[j];
437 peakZ[i] += peakZ[j];
440 for( Int_t k=j; k<npeak; k++ ){
441 peakX[k] = peakX[k+1];
442 peakZ[k] = peakZ[k+1];
443 peakAmp[k] = peakAmp[k+1];
456 //______________________________________________________________________
457 void AliITSClusterFinderSDD::PeakFunc( Int_t xdim, Int_t zdim, Float_t *par,
458 Float_t *spe, Float_t *integral){
459 // function used to fit the clusters
460 // par -> parameters..
461 // par[0] number of peaks.
462 // for each peak i=1, ..., par[0]
468 Int_t electronics = fResponse->Electronics(); // 1 = PASCAL, 2 = OLA
469 const Int_t knParam = 5;
470 Int_t npeak = (Int_t)par[0];
472 memset( spe, 0, sizeof( Float_t )*zdim*xdim );
475 for( Int_t i=0; i<npeak; i++ ){
476 if( integral != 0 ) integral[i] = 0.;
477 Float_t sigmaA2 = par[k+4]*par[k+4]*2.;
478 Float_t t2 = par[k+3]; // PASCAL
479 if( electronics == 2 ) { t2 *= t2; t2 *= 2; } // OLA
480 for( Int_t z=0; z<zdim; z++ ){
481 for( Int_t x=0; x<xdim; x++ ){
482 Float_t z2 = (z-par[k+2])*(z-par[k+2])/sigmaA2;
485 if( electronics == 1 ){ // PASCAL
486 x2 = (x-par[k+1]+t2)/t2;
487 signal = (x2>0.) ? par[k]*x2*exp(-x2+1.-z2) :0.0; // RCCR2
488 // signal =(x2>0.) ? par[k]*x2*x2*exp(-2*x2+2.-z2 ):0.0;//RCCR
489 }else if( electronics == 2 ) { // OLA
490 x2 = (x-par[k+1])*(x-par[k+1])/t2;
491 signal = par[k] * exp( -x2 - z2 );
493 Warning("PeakFunc","Wrong SDD Electronics = %d",electronics);
495 } // end if electronicx
496 spe[x*zdim+z] += signal;
497 if( integral != 0 ) integral[i] += signal;
504 //__________________________________________________________________________
505 Float_t AliITSClusterFinderSDD::ChiSqr( Int_t xdim, Int_t zdim, Float_t *spe,
506 Float_t *speFit ) const{
507 // EVALUATES UNNORMALIZED CHI-SQUARED
509 for( Int_t z=0; z<zdim; z++ ){
510 for( Int_t x=1; x<xdim-1; x++ ){
511 Int_t index = x*zdim+z;
512 Float_t tmp = spe[index] - speFit[index];
518 //_______________________________________________________________________
519 void AliITSClusterFinderSDD::Minim( Int_t xdim, Int_t zdim, Float_t *param,
520 Float_t *prm0,Float_t *steprm,
521 Float_t *chisqr,Float_t *spe,
524 Int_t k, nnn, mmm, i;
525 Float_t p1, delta, d1, chisq1, p2, chisq2, t, p3, chisq3, a, b, p0, chisqt;
526 const Int_t knParam = 5;
527 Int_t npeak = (Int_t)param[0];
528 for( k=1; k<(npeak*knParam+1); k++ ) prm0[k] = param[k];
529 for( k=1; k<(npeak*knParam+1); k++ ){
533 // ENSURE THAT STEP SIZE IS SENSIBLY LARGER THAN MACHINE ROUND OFF
534 if( fabs( p1 ) > 1.0E-6 )
535 if ( fabs( delta/p1 ) < 1.0E-4 ) delta = p1/1000;
536 else delta = (Float_t)1.0E-4;
537 // EVALUATE CHI-SQUARED AT FIRST TWO SEARCH POINTS
538 PeakFunc( xdim, zdim, param, speFit );
539 chisq1 = ChiSqr( xdim, zdim, spe, speFit );
542 PeakFunc( xdim, zdim, param, speFit );
543 chisq2 = ChiSqr( xdim, zdim, spe, speFit );
544 if( chisq1 < chisq2 ){
545 // REVERSE DIRECTION OF SEARCH IF CHI-SQUARED IS INCREASING
555 do { // INCREMENT param(K) UNTIL CHI-SQUARED STARTS TO INCREASE
558 mmm = nnn - (nnn/5)*5; // multiplo de 5
561 // INCREASE STEP SIZE IF STEPPING TOWARDS MINIMUM IS TOO SLOW
565 // Constrain paramiters
566 Int_t kpos = (k-1) % knParam;
569 if( param[k] <= 20 ) param[k] = fMinPeak;
572 if( fabs( param[k] - prm0[k] ) > 1.5 ) param[k] = prm0[k];
575 if( fabs( param[k] - prm0[k] ) > 1. ) param[k] = prm0[k];
578 if( param[k] < .5 ) param[k] = .5;
581 if( param[k] < .288 ) param[k] = .288; // 1/sqrt(12) = 0.288
582 if( param[k] > zdim*.5 ) param[k] = zdim*.5;
585 PeakFunc( xdim, zdim, param, speFit );
586 chisq3 = ChiSqr( xdim, zdim, spe, speFit );
587 if( chisq3 < chisq2 && nnn < 50 ){
594 // FIND MINIMUM OF PARABOLA DEFINED BY LAST THREE POINTS
595 a = chisq1*(p2-p3)+chisq2*(p3-p1)+chisq3*(p1-p2);
596 b = chisq1*(p2*p2-p3*p3)+chisq2*(p3*p3-p1*p1)+chisq3*(p1*p1-p2*p2);
597 if( a!=0 ) p0 = (Float_t)(0.5*b/a);
599 //--IN CASE OF NEARLY EQUAL CHI-SQUARED AND TOO SMALL STEP SIZE PREVENT
600 // ERRONEOUS EVALUATION OF PARABOLA MINIMUM
601 //---NEXT TWO LINES CAN BE OMITTED FOR HIGHER PRECISION MACHINES
602 //dp = (Float_t) max (fabs(p3-p2), fabs(p2-p1));
603 //if( fabs( p2-p0 ) > dp ) p0 = p2;
605 // Constrain paramiters
606 Int_t kpos = (k-1) % knParam;
609 if( param[k] <= 20 ) param[k] = fMinPeak;
612 if( fabs( param[k] - prm0[k] ) > 1.5 ) param[k] = prm0[k];
615 if( fabs( param[k] - prm0[k] ) > 1. ) param[k] = prm0[k];
618 if( param[k] < .5 ) param[k] = .5;
621 if( param[k] < .288 ) param[k] = .288; // 1/sqrt(12) = 0.288
622 if( param[k] > zdim*.5 ) param[k] = zdim*.5;
625 PeakFunc( xdim, zdim, param, speFit );
626 chisqt = ChiSqr( xdim, zdim, spe, speFit );
627 // DO NOT ALLOW ERRONEOUS INTERPOLATION
628 if( chisqt <= *chisqr ) *chisqr = chisqt;
629 else param[k] = prm0[k];
630 // OPTIMIZE SEARCH STEP FOR EVENTUAL NEXT CALL OF MINIM
631 steprm[k] = (param[k]-prm0[k])/5;
632 if( steprm[k] >= d1 ) steprm[k] = d1/5;
634 // EVALUATE FIT AND CHI-SQUARED FOR OPTIMIZED PARAMETERS
635 PeakFunc( xdim, zdim, param, speFit );
636 *chisqr = ChiSqr( xdim, zdim, spe, speFit );
639 //_________________________________________________________________________
640 Int_t AliITSClusterFinderSDD::NoLinearFit( Int_t xdim, Int_t zdim,
641 Float_t *param, Float_t *spe,
642 Int_t *niter, Float_t *chir ){
643 // fit method from Comput. Phys. Commun 46(1987) 149
644 const Float_t kchilmt = 0.01; // relative accuracy
645 const Int_t knel = 3; // for parabolic minimization
646 const Int_t knstop = 50; // Max. iteration number
647 const Int_t knParam = 5;
648 Int_t npeak = (Int_t)param[0];
649 // RETURN IF NUMBER OF DEGREES OF FREEDOM IS NOT POSITIVE
650 if( (xdim*zdim - npeak*knParam) <= 0 ) return( -1 );
651 Float_t degFree = (xdim*zdim - npeak*knParam)-1;
652 Int_t n, k, iterNum = 0;
653 Float_t *prm0 = new Float_t[npeak*knParam+1];
654 Float_t *step = new Float_t[npeak*knParam+1];
655 Float_t *schi = new Float_t[npeak*knParam+1];
657 sprm[0] = new Float_t[npeak*knParam+1];
658 sprm[1] = new Float_t[npeak*knParam+1];
659 sprm[2] = new Float_t[npeak*knParam+1];
660 Float_t chi0, chi1, reldif, a, b, prmin, dp;
661 Float_t *speFit = new Float_t[ xdim*zdim ];
662 PeakFunc( xdim, zdim, param, speFit );
663 chi0 = ChiSqr( xdim, zdim, spe, speFit );
665 for( k=1; k<(npeak*knParam+1); k++) prm0[k] = param[k];
666 for( k=1 ; k<(npeak*knParam+1); k+=knParam ){
667 step[k] = param[k] / 20.0 ;
668 step[k+1] = param[k+1] / 50.0;
669 step[k+2] = param[k+2] / 50.0;
670 step[k+3] = param[k+3] / 20.0;
671 step[k+4] = param[k+4] / 20.0;
677 Minim( xdim, zdim, param, prm0, step, &chi1, spe, speFit );
678 reldif = ( chi1 > 0 ) ? ((Float_t) fabs( chi1-chi0)/chi1 ) : 0;
680 if( reldif < (float) kchilmt ){
681 *chir = (chi1>0) ? (float) TMath::Sqrt (chi1/degFree) :0;
686 if( (reldif < (float)(5*kchilmt)) && (iterNum > knstop) ){
687 *chir = (chi1>0) ?(float) TMath::Sqrt (chi1/degFree):0;
692 if( iterNum > 5*knstop ){
693 *chir = (chi1>0) ?(float) TMath::Sqrt (chi1/degFree):0;
698 if( iterNum <= knel ) continue;
699 n = iterNum - (iterNum/knel)*knel; // EXTRAPOLATION LIMIT COUNTER N
700 if( n > 3 || n == 0 ) continue;
702 for( k=1; k<(npeak*knParam+1); k++ ) sprm[n-1][k] = param[k];
703 if( n != 3 ) continue;
704 // -EVALUATE EXTRAPOLATED VALUE OF EACH PARAMETER BY FINDING MINIMUM OF
705 // PARABOLA DEFINED BY LAST THREE CALLS OF MINIM
706 for( k=1; k<(npeak*knParam+1); k++ ){
707 Float_t tmp0 = sprm[0][k];
708 Float_t tmp1 = sprm[1][k];
709 Float_t tmp2 = sprm[2][k];
710 a = schi[0]*(tmp1-tmp2) + schi[1]*(tmp2-tmp0);
711 a += (schi[2]*(tmp0-tmp1));
712 b = schi[0]*(tmp1*tmp1-tmp2*tmp2);
713 b += (schi[1]*(tmp2*tmp2-tmp0*tmp0)+(schi[2]*
714 (tmp0*tmp0-tmp1*tmp1)));
715 if ((double)a < 1.0E-6) prmin = 0;
716 else prmin = (float) (0.5*b/a);
718 if( fabs(prmin-tmp2) > fabs(dp) ) prmin = tmp2+dp;
720 step[k] = dp/10; // OPTIMIZE SEARCH STEP
733 //______________________________________________________________________
734 void AliITSClusterFinderSDD::ResolveClustersE(){
735 // The function to resolve clusters if the clusters overlapping exists
737 static AliITS *iTS = (AliITS*)gAlice->GetModule( "ITS" );
738 // get number of clusters for this module
739 Int_t nofClusters = fClusters->GetEntriesFast();
740 nofClusters -= fNclusters;
741 Int_t fNofMaps = fSegmentation->Npz();
742 Int_t fNofAnodes = fNofMaps/2;
743 Int_t fMaxNofSamples = fSegmentation->Npx();
745 Double_t fTimeStep = fSegmentation->Dpx( dummy );
746 Double_t fSddLength = fSegmentation->Dx();
747 Double_t fDriftSpeed = fResponse->DriftSpeed();
748 Double_t anodePitch = fSegmentation->Dpz( dummy );
750 fResponse->GetNoiseParam( n, baseline );
751 Int_t electronics = fResponse->Electronics(); // 1 = PASCAL, 2 = OLA
753 for( Int_t j=0; j<nofClusters; j++ ){
754 // get cluster information
755 AliITSRawClusterSDD *clusterJ=(AliITSRawClusterSDD*) fClusters->At(j);
756 Int_t astart = clusterJ->Astart();
757 Int_t astop = clusterJ->Astop();
758 Int_t tstart = clusterJ->Tstartf();
759 Int_t tstop = clusterJ->Tstopf();
760 Int_t wing = (Int_t)clusterJ->W();
762 astart += fNofAnodes;
765 Int_t xdim = tstop-tstart+3;
766 Int_t zdim = astop-astart+3;
767 if(xdim > 50 || zdim > 30) {
768 Warning("ResolveClustersE","xdim: %d , zdim: %d ",xdim,zdim);
771 Float_t *sp = new Float_t[ xdim*zdim+1 ];
772 memset( sp, 0, sizeof(Float_t)*(xdim*zdim+1) );
774 // make a local map from cluster region
775 for( Int_t ianode=astart; ianode<=astop; ianode++ ){
776 for( Int_t itime=tstart; itime<=tstop; itime++ ){
777 Float_t fadc = fMap->GetSignal( ianode, itime );
778 if( fadc > baseline ) fadc -= (Double_t)baseline;
780 Int_t index = (itime-tstart+1)*zdim+(ianode-astart+1);
785 // search peaks on cluster
786 const Int_t kNp = 150;
789 Float_t peakAmp1[kNp];
790 Int_t npeak = SearchPeak(sp,xdim,zdim,peakX1,peakZ1,peakAmp1,fMinPeak);
792 // if multiple peaks, split cluster
795 // cout << "npeak " << npeak << endl;
796 // clusterJ->PrintInfo();
797 Float_t *par = new Float_t[npeak*5+1];
798 par[0] = (Float_t)npeak;
799 // Initial parameters in cell dimentions
801 for( i=0; i<npeak; i++ ){
802 par[k1] = peakAmp1[i];
803 par[k1+1] = peakX1[i]; // local time pos. [timebin]
804 par[k1+2] = peakZ1[i]; // local anode pos. [anodepitch]
805 if( electronics == 1 )
806 par[k1+3] = 2.; // PASCAL
807 else if( electronics == 2 )
808 par[k1+3] = 0.7; // tau [timebin] OLA
809 par[k1+4] = .4; // sigma [anodepich]
814 NoLinearFit( xdim, zdim, par, sp, &niter, &chir );
819 Float_t peakAmp[kNp];
820 Float_t integral[kNp];
821 //get integrals => charge for each peak
822 PeakFunc( xdim, zdim, par, sp, integral );
824 for( i=0; i<npeak; i++ ){
825 peakAmp[i] = par[k1];
826 peakX[i] = par[k1+1];
827 peakZ[i] = par[k1+2];
829 sigma[i] = par[k1+4];
832 // calculate parameter for new clusters
833 for( i=0; i<npeak; i++ ){
834 AliITSRawClusterSDD clusterI( *clusterJ );
835 Int_t newAnode = peakZ1[i]-1 + astart;
836 Int_t newiTime = peakX1[i]-1 + tstart;
837 Int_t shift = (Int_t)(fTimeCorr/fTimeStep + 0.5);
838 if( newiTime > shift && newiTime < (fMaxNofSamples-shift) )
840 Int_t peakpos = fMap->GetHitIndex( newAnode, newiTime+shift );
841 clusterI.SetPeakPos( peakpos );
842 clusterI.SetPeakAmpl( peakAmp1[i] );
843 Float_t newAnodef = peakZ[i] - 0.5 + astart;
844 Float_t newiTimef = peakX[i] - 1 + tstart;
845 if( wing == 2 ) newAnodef -= fNofAnodes;
846 Float_t anodePath = (newAnodef - fNofAnodes/2)*anodePitch;
847 newiTimef *= fTimeStep;
848 if( newiTimef > fTimeCorr ) newiTimef -= fTimeCorr;
849 if( electronics == 1 ){
850 // newiTimef *= 0.999438; // PASCAL
851 // newiTimef += (6./fDriftSpeed - newiTimef/3000.);
852 }else if( electronics == 2 )
853 newiTimef *= 0.99714; // OLA
854 Float_t driftPath = fSddLength - newiTimef * fDriftSpeed;
855 Float_t sign = ( wing == 1 ) ? -1. : 1.;
856 clusterI.SetX( driftPath*sign * 0.0001 );
857 clusterI.SetZ( anodePath * 0.0001 );
858 clusterI.SetAnode( newAnodef );
859 clusterI.SetTime( newiTimef );
860 clusterI.SetAsigma( sigma[i]*anodePitch );
861 clusterI.SetTsigma( tau[i]*fTimeStep );
862 clusterI.SetQ( integral[i] );
863 // clusterI.PrintInfo();
864 iTS->AddCluster( 1, &clusterI );
866 fClusters->RemoveAt( j );
868 } else { // something odd
869 Warning("ResolveClustersE","--- Peak not found!!!! minpeak=%d ,cluster peak= %f , module= %d",fMinPeak,clusterJ->PeakAmpl(),fModule);
870 clusterJ->PrintInfo();
871 Warning("ResolveClustersE"," xdim= %d zdim= %d",xdim-2,zdim-2);
875 fClusters->Compress();
880 //________________________________________________________________________
881 void AliITSClusterFinderSDD::GroupClusters(){
884 Float_t fTimeStep = fSegmentation->Dpx(dummy);
885 // get number of clusters for this module
886 Int_t nofClusters = fClusters->GetEntriesFast();
887 nofClusters -= fNclusters;
888 AliITSRawClusterSDD *clusterI;
889 AliITSRawClusterSDD *clusterJ;
890 Int_t *label = new Int_t [nofClusters];
892 for(i=0; i<nofClusters; i++) label[i] = 0;
893 for(i=0; i<nofClusters; i++) {
894 if(label[i] != 0) continue;
895 for(j=i+1; j<nofClusters; j++) {
896 if(label[j] != 0) continue;
897 clusterI = (AliITSRawClusterSDD*) fClusters->At(i);
898 clusterJ = (AliITSRawClusterSDD*) fClusters->At(j);
900 if(clusterI->T() < fTimeStep*60) fDAnode = 4.2; // TB 3.2
901 if(clusterI->T() < fTimeStep*10) fDAnode = 1.5; // TB 1.
902 Bool_t pair = clusterI->Brother(clusterJ,fDAnode,fDTime);
904 // clusterI->PrintInfo();
905 // clusterJ->PrintInfo();
906 clusterI->Add(clusterJ);
908 fClusters->RemoveAt(j);
913 fClusters->Compress();
918 //________________________________________________________________________
919 void AliITSClusterFinderSDD::SelectClusters(){
920 // get number of clusters for this module
921 Int_t nofClusters = fClusters->GetEntriesFast();
923 nofClusters -= fNclusters;
925 for(i=0; i<nofClusters; i++) {
926 AliITSRawClusterSDD *clusterI =(AliITSRawClusterSDD*) fClusters->At(i);
929 if(clusterI->Anodes() != 0.) {
930 wy = ((Float_t) clusterI->Samples())/clusterI->Anodes();
932 Int_t amp = (Int_t) clusterI->PeakAmpl();
933 Int_t cha = (Int_t) clusterI->Q();
934 if(amp < fMinPeak) rmflg = 1;
935 if(cha < fMinCharge) rmflg = 1;
936 if(wy < fMinNCells) rmflg = 1;
937 //if(wy > fMaxNCells) rmflg = 1;
938 if(rmflg) fClusters->RemoveAt(i);
940 fClusters->Compress();
943 //__________________________________________________________________________
944 void AliITSClusterFinderSDD::ResolveClusters(){
945 // The function to resolve clusters if the clusters overlapping exists
946 /* AliITS *iTS=(AliITS*)gAlice->GetModule("ITS");
947 // get number of clusters for this module
948 Int_t nofClusters = fClusters->GetEntriesFast();
949 nofClusters -= fNclusters;
950 //cout<<"Resolve Cl: nofClusters, fNclusters ="<<nofClusters<<","
951 // <<fNclusters<<endl;
952 Int_t fNofMaps = fSegmentation->Npz();
953 Int_t fNofAnodes = fNofMaps/2;
955 Double_t fTimeStep = fSegmentation->Dpx(dummy);
956 Double_t fSddLength = fSegmentation->Dx();
957 Double_t fDriftSpeed = fResponse->DriftSpeed();
958 Double_t anodePitch = fSegmentation->Dpz(dummy);
960 fResponse->GetNoiseParam(n,baseline);
961 Float_t dzz_1A = anodePitch * anodePitch / 12;
962 // fill Map of signals
964 Int_t j,i,ii,ianode,anode,itime;
965 Int_t wing,astart,astop,tstart,tstop,nanode;
966 Double_t fadc,ClusterTime;
967 Double_t q[400],x[400],z[400]; // digit charges and coordinates
968 for(j=0; j<nofClusters; j++) {
969 AliITSRawClusterSDD *clusterJ=(AliITSRawClusterSDD*) fClusters->At(j);
971 astart=clusterJ->Astart();
972 astop=clusterJ->Astop();
973 tstart=clusterJ->Tstartf();
974 tstop=clusterJ->Tstopf();
975 nanode=clusterJ->Anodes(); // <- Ernesto
976 wing=(Int_t)clusterJ->W();
978 astart += fNofAnodes;
981 // cout<<"astart,astop,tstart,tstop ="<<astart<<","<<astop<<","
982 // <<tstart<<","<<tstop<<endl;
983 // clear the digit arrays
984 for(ii=0; ii<400; ii++) {
990 for(ianode=astart; ianode<=astop; ianode++) {
991 for(itime=tstart; itime<=tstop; itime++) {
992 fadc=fMap->GetSignal(ianode,itime);
994 fadc-=(Double_t)baseline;
995 q[ndigits] = fadc*(fTimeStep/160); // KeV
997 if(wing == 2) anode -= fNofAnodes;
998 z[ndigits] = (anode + 0.5 - fNofAnodes/2)*anodePitch;
999 ClusterTime = itime*fTimeStep;
1000 if(ClusterTime > fTimeCorr) ClusterTime -= fTimeCorr;// ns
1001 x[ndigits] = fSddLength - ClusterTime*fDriftSpeed;
1002 if(wing == 1) x[ndigits] *= (-1);
1003 // cout<<"ianode,itime,fadc ="<<ianode<<","<<itime<<","
1005 // cout<<"wing,anode,ndigits,charge ="<<wing<<","
1006 // <<anode<<","<<ndigits<<","<<q[ndigits]<<endl;
1011 // cout<<"fadc=0, ndigits ="<<ndigits<<endl;
1014 // cout<<"for new cluster ndigits ="<<ndigits<<endl;
1015 // Fit cluster to resolve for two separate ones --------------------
1016 Double_t qq=0., xm=0., zm=0., xx=0., zz=0., xz=0.;
1017 Double_t dxx=0., dzz=0., dxz=0.;
1018 Double_t scl = 0., tmp, tga, elps = -1.;
1019 Double_t xfit[2], zfit[2], qfit[2];
1020 Double_t pitchz = anodePitch*1.e-4; // cm
1021 Double_t pitchx = fTimeStep*fDriftSpeed*1.e-4; // cm
1024 Int_t nbins = ndigits;
1026 // now, all lengths are in microns
1027 for (ii=0; ii<nbins; ii++) {
1031 xx += x[ii]*x[ii]*q[ii];
1032 zz += z[ii]*z[ii]*q[ii];
1033 xz += x[ii]*z[ii]*q[ii];
1044 // shrink the cluster in the time direction proportionaly to the
1045 // dxx/dzz, which lineary depends from the drift path
1046 // new Ernesto........
1048 dzz = dzz_1A; // for one anode cluster dzz = anode**2/12
1049 scl = TMath::Sqrt( 7.2/(-0.57*xm*1.e-3+71.8) );
1052 scl = TMath::Sqrt( (-0.18*xm*1.e-3+21.3)/(-0.57*xm*1.e-3+71.8) );
1055 scl = TMath::Sqrt( (-0.5*xm*1.e-3+34.5)/(-0.57*xm*1.e-3+71.8) );
1058 scl = TMath::Sqrt( (1.3*xm*1.e-3+49.)/(-0.57*xm*1.e-3+71.8) );
1060 // cout<<"1 microns: zm,dzz,xm,dxx,dxz,qq ="<<zm<<","<<dzz<<","
1061 // <<xm<<","<<dxx<<","<<dxz<<","<<qq<<endl;
1062 // old Boris.........
1063 // tmp=29730. - 585.*fabs(xm/1000.);
1064 // scl=TMath::Sqrt(tmp/130000.);
1071 // dzz = zz - zm*zm;
1073 // cout<<"microns: zm,dzz,xm,dxx,xz,dxz,qq ="<<zm<<","<<dzz<<","
1074 // <<xm<<","<<dxx<<","<<xz<<","<<dxz<<","<<qq<<endl;
1075 // if(dzz < 7200.) dzz=7200.;//for one anode cluster dzz = anode**2/12
1077 if (dxx < 0.) dxx=0.;
1078 // the data if no cluster overlapping (the coordunates are in cm)
1083 // if(nbins < 7) cout<<"**** nbins ="<<nbins<<endl;
1086 if (dxz==0.) tga=0.;
1088 tmp=0.5*(dzz-dxx)/dxz;
1089 tga = (dxz<0.) ? tmp-TMath::Sqrt(tmp*tmp+1) :
1090 tmp+TMath::Sqrt(tmp*tmp+1);
1092 elps=(tga*tga*dxx-2*tga*dxz+dzz)/(dxx+2*tga*dxz+tga*tga*dzz);
1093 // change from microns to cm
1102 // cout<<"cm: zm,dzz,xm,dxx,xz,dxz,qq ="<<zm<<","<<dzz<<","
1103 // <<xm<<","<<dxx<<","<<xz<<","<<dxz<<","<<qq<<endl;
1104 for (i=0; i<nbins; i++) {
1106 x[i] = x[i] *= 1.e-4;
1107 z[i] = z[i] *= 1.e-4;
1109 // cout<<"!!! elps ="<<elps<<endl;
1110 if (elps < 0.3) { // try to separate hits
1113 Double_t cosa=cos(tmp),sina=sin(tmp);
1114 Double_t a1=0., x1=0., xxx=0.;
1115 for (i=0; i<nbins; i++) {
1116 tmp=x[i]*cosa + z[i]*sina;
1121 xxx += tmp*tmp*tmp*q[i];
1124 Double_t z12=-sina*xm + cosa*zm;
1125 sigma2=(sina*sina*xx-2*cosa*sina*xz+cosa*cosa*zz) - z12*z12;
1126 xm=cosa*xm + sina*zm;
1127 xx=cosa*cosa*xx + 2*cosa*sina*xz + sina*sina*zz;
1128 Double_t x2=(xx - xm*x1 - sigma2)/(xm - x1);
1129 Double_t r=a1*2*TMath::ACos(-1.)*sigma2/(qq*pitchx*pitchz);
1130 for (i=0; i<33; i++) { // solve a system of equations
1131 Double_t x1_old=x1, x2_old=x2, r_old=r;
1135 Double_t c21=x1*x1 - x2*x2;
1136 Double_t c22=2*r*x1;
1137 Double_t c23=2*(1-r)*x2;
1138 Double_t c31=3*sigma2*(x1-x2) + x1*x1*x1 - x2*x2*x2;
1139 Double_t c32=3*r*(sigma2 + x1*x1);
1140 Double_t c33=3*(1-r)*(sigma2 + x2*x2);
1141 Double_t f1=-(r*x1 + (1-r)*x2 - xm);
1142 Double_t f2=-(r*(sigma2+x1*x1)+(1-r)*(sigma2+x2*x2)- xx);
1143 Double_t f3=-(r*x1*(3*sigma2+x1*x1)+(1-r)*x2*
1144 (3*sigma2+x2*x2)-xxx);
1145 Double_t d=c11*c22*c33+c21*c32*c13+c12*c23*c31-
1146 c31*c22*c13 - c21*c12*c33 - c32*c23*c11;
1148 cout<<"*********** d=0 ***********\n";
1151 Double_t dr=f1*c22*c33 + f2*c32*c13 + c12*c23*f3 -
1152 f3*c22*c13 - f2*c12*c33 - c32*c23*f1;
1153 Double_t d1=c11*f2*c33 + c21*f3*c13 + f1*c23*c31 -
1154 c31*f2*c13 - c21*f1*c33 - f3*c23*c11;
1155 Double_t d2=c11*c22*f3 + c21*c32*f1 + c12*f2*c31 -
1156 c31*c22*f1 - c21*c12*f3 - c32*f2*c11;
1160 if (fabs(x1-x1_old) > 0.0001) continue;
1161 if (fabs(x2-x2_old) > 0.0001) continue;
1162 if (fabs(r-r_old)/5 > 0.001) continue;
1163 a1=r*qq*pitchx*pitchz/(2*TMath::ACos(-1.)*sigma2);
1164 Double_t a2=a1*(1-r)/r;
1165 qfit[0]=a1; xfit[0]=x1*cosa - z12*sina; zfit[0]=x1*sina +
1167 qfit[1]=a2; xfit[1]=x2*cosa - z12*sina; zfit[1]=x2*sina +
1172 if (i==33) cerr<<"No more iterations ! "<<endl;
1173 } // end of attempt to separate overlapped clusters
1174 } // end of nbins cut
1175 if(elps < 0.) cout<<" elps=-1 ="<<elps<<endl;
1176 if(elps >0. && elps< 0.3 && nfhits == 1) cout<<" small elps, nfh=1 ="
1177 <<elps<<","<<nfhits<<endl;
1178 if(nfhits == 2) cout<<" nfhits=2 ="<<nfhits<<endl;
1179 for (i=0; i<nfhits; i++) {
1180 xfit[i] *= (1.e+4/scl);
1181 if(wing == 1) xfit[i] *= (-1);
1183 // cout<<" --------- i,xfiti,zfiti,qfiti ="<<i<<","
1184 // <<xfit[i]<<","<<zfit[i]<<","<<qfit[i]<<endl;
1187 if(nfhits == 1 && separate == 1) {
1188 cout<<"!!!!! no separate"<<endl;
1192 cout << "Split cluster: " << endl;
1193 clusterJ->PrintInfo();
1194 cout << " in: " << endl;
1195 for (i=0; i<nfhits; i++) {
1196 // AliITSRawClusterSDD *clust = new AliITSRawClusterSDD(wing,
1197 -1,-1,(Float_t)qfit[i],ncl,0,0,
1199 (Float_t)zfit[i],0,0,0,0,
1200 tstart,tstop,astart,astop);
1201 // AliITSRawClusterSDD *clust = new AliITSRawClusterSDD(wing,-1,
1202 // -1,(Float_t)qfit[i],0,0,0,
1203 // (Float_t)xfit[i],
1204 // (Float_t)zfit[i],0,0,0,0,
1205 // tstart,tstop,astart,astop,ncl);
1207 // if(wing == 1) xfit[i] *= (-1);
1208 Float_t Anode = (zfit[i]/anodePitch+fNofAnodes/2-0.5);
1209 Float_t Time = (fSddLength - xfit[i])/fDriftSpeed;
1210 Float_t clusterPeakAmplitude = clusterJ->PeakAmpl();
1211 Float_t peakpos = clusterJ->PeakPos();
1212 Float_t clusteranodePath = (Anode - fNofAnodes/2)*anodePitch;
1213 Float_t clusterDriftPath = Time*fDriftSpeed;
1214 clusterDriftPath = fSddLength-clusterDriftPath;
1215 AliITSRawClusterSDD *clust = new AliITSRawClusterSDD(wing,Anode,
1217 clusterPeakAmplitude,peakpos,
1218 0.,0.,clusterDriftPath,
1219 clusteranodePath,clusterJ->Samples()/2
1220 ,tstart,tstop,0,0,0,astart,astop);
1222 iTS->AddCluster(1,clust);
1223 // cout<<"new cluster added: tstart,tstop,astart,astop,x,ncl ="
1224 // <<tstart<<","<<tstop<<","<<astart<<","<<astop<<","<<xfit[i]
1225 // <<","<<ncl<<endl;
1228 fClusters->RemoveAt(j);
1231 fClusters->Compress();
1236 //______________________________________________________________________
1237 void AliITSClusterFinderSDD::GetRecPoints(){
1239 static AliITS *iTS=(AliITS*)gAlice->GetModule("ITS");
1240 // get number of clusters for this module
1241 Int_t nofClusters = fClusters->GetEntriesFast();
1242 nofClusters -= fNclusters;
1243 const Float_t kconvGeV = 1.e-6; // GeV -> KeV
1244 const Float_t kconv = 1.0e-4;
1245 const Float_t kRMSx = 38.0*kconv; // microns->cm ITS TDR Table 1.3
1246 const Float_t kRMSz = 28.0*kconv; // microns->cm ITS TDR Table 1.3
1248 Int_t ix, iz, idx=-1;
1249 AliITSdigitSDD *dig=0;
1250 Int_t ndigits=fDigits->GetEntriesFast();
1251 for(i=0; i<nofClusters; i++) {
1252 AliITSRawClusterSDD *clusterI = (AliITSRawClusterSDD*)fClusters->At(i);
1253 if(!clusterI) Error("SDD: GetRecPoints","i clusterI ",i,clusterI);
1254 if(clusterI) idx=clusterI->PeakPos();
1255 if(idx>ndigits) Error("SDD: GetRecPoints","idx ndigits",idx,ndigits);
1256 // try peak neighbours - to be done
1257 if(idx&&idx<= ndigits) dig =(AliITSdigitSDD*)fDigits->UncheckedAt(idx);
1259 // cout<<"R.C. Anode = "<<clusterI->A()<<"; Time= "<<clusterI->T()<<endl;
1260 fSegmentation->LocalToDet(clusterI->X(),clusterI->Z(),ix,iz);
1261 // cout<<"From R.C. coordinates- Anode: "<<iz<<" and time: "<<ix<<endl;
1267 Warning("GetRecPoints","Cannot assign the track number\n");
1270 fSegmentation->LocalToDet(clusterI->X(),clusterI->Z(),ix,iz);
1272 for(Int_t kk=0;kk<9;kk++)trks[kk]=-2;
1273 AliITSdigitSDD * pdig = 0;
1274 for(Int_t itime=ix-1;itime<=ix+1;itime++){
1275 if(itime<0 || itime>=fSegmentation->Npx())continue;
1276 for(Int_t ianod=iz-1;ianod<=iz+1;ianod++){
1277 if(ianod<0 || ianod>=fSegmentation->Npz())continue;
1278 if(iz==(fSegmentation->Npz())/2 && ianod<iz)continue;
1279 if(iz==(fSegmentation->Npz())/2-1 && ianod>iz)continue;
1280 pdig = (AliITSdigitSDD*)fMap->GetHit(ianod,itime);
1282 for(Int_t kk=0;kk<3;kk++){
1283 if(kk == 0 || (kk>0 && pdig->fTracks[kk]>=0)){
1285 trks[notr]=pdig->fTracks[kk];
1286 signal[notr]=pdig->fSignal;
1292 if((dig->fCoord1<(iz-1) || dig->fCoord1>(iz+1))
1293 && (dig->fCoord2<(ix-1) || dig->fCoord2>(ix+1))
1294 && dig->fTracks[0]>=-2){
1296 trks[notr]=dig->fTracks[0];
1297 signal[notr]=dig->fSignal;
1299 for(Int_t ii=0; ii<notr;ii++){
1300 for(Int_t jj=ii+1; jj<=notr; jj++){
1301 if(trks[ii] == trks[jj]){
1302 signal[ii]+=signal[jj];
1310 for(Int_t ii=0; ii<notr;ii++){
1312 for(Int_t jj=ii+1; jj<=notr; jj++){
1313 if(signal[jj]>signal[maxi])maxi=jj;
1316 trks[ii]=trks[maxi];
1318 ordtmp = signal[ii];
1319 signal[ii]=signal[maxi];
1320 signal[maxi]=ordtmp;
1328 fSegmentation->GetPadIxz(clusterI->X(),clusterI->Z(),ix,iz);
1329 dig = (AliITSdigitSDD*)fMap->GetHit(iz-1,ix-1);
1330 // if null try neighbours
1331 if (!dig) dig = (AliITSdigitSDD*)fMap->GetHit(iz-1,ix);
1332 if (!dig) dig = (AliITSdigitSDD*)fMap->GetHit(iz-1,ix+1);
1333 if (!dig) printf("SDD: cannot assign the track number!\n");
1336 AliITSRecPoint rnew;
1337 rnew.SetX(clusterI->X());
1338 rnew.SetZ(clusterI->Z());
1339 rnew.SetQ(clusterI->Q()); // in KeV - should be ADC
1340 // cout<<"Cluster # "<<i<< " - X,Z,Q= "<<clusterI->X()<<" "<<clusterI->Z()<<" "<<clusterI->Q()<<"; Digit n= "<<idx<<endl;
1341 rnew.SetdEdX(kconvGeV*clusterI->Q());
1342 rnew.SetSigmaX2(kRMSx*kRMSx);
1343 rnew.SetSigmaZ2(kRMSz*kRMSz);
1345 if(notr>=0)for(j=0;j<notr;j++)rnew.fTracks[j]=trks[j];
1348 for(j=0;j<dig->GetNTracks();j++){
1349 if(j>0 && j%4==0)cout<<endl;
1352 rnew.fTracks[0] = dig->fTracks[0];
1353 cout<<" "<<dig->fTracks[0]<<" assigned to rp 0 "<<rnew.fTracks[0]<<endl;
1354 rnew.fTracks[1] = -3;
1355 rnew.fTracks[2] = -3;
1357 while(rnew.fTracks[0]==dig->fTracks[j] &&
1358 j<dig->GetNTracks()) j++;
1359 if(j<dig->GetNTracks()){
1360 rnew.fTracks[1] = dig->fTracks[j];
1361 cout<<" Digit "<<j<<" "<<dig->fTracks[j]<<" assigned to rp 1 "<<rnew.fTracks[1]<<endl;
1362 while((rnew.fTracks[0]==dig->fTracks[j] ||
1363 rnew.fTracks[1]==dig->fTracks[j] )&&
1364 j<dig->GetNTracks()) j++;
1365 if(j<dig->GetNTracks()) {
1366 rnew.fTracks[2] = dig->fTracks[j];
1367 cout<<" Digit "<<j<<" "<<dig->fTracks[j]<<" assigned to rp 2 "<<rnew.fTracks[2]<<endl;
1373 iTS->AddRecPoint(rnew);
1375 // fMap->ClearMap();
1377 //______________________________________________________________________
1378 void AliITSClusterFinderSDD::FindRawClusters(Int_t mod){
1379 // find raw clusters
1389 //_______________________________________________________________________
1390 void AliITSClusterFinderSDD::Print() const{
1391 // Print SDD cluster finder Parameters
1393 cout << "**************************************************" << endl;
1394 cout << " Silicon Drift Detector Cluster Finder Parameters " << endl;
1395 cout << "**************************************************" << endl;
1396 cout << "Number of Clusters: " << fNclusters << endl;
1397 cout << "Anode Tolerance: " << fDAnode << endl;
1398 cout << "Time Tolerance: " << fDTime << endl;
1399 cout << "Time correction (electronics): " << fTimeCorr << endl;
1400 cout << "Cut Amplitude (threshold): " << fCutAmplitude << endl;
1401 cout << "Minimum Amplitude: " << fMinPeak << endl;
1402 cout << "Minimum Charge: " << fMinCharge << endl;
1403 cout << "Minimum number of cells/clusters: " << fMinNCells << endl;
1404 cout << "Maximum number of cells/clusters: " << fMaxNCells << endl;
1405 cout << "**************************************************" << endl;