]>
Commit | Line | Data |
---|---|---|
e4f2f73d | 1 | #ifndef ALITRDRECOPARAM_H |
2 | #define ALITRDRECOPARAM_H | |
3 | /* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. * | |
4ba1d6ae | 4 | * See cxx source for full Copyright notice */ |
e4f2f73d | 5 | |
6 | /* $Id$ */ | |
7 | ||
8 | //////////////////////////////////////////////////////////////////////////// | |
9 | // // | |
10 | // Parameter class for the TRD reconstruction // | |
11 | // // | |
12 | //////////////////////////////////////////////////////////////////////////// | |
13 | ||
14 | #ifndef ALIDETECTORRECOPARAM_H | |
15 | #include "AliDetectorRecoParam.h" | |
16 | #endif | |
17 | ||
18 | class AliTRDrecoParam : public AliDetectorRecoParam | |
19 | { | |
4ba1d6ae | 20 | public: |
21 | enum AliTRDpidMethod{ | |
22 | kLQPID = 0, | |
23 | kNNPID = 1 | |
24 | }; | |
25 | ||
26 | AliTRDrecoParam(); | |
a7ac01d2 | 27 | AliTRDrecoParam(const AliTRDrecoParam &rec); |
4ba1d6ae | 28 | ~AliTRDrecoParam() { } |
29 | ||
a7ac01d2 | 30 | Int_t GetADCbaseline() const { return fADCbaseline; }; |
4ba1d6ae | 31 | Double_t GetChi2Y() const { return fkChi2Y; } |
32 | Double_t GetChi2Z() const { return fkChi2Z; } | |
4ba1d6ae | 33 | Double_t GetFindableClusters() const { return fkFindable; } |
34 | Double_t GetMaxTheta() const { return fkMaxTheta; } | |
35 | Double_t GetMaxPhi() const { return fkMaxPhi; } | |
36 | Int_t GetNdEdxSlices() const { return fkPIDMethod == kNNPID ? kNNslices : kLQslices;} | |
37 | AliTRDpidMethod GetPIDMethod() const { return fkPIDMethod;} | |
3afdab72 | 38 | Double_t GetPlaneQualityThreshold() const { return fkPlaneQualityThreshold; } |
4ba1d6ae | 39 | Double_t GetRoad0y() const { return fkRoad0y; } |
40 | Double_t GetRoad0z() const { return fkRoad0z; } | |
4ba1d6ae | 41 | Double_t GetRoad1y() const { return fkRoad1y; } |
42 | Double_t GetRoad1z() const { return fkRoad1z; } | |
4ba1d6ae | 43 | Double_t GetRoad2y() const { return fkRoad2y; } |
44 | Double_t GetRoad2z() const { return fkRoad2z; } | |
4ba1d6ae | 45 | Double_t GetTrackLikelihood() const { return fkTrackLikelihood; } |
46 | Int_t GetStreamLevel() const { return fkStreamLevel; } | |
a7ac01d2 | 47 | inline void GetSysCovMatrix(Double_t *sys); |
4ba1d6ae | 48 | Double_t GetMinMaxCutSigma() const { return fMinMaxCutSigma; }; |
49 | Double_t GetMinLeftRightCutSigma() const { return fMinLeftRightCutSigma; }; | |
50 | Double_t GetClusMaxThresh() const { return fClusMaxThresh; }; | |
51 | Double_t GetClusSigThresh() const { return fClusSigThresh; }; | |
52 | Int_t GetTCnexp() const { return fTCnexp; }; | |
4e459a9d | 53 | Int_t GetNumberOfPresamples() const {return fNumberOfPresamples;} |
54 | Int_t GetNumberOfPostsamples() const {return fNumberOfPostsamples;} | |
4ba1d6ae | 55 | |
d20df6fc | 56 | |
4ba1d6ae | 57 | static AliTRDrecoParam *GetLowFluxParam(); |
58 | static AliTRDrecoParam *GetHighFluxParam(); | |
59 | static AliTRDrecoParam *GetCosmicTestParam(); | |
60 | ||
a7ac01d2 | 61 | Bool_t IsClusterSharing() const { return TestBit(kClusterSharing);} |
62 | Bool_t IsLUT() const { return TestBit(kLUT);} | |
63 | Bool_t IsSeeding() const { return TestBit(kSeeding); } | |
64 | Bool_t IsTailCancelation() const { return TestBit(kTC);} | |
65 | Bool_t IsVertexConstrained() const { return TestBit(kVertexConstrained); } | |
9c7c9ec1 | 66 | Bool_t IsTrackletWriteEnabled() const { return fTrackletWriteEnabled ; }; |
67 | ||
a7ac01d2 | 68 | |
69 | ||
4e459a9d | 70 | void SetFindableClusters(Double_t r) {fkFindable = r;} |
a7ac01d2 | 71 | void SetClusterSharing(Bool_t share = kTRUE) { SetBit(kClusterSharing, share); }; |
4ba1d6ae | 72 | void SetPIDMethod(AliTRDpidMethod pid) { fkPIDMethod = pid; }; |
a7ac01d2 | 73 | void SetSeeding(Bool_t so = kTRUE) { SetBit(kSeeding, so); } |
74 | void SetVertexConstrained(Bool_t vc = kTRUE) { SetBit(kVertexConstrained, vc); } | |
4ba1d6ae | 75 | void SetStreamLevel(Int_t streamLevel= 1) { fkStreamLevel = streamLevel; } |
a7ac01d2 | 76 | void SetLUT(Bool_t lut = kTRUE) { SetBit(kLUT, lut);}; |
4ba1d6ae | 77 | void SetMinMaxCutSigma(Float_t minMaxCutSigma) { fMinMaxCutSigma = minMaxCutSigma; }; |
78 | void SetMinLeftRightCutSigma(Float_t minLeftRightCutSigma) { fMinLeftRightCutSigma = minLeftRightCutSigma; }; | |
79 | void SetClusMaxThresh(Float_t thresh) { fClusMaxThresh = thresh; }; | |
80 | void SetClusSigThresh(Float_t thresh) { fClusSigThresh = thresh; }; | |
a7ac01d2 | 81 | void SetTailCancelation(Bool_t tc = kTRUE) { SetBit(kTC, tc); }; |
4ba1d6ae | 82 | void SetNexponential(Int_t nexp) { fTCnexp = nexp; }; |
83 | void SetADCbaseline(Int_t base) { fADCbaseline = base; }; | |
3afdab72 | 84 | inline void SetSysCovMatrix(Double_t *sys); |
4e459a9d | 85 | void SetNumberOfPresamples(Int_t n) {fNumberOfPresamples = n;} |
86 | void SetNumberOfPostsamples(Int_t n) {fNumberOfPostsamples = n;} | |
9c7c9ec1 | 87 | void SetTrackletWriteEnabled(Bool_t enablewritetracklet = kFALSE) { fTrackletWriteEnabled = enablewritetracklet; }; |
88 | ||
4ba1d6ae | 89 | |
90 | private: | |
91 | enum{ | |
a7ac01d2 | 92 | kNNslices = 8 |
93 | ,kLQslices = 3 | |
4ba1d6ae | 94 | }; |
95 | ||
a7ac01d2 | 96 | enum{ |
97 | kClusterSharing = 1 // Toggle cluster sharing | |
98 | ,kSeeding = 2 // Do stand alone tracking in the TRD | |
99 | ,kVertexConstrained = 3 // Perform vertex constrained fit | |
100 | ,kLUT = 4 // | |
101 | ,kTC = 5 // tail cancelation | |
102 | }; | |
4ba1d6ae | 103 | |
4ba1d6ae | 104 | AliTRDpidMethod fkPIDMethod; // PID method selector 0(LQ) 1(NN) |
105 | Double_t fkMaxTheta; // Maximum theta | |
106 | Double_t fkMaxPhi; // Maximum phi | |
107 | ||
108 | Double_t fkRoad0y; // Road for middle cluster | |
109 | Double_t fkRoad0z; // Road for middle cluster | |
110 | ||
111 | Double_t fkRoad1y; // Road in y for seeded cluster | |
112 | Double_t fkRoad1z; // Road in z for seeded cluster | |
113 | ||
114 | Double_t fkRoad2y; // Road in y for extrapolated cluster | |
115 | Double_t fkRoad2z; // Road in z for extrapolated cluster | |
116 | ||
117 | Double_t fkPlaneQualityThreshold; // Quality threshold | |
118 | Double_t fkFindable; // Ratio of clusters from a track in one chamber which are at minimum supposed to be found. | |
119 | Double_t fkChi2Z; // Max chi2 on the z direction for seeding clusters fit | |
120 | Double_t fkChi2Y; // Max chi2 on the y direction for seeding clusters Rieman fit | |
121 | Double_t fkTrackLikelihood; // Track likelihood for tracklets Rieman fit | |
122 | Int_t fkStreamLevel; // Streaming Level in TRD Reconstruction | |
123 | ||
3afdab72 | 124 | Double_t fSysCovMatrix[5]; // Systematic uncertainty from calibration and alignment for each tracklet |
e4f2f73d | 125 | |
a7ac01d2 | 126 | // Clusterization parameter |
4ba1d6ae | 127 | Double_t fMinMaxCutSigma; // Threshold sigma noise pad middle |
128 | Double_t fMinLeftRightCutSigma; // Threshold sigma noise sum pad | |
129 | Double_t fClusMaxThresh; // Threshold value for cluster maximum | |
130 | Double_t fClusSigThresh; // Threshold value for cluster signal | |
4ba1d6ae | 131 | Int_t fTCnexp; // Number of exponentials, digital filter |
fc546d21 | 132 | |
4ba1d6ae | 133 | // ADC parameter |
134 | Int_t fADCbaseline; // ADC baseline to be subtracted | |
4e459a9d | 135 | Int_t fNumberOfPresamples; // number of presamples |
136 | Int_t fNumberOfPostsamples; // number of postsamples | |
9716329b | 137 | |
9c7c9ec1 | 138 | // Tracklet writing Switch |
139 | Bool_t fTrackletWriteEnabled; // Switch for writing tracklets | |
140 | ||
4ba1d6ae | 141 | ClassDef(AliTRDrecoParam, 4) // Reconstruction parameters for TRD detector |
e4f2f73d | 142 | |
143 | }; | |
3afdab72 | 144 | |
145 | //___________________________________________________ | |
146 | inline void AliTRDrecoParam::GetSysCovMatrix(Double_t *sys) | |
147 | { | |
148 | if(!sys) return; | |
149 | memcpy(sys, fSysCovMatrix, 5*sizeof(Double_t)); | |
150 | } | |
151 | ||
152 | //___________________________________________________ | |
153 | inline void AliTRDrecoParam::SetSysCovMatrix(Double_t *sys) | |
154 | { | |
155 | if(!sys) return; | |
156 | memcpy(fSysCovMatrix, sys, 5*sizeof(Double_t)); | |
157 | } | |
158 | ||
159 | ||
160 | ||
e4f2f73d | 161 | #endif |