#include "AliTPCTransform.h"
#include "AliTPCclustererMI.h"
+using std::cerr;
+using std::endl;
ClassImp(AliTPCclustererMI)
fUseHLTClusters(4),
fAllBins(NULL),
fAllSigBins(NULL),
- fAllNSigBins(NULL)
+ fAllNSigBins(NULL),
+ fHLTClusterAccess(NULL)
{
//
// COSNTRUCTOR
delete [] fAllBins;
delete [] fAllSigBins;
delete [] fAllNSigBins;
+ if (fHLTClusterAccess) delete fHLTClusterAccess;
}
void AliTPCclustererMI::SetInput(TTree * tree)
fOutput= tree;
AliTPCClustersRow clrow("AliTPCclusterMI");
AliTPCClustersRow *pclrow=&clrow;
- fOutput->Branch("Segment","AliTPCClustersRow",&pclrow,32000/4);
- tree->SetAutoFlush(20);
+ fOutput->Branch("Segment","AliTPCClustersRow",&pclrow,32000,200);
}
AliTPCclusterMI &c)
{
//
+ // Make cluster: characterized by position ( mean- COG) , shape (RMS) a charge, QMax and Q tot
+ // Additional correction:
+ // a) To correct for charge below threshold, in the +1 neghborhood to the max charge charge
+ // is extrapolated using gaussian approximation assuming given cluster width..
+ // Additional empirical factor is used to account for the charge fluctuation (kVirtualChargeFactor).
+ // Actual value of the kVirtualChargeFactor should obtained minimimizing residuals between the cluster
+ // and track interpolation.
+ // b.) For space points with extended shape (in comparison with expected using parameterization) clusters are
+ // unfoded
+ //
+ // NOTE. Actual/Empirical values for correction are hardwired in the code.
+ //
+ // Input paramters for function:
// k - Make cluster at position k
// bins - 2 D array of signals mapped to 1 dimensional array -
// max - the number of time bins er one dimension
- // c - refernce to cluster to be filled
+ // c - reference to cluster to be filled
//
+ Double_t kVirtualChargeFactor=0.5;
Int_t i0=k/max; //central pad
Int_t j0=k%max; //central time bin
Float_t ratio = TMath::Exp(-1.2*TMath::Abs(di)/sigmay2)*TMath::Exp(-1.2*TMath::Abs(dj)/sigmaz2);
amp = ((matrix[2][0]-2)*(matrix[2][0]-2)/(matrix[-di+2][-dj]+2))*ratio;
if (amp>2) amp = 2;
- vmatrix[2+di][2+dj]=amp;
+ vmatrix[2+di][2+dj]= kVirtualChargeFactor*amp;
vmatrix[2+2*di][2+2*dj]=0;
if ( (di*dj)!=0){
//DIAGONAL ELEMENTS
fParam->Dump();
fRecoParam->Dump();
}
+ fRowDig = NULL;
//-----------------------------------------------------------------
// Use HLT clusters
// used in Digits2Clusters
//
- TObject* pClusterAccess=NULL;
+ if (!fHLTClusterAccess) {
TClass* pCl=NULL;
ROOT::NewFunc_t pNewFunc=NULL;
do {
AliError("unable to create instance of AliHLTTPCClusterAccessHLTOUT");
return -2;
}
- pClusterAccess=reinterpret_cast<TObject*>(p);
- if (!pClusterAccess) {
- AliError("instance not of type TObject");
- return -3 ;
+ fHLTClusterAccess=reinterpret_cast<TObject*>(p);
}
+ TObject* pClusterAccess=fHLTClusterAccess;
+
const Int_t kNIS = fParam->GetNInnerSector();
const Int_t kNOS = fParam->GetNOuterSector();
const Int_t kNS = kNIS + kNOS;
fNclusters = 0;
+ // make sure that all clusters from the previous event are cleared
+ pClusterAccess->Clear("event");
for(fSector = 0; fSector < kNS; fSector++) {
Int_t iResult = 1;
TString param("sector="); param+=fSector;
- pClusterAccess->Clear();
+ // prepare for next sector
+ pClusterAccess->Clear("sector");
pClusterAccess->Execute("read", param, &iResult);
if (iResult < 0) {
return iResult;
AliError("HLT Clusters can not be found");
}
- if (pClusterAccess->FindObject("clusterarray")==NULL) {
+ TObject* pObj=pClusterAccess->FindObject("clusterarray");
+ if (pObj==NULL) {
AliError("HLT clusters requested, but not cluster array not present");
return -4;
}
- TClonesArray* clusterArray=dynamic_cast<TClonesArray*>(pClusterAccess->FindObject("clusterarray"));
+ TObjArray* clusterArray=dynamic_cast<TClonesArray*>(pObj);
if (!clusterArray) {
AliError("HLT cluster array is not of class type TClonesArray");
return -5;
fNclusters+=nClusterSector;
} // for(fSector = 0; fSector < kNS; fSector++) {
- delete pClusterAccess;
+ pClusterAccess->Clear("event");
Info("Digits2Clusters", "Number of converted HLT clusters : %d", fNclusters);