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 **************************************************************************/
16 /* $Id: AliTRDtrackingChamber.cxx 23810 2008-02-08 09:00:27Z hristov $ */
18 ////////////////////////////////////////////////////////////////////////////
20 // Tracking in one chamber //
23 // Alex Bercuci <A.Bercuci@gsi.de> //
24 // Markus Fasel <M.Fasel@gsi.de> //
26 ////////////////////////////////////////////////////////////////////////////
28 #include "AliTRDtrackingChamber.h"
31 #include "TMatrixTBase.h"
32 #include <TTreeStream.h>
34 #include "AliTRDReconstructor.h"
35 #include "AliTRDrecoParam.h"
36 #include "AliTRDtrackerV1.h"
37 #include "AliTRDgeometry.h"
38 #include "AliTRDpadPlane.h"
39 #include "AliTRDcalibDB.h"
40 #include "AliTRDCommonParam.h"
41 #include "Cal/AliTRDCalDet.h"
42 #include "Cal/AliTRDCalROC.h"
44 ClassImp(AliTRDtrackingChamber)
46 //_______________________________________________________
47 AliTRDtrackingChamber::AliTRDtrackingChamber()
59 //_______________________________________________________
60 void AliTRDtrackingChamber::Clear(const Option_t *opt)
62 for(Int_t itb=0; itb<AliTRDseedV1::kNtb; itb++) fTB[itb].Clear(opt);
65 //_______________________________________________________
66 Bool_t AliTRDtrackingChamber::Build(AliTRDgeometry *const geo, Bool_t hlt)
68 // Init chamber and all time bins (AliTRDchamberTimeBin)
69 // Calculates radial position of the chamber based on
70 // radial positions of the time bins (calibration/alignment aware)
72 if(fDetector < 0 || fDetector >= AliTRDgeometry::kNdet){
73 AliWarning(Form("Detector index not set correctly to %d", fDetector));
77 Int_t stack = AliTRDgeometry::GetStack(fDetector);
78 Int_t layer = AliTRDgeometry::GetLayer(fDetector);
79 AliTRDpadPlane *pp = geo->GetPadPlane(layer, stack);
80 Double_t zl = pp->GetRow0ROC() - pp->GetRowEndROC();
81 Double_t z0 = geo->GetRow0(layer, stack, 0) - zl;
82 Int_t nrows = pp->GetNrows();
84 Int_t index[50], jtb = 0;
85 for(Int_t itb=0; itb<AliTRDseedV1::kNtb; itb++){
86 if(!fTB[itb]) continue;
87 fTB[itb].SetRange(z0, zl);
88 fTB[itb].SetNRows(nrows);
89 fTB[itb].BuildIndices();
92 if(jtb<2) return kFALSE;
94 AliTRDcalibDB *calib = AliTRDcalibDB::Instance();
97 t0 = calib->GetT0Average(fDetector);
99 t0 = calib->GetT0Det()->GetValue(fDetector);
101 // fVD = calib->GetVdriftAverage(fDetector);
102 // fS2PRF = calib->GetPRFROC(fDetector)->GetMean(); fS2PRF *= fS2PRF;
103 // fExB = AliTRDCommonParam::Instance()->GetOmegaTau(fVD);
104 // AliTRDCommonParam::Instance()->GetDiffCoeff(fDiffL, fDiffT, fVD);
106 // ESTIMATE POSITION OF PAD PLANE FOR THIS CHAMBER
107 fTB[Int_t(t0)].SetT0();
108 Double_t x0 = fTB[index[0]].GetX();
109 Double_t x1 = fTB[index[1]].GetX();
110 Double_t dx = (x0 - x1)/(index[1] - index[0]);
111 fX0 = x0 + dx*(index[0] - t0);
115 //_______________________________________________________
116 Int_t AliTRDtrackingChamber::GetNClusters() const
119 // Returns number of clusters in chamber
122 for(Int_t itb=0; itb<AliTRDseedV1::kNtb; itb++){
123 n += Int_t(fTB[itb]);
128 //_______________________________________________________
129 void AliTRDtrackingChamber::Bootstrap(const AliTRDReconstructor *rec)
132 // Bootstrap each time bin
134 AliTRDchamberTimeBin *jtb = &fTB[0];
135 for(Int_t itb=0; itb<AliTRDseedV1::kNtb; itb++, ++jtb){
136 (*jtb).Bootstrap(rec, fDetector);
140 //_______________________________________________________
141 void AliTRDtrackingChamber::SetOwner()
144 // Set ownership in time bins
146 AliTRDchamberTimeBin *jtb = &fTB[0];
147 for(Int_t itb=0; itb<AliTRDseedV1::kNtb; itb++, ++jtb){
148 if(!(Int_t(*jtb))) continue;
153 //_______________________________________________________
154 Double_t AliTRDtrackingChamber::GetQuality()
157 // Calculate chamber quality for seeding.
161 // layers : Array of propagation layers for this plane.
164 // plane quality factor for seeding
166 // Detailed description
168 // The quality of the plane for seeding is higher if:
169 // 1. the average timebin population is closer to an integer number
170 // 2. the distribution of clusters/timebin is closer to a uniform distribution.
171 // - the slope of the first derivative of a parabolic fit is small or
172 // - the slope of a linear fit is small
178 for(int itb=0; itb<AliTRDseedV1::kNtb; itb++){
179 if(!(nClLayer = fTB[itb].GetNClusters())) continue;
181 for(Int_t incl = 0; incl < nClLayer; incl++){
182 if((fTB[itb].GetCluster(incl))->IsUsed()) nused++;
186 // calculate the deviation of the mean number of clusters from the
187 // closest integer values
188 Float_t nclMed = float(ncl-nused)/AliTRDtrackerV1::GetNTimeBins();
189 Int_t ncli = Int_t(nclMed);
190 Float_t nclDev = TMath::Abs(nclMed - TMath::Max(ncli, 1));
191 nclDev -= (nclDev>.5) && ncli ? 1. : 0.;
192 return TMath::Exp(-5.*TMath::Abs(nclDev));
194 // // get slope of the derivative
195 // if(!fitter.Eval()) return quality;
196 // fitter.PrintResults(3);
197 // Double_t a = fitter.GetParameter(1);
199 // printf("ncl_dev(%f) a(%f)\n", ncl_dev, a);
200 // return quality*TMath::Exp(-a);
205 //_______________________________________________________
206 Bool_t AliTRDtrackingChamber::GetSeedingLayer(AliTRDchamberTimeBin *&fakeLayer, AliTRDgeometry * const geo, const AliTRDReconstructor *rec)
209 // Creates a seeding layer
213 const Int_t kMaxRows = 16;
214 const Int_t kMaxCols = 144;
215 const Int_t kMaxPads = 2304;
216 Int_t timeBinMin = rec->GetRecoParam()->GetNumberOfPresamples();
217 Int_t timeBinMax = rec->GetRecoParam()->GetNumberOfPostsamples();
219 // Get the geometrical data of the chamber
220 Int_t layer = geo->GetLayer(fDetector);
221 Int_t stack = geo->GetStack(fDetector);
222 Int_t sector= geo->GetSector(fDetector);
223 AliTRDpadPlane *pp = geo->GetPadPlane(layer, stack);
224 Int_t nCols = pp->GetNcols();
225 Float_t ymin = TMath::Min(pp->GetCol0(), pp->GetColEnd());
226 Float_t ymax = TMath::Max(pp->GetCol0(), pp->GetColEnd());
227 Float_t zmin = TMath::Min(pp->GetRow0(), pp->GetRowEnd());
228 Float_t zmax = TMath::Max(pp->GetRow0(), pp->GetRowEnd());
229 Float_t z0 = -1., zl = -1.;
230 Int_t nRows = pp->GetNrows();
231 Float_t binlength = (ymax - ymin)/nCols;
232 //AliInfo(Form("ymin(%f) ymax(%f) zmin(%f) zmax(%f) nRows(%d) binlength(%f)", ymin, ymax, zmin, zmax, nRows, binlength));
234 // Fill the histogram
236 Int_t *histogram[kMaxRows]; // 2D-Histogram
237 Int_t hvals[kMaxPads + 1]; memset(hvals, 0, sizeof(Int_t)*kMaxPads); // one entry in addition for termination flag
238 Float_t *sigmas[kMaxRows];
239 Float_t svals[kMaxPads]; memset(svals, 0, sizeof(Float_t)*kMaxPads);
240 AliTRDcluster *c = NULL;
241 for(Int_t irs = 0; irs < kMaxRows; irs++){
242 histogram[irs] = &hvals[irs*kMaxCols];
243 sigmas[irs] = &svals[irs*kMaxCols];
245 for(Int_t iTime = timeBinMin; iTime < AliTRDseedV1::kNtb-timeBinMax; iTime++){
246 if(!(nClusters = fTB[iTime].GetNClusters())) continue;
247 z0 = fTB[iTime].GetZ0();
248 zl = fTB[iTime].GetDZ0();
249 for(Int_t incl = 0; incl < nClusters; incl++){
250 c = fTB[iTime].GetCluster(incl);
251 histogram[c->GetPadRow()][c->GetPadCol()]++;
252 sigmas[c->GetPadRow()][c->GetPadCol()] += c->GetSigmaZ2();
256 // Now I have everything in the histogram, do the selection
257 //Int_t nPads = nCols * nRows;
258 // This is what we are interested in: The center of gravity of the best candidates
259 Float_t cogyvals[kMaxPads]; memset(cogyvals, 0, sizeof(Float_t)*kMaxPads);
260 Float_t cogzvals[kMaxPads]; memset(cogzvals, 0, sizeof(Float_t)*kMaxPads);
261 Float_t *cogy[kMaxRows];
262 Float_t *cogz[kMaxRows];
264 // Lookup-Table storing coordinates according to the bins
265 Float_t yLengths[kMaxCols]; memset(yLengths, 0, kMaxCols*sizeof(Float_t));
266 Float_t zLengths[kMaxRows]; memset(zLengths, 0, kMaxRows*sizeof(Float_t));
267 for(Int_t icnt = 0; icnt < nCols; icnt++){
268 yLengths[icnt] = pp->GetColPos(nCols - 1 - icnt) + binlength/2;
270 for(Int_t icnt = 0; icnt < nRows; icnt++){
271 zLengths[icnt] = pp->GetRowPos(icnt) - pp->GetRowSize(icnt)/2;
274 // A bitfield is used to mask the pads as usable
275 Short_t mask[kMaxCols]; memset(mask, 0 ,sizeof(Short_t) * kMaxCols);//bool mvals[kMaxPads];
276 for(UChar_t icount = 0; icount < nRows; icount++){
277 cogy[icount] = &cogyvals[icount*kMaxCols];
278 cogz[icount] = &cogzvals[icount*kMaxCols];
280 // In this array the array position of the best candidates will be stored
281 Int_t cand[AliTRDtrackerV1::kMaxTracksStack];
282 Float_t sigcands[AliTRDtrackerV1::kMaxTracksStack];
285 Int_t indices[kMaxPads]; memset(indices, -1, sizeof(Int_t)*kMaxPads);
286 Int_t nCandidates = 0;
288 // histogram filled -> Select best bins
289 Int_t nPads = nCols * nRows;
290 // take out all the bins which have less than 3 entries (faster sorting)
291 Int_t content[kMaxPads], dictionary[kMaxPads], nCont = 0, padnumber = 0;
292 Int_t *iter = &hvals[0], *citer = &content[0], *diter = &dictionary[0]; // iterators for preselection
293 const Int_t threshold = 2;
294 hvals[nPads] = -1; // termination for iterator
296 if(*iter > threshold){
298 *(diter++) = padnumber;
302 }while(*(++iter) != -1);
303 TMath::Sort(nCont, content, indices);
305 Int_t col, row, lower, lower1, upper, upper1;
306 for(Int_t ib = 0; ib < nCont; ib++){
307 if(nCandidates >= AliTRDtrackerV1::kMaxTracksStack){
308 AliDebug(1, Form("Number of seed candidates %d exceeded maximum allowed per stack %d", nCandidates, AliTRDtrackerV1::kMaxTracksStack));
312 row = dictionary[indices[ib]]/nCols;
313 col = dictionary[indices[ib]]%nCols;
314 // here will be the threshold condition:
315 if((mask[col] & (1 << row)) != 0) continue; // Pad is masked: continue
316 // if(histogram[row][col] < TMath::Max(threshold, 1)){ // of course at least one cluster is needed
317 // break; // number of clusters below threshold: break;
319 // passing: Mark the neighbors
320 lower = TMath::Max(col - 1, 0); upper = TMath::Min(col + 2, nCols);
321 lower1 = TMath::Max(row - 1, 0); upper1 = TMath::Min(row + 2, nCols);
322 for(Int_t ic = lower; ic < upper; ++ic)
323 for(Int_t ir = lower1; ir < upper1; ++ir){
324 if(ic == col && ir == row) continue;
325 mask[ic] |= (1 << ir);
327 // Storing the position in an array
328 // testing for neigboring
331 lower = TMath::Max(col - 1, 0);
332 upper = TMath::Min(col + 2, nCols);
333 for(Int_t inb = lower; inb < upper; ++inb){
334 cogv += yLengths[inb] * histogram[row][inb];
335 norm += histogram[row][inb];
337 cogy[row][col] = cogv / norm;
339 lower = TMath::Max(row - 1, 0);
340 upper = TMath::Min(row + 2, nRows);
341 for(Int_t inb = lower; inb < upper; ++inb){
342 cogv += zLengths[inb] * histogram[inb][col];
343 norm += histogram[inb][col];
345 cogz[row][col] = Float_t(cogv) / norm;
347 cand[nCandidates] = row*nCols + col; // store the position of a passig candidate into an Array
348 sigcands[nCandidates] = sigmas[row][col] / histogram[row][col]; // never be a floating point exeption
352 if(!nCandidates) return kFALSE;
354 Float_t pos[3], sig[2];
355 Short_t signal[7]; memset(&signal[0], 0, 7*sizeof(Short_t));
357 new(fakeLayer) AliTRDchamberTimeBin(layer, stack, sector, z0, zl);
358 fakeLayer->SetReconstructor(rec);
359 fakeLayer->SetNRows(nRows);
360 fakeLayer->SetOwner(kFALSE);
362 UInt_t fakeIndex = 0;
363 for(Int_t ican = 0; ican < nCandidates; ican++){
364 row = cand[ican] / nCols;
365 col = cand[ican] % nCols;
367 Int_t n = 0; Double_t x = 0., y = 0., z = 0.;
368 for(int itb=0; itb<AliTRDseedV1::kNtb; itb++){
369 if(!(nClusters = fTB[itb].GetNClusters())) continue;
370 for(Int_t incl = 0; incl < nClusters; incl++){
371 c = fTB[itb].GetCluster(incl);
372 if(c->GetPadRow() != row) continue;
373 if(TMath::Abs(c->GetPadCol() - col) > 2) continue;
384 sig[1] = sigcands[ican];
385 fakeLayer->InsertCluster(new AliTRDcluster(fDetector, 0., pos, sig, NULL, 3, signal, col, row, 0, 0, 0., 0), fakeIndex++);
388 fakeLayer->BuildIndices();
389 //fakeLayer->Print();
391 if(rec->GetRecoParam()->GetStreamLevel(AliTRDrecoParam::kTracker) >= 3){
392 //TMatrixD hist(nRows, nCols);
393 //for(Int_t i = 0; i < nRows; i++)
394 // for(Int_t j = 0; j < nCols; j++)
395 // hist(i,j) = histogram[i][j];
396 TTreeSRedirector &cstreamer = *rec->GetDebugStream(AliTRDrecoParam::kTracker);
397 cstreamer << "GetSeedingLayer"
403 << "L.=" << fakeLayer
404 //<< "Histogram.=" << &hist
412 //_______________________________________________________
413 void AliTRDtrackingChamber::Print(Option_t *opt) const
415 // Print the chamber status
416 if(!GetNClusters()) return;
417 AliInfo(Form("fDetector = %d", fDetector));
418 AliInfo(Form("fX0 = %7.3f", fX0));
419 const AliTRDchamberTimeBin *itb = &fTB[0];
420 for(Int_t jtb=0; jtb<AliTRDseedV1::kNtb; jtb++, itb++) (*itb).Print(opt);
424 //_______________________________________________________
425 void AliTRDtrackingChamber::Update()
427 // Steer purging of used and shared clusters
429 AliTRDchamberTimeBin *jtb = &fTB[0];
430 for(Int_t itb=AliTRDseedV1::kNtb; itb--; ++jtb){
431 if(!(Int_t(*jtb))) continue;
432 (*jtb).BuildIndices();