[u/mrichter/AliRoot.git] / TRD / AliTRDclusterizerV1.cxx

/**************************************************************************
 * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
 *                                                                        *
 * Author: The ALICE Off-line Project.                                    *
 * Contributors are mentioned in the code where appropriate.              *
 *                                                                        *
 * Permission to use, copy, modify and distribute this software and its   *
 * documentation strictly for non-commercial purposes is hereby granted   *
 * without fee, provided that the above copyright notice appears in all   *
 * copies and that both the copyright notice and this permission notice   *
 * appear in the supporting documentation. The authors make no claims     *
 * about the suitability of this software for any purpose. It is          *
 * provided "as is" without express or implied warranty.                  *
 **************************************************************************/

/* $Id$ */

///////////////////////////////////////////////////////////////////////////////
//                                                                           //
// TRD cluster finder for the slow simulator. 
//                                                                           //
///////////////////////////////////////////////////////////////////////////////

#include <TF1.h>
#include <TTree.h>
#include <TH1.h>
#include <TFile.h>

#include "AliRun.h"
#include "AliRunLoader.h"
#include "AliLoader.h"

#include "AliTRDclusterizerV1.h"
#include "AliTRDmatrix.h"
#include "AliTRDgeometry.h"
#include "AliTRDdataArrayF.h"
#include "AliTRDdataArrayI.h"
#include "AliTRDdigitsManager.h"
#include "AliTRDparameter.h"

ClassImp(AliTRDclusterizerV1)

//_____________________________________________________________________________
AliTRDclusterizerV1::AliTRDclusterizerV1():AliTRDclusterizer()
{
  //
  // AliTRDclusterizerV1 default constructor
  //

  fDigitsManager = 0;

}

//_____________________________________________________________________________
AliTRDclusterizerV1::AliTRDclusterizerV1(const Text_t* name, const Text_t* title)
                    :AliTRDclusterizer(name,title)
{
  //
  // AliTRDclusterizerV1 default constructor
  //

  fDigitsManager = new AliTRDdigitsManager();
  fDigitsManager->CreateArrays();

}

//_____________________________________________________________________________
AliTRDclusterizerV1::AliTRDclusterizerV1(const AliTRDclusterizerV1 &c)
:AliTRDclusterizer(c)
{
  //
  // AliTRDclusterizerV1 copy constructor
  //

  ((AliTRDclusterizerV1 &) c).Copy(*this);

}

//_____________________________________________________________________________
AliTRDclusterizerV1::~AliTRDclusterizerV1()
{
  //
  // AliTRDclusterizerV1 destructor
  //

  if (fDigitsManager) {
    delete fDigitsManager;
    fDigitsManager = NULL;
  }

}

//_____________________________________________________________________________
AliTRDclusterizerV1 &AliTRDclusterizerV1::operator=(const AliTRDclusterizerV1 &c)
{
  //
  // Assignment operator
  //

  if (this != &c) ((AliTRDclusterizerV1 &) c).Copy(*this);
  return *this;

}

//_____________________________________________________________________________
void AliTRDclusterizerV1::Copy(TObject &c)
{
  //
  // Copy function
  //

  ((AliTRDclusterizerV1 &) c).fDigitsManager = 0;

  AliTRDclusterizer::Copy(c);

}

//_____________________________________________________________________________
Bool_t AliTRDclusterizerV1::ReadDigits()
{
  //
  // Reads the digits arrays from the input aliroot file
  //

  if (!fRunLoader) {
    printf("<AliTRDclusterizerV1::ReadDigits> ");
    printf("No input file open\n");
    return kFALSE;
  }
  AliLoader* loader = fRunLoader->GetLoader("TRDLoader");
  if (!loader->TreeD()) loader->LoadDigits();

  // Read in the digit arrays
  return (fDigitsManager->ReadDigits(loader->TreeD()));

}

//_____________________________________________________________________________
Bool_t AliTRDclusterizerV1::MakeClusters()
{
  //
  // Generates the cluster.
  //

  Int_t row, col, time;

  /*
  if (fTRD->IsVersion() != 1) {
    printf("<AliTRDclusterizerV1::MakeCluster> ");
    printf("TRD must be version 1 (slow simulator).\n");
    return kFALSE; 
  }
  */

  // Get the geometry
  AliTRDgeometry *geo = AliTRDgeometry::GetGeometry(fRunLoader);

  // Create a default parameter class if none is defined
  if (!fPar) {
    fPar = new AliTRDparameter("TRDparameter","Standard TRD parameter");
    printf("<AliTRDclusterizerV1::MakeCluster> ");
    printf("Create the default parameter object.\n");
  }

  Float_t timeBinSize = fPar->GetTimeBinSize();
  // Half of ampl.region
  const Float_t kAmWidth = AliTRDgeometry::AmThick()/2.; 

  Float_t omegaTau = fPar->GetOmegaTau();
  if (fVerbose > 0) {
    printf("<AliTRDclusterizerV1::MakeCluster> ");
    printf("OmegaTau = %f \n",omegaTau);
    printf("<AliTRDclusterizerV1::MakeCluster> ");
    printf("Start creating clusters.\n");
  } 

  AliTRDdataArrayI *digits;
  AliTRDdataArrayI *track0;
  AliTRDdataArrayI *track1;
  AliTRDdataArrayI *track2; 

  // Threshold value for the maximum
  Int_t maxThresh = fPar->GetClusMaxThresh();   
  // Threshold value for the digit signal
  Int_t sigThresh = fPar->GetClusSigThresh();   

  // Iteration limit for unfolding procedure
  const Float_t kEpsilon = 0.01;             

  const Int_t   kNclus   = 3;  
  const Int_t   kNsig    = 5;
  const Int_t   kNtrack  = 3 * kNclus;

  Int_t   iType          = 0;
  Int_t   iUnfold        = 0;

  Float_t ratioLeft      = 1.0;
  Float_t ratioRight     = 1.0;

  Float_t padSignal[kNsig];   
  Float_t clusterSignal[kNclus];
  Float_t clusterPads[kNclus];   
  Int_t   clusterDigit[kNclus];
  Int_t   clusterTracks[kNtrack];   

  Int_t chamBeg = 0;
  Int_t chamEnd = AliTRDgeometry::Ncham();
  Int_t planBeg = 0;
  Int_t planEnd = AliTRDgeometry::Nplan();
  Int_t sectBeg = 0;
  Int_t sectEnd = AliTRDgeometry::Nsect();

  // Start clustering in every chamber
  for (Int_t icham = chamBeg; icham < chamEnd; icham++) {
    for (Int_t iplan = planBeg; iplan < planEnd; iplan++) {
      for (Int_t isect = sectBeg; isect < sectEnd; isect++) {

        Int_t idet = geo->GetDetector(iplan,icham,isect);

        Int_t nClusters      = 0;
        Int_t nClusters2pad  = 0;
        Int_t nClusters3pad  = 0;
        Int_t nClusters4pad  = 0;
        Int_t nClusters5pad  = 0;
        Int_t nClustersLarge = 0;

        if (fVerbose > 0) {
          printf("<AliTRDclusterizerV1::MakeCluster> ");
          printf("Analyzing chamber %d, plane %d, sector %d.\n"
                ,icham,iplan,isect);
	}

        Int_t   nRowMax     = fPar->GetRowMax(iplan,icham,isect);
        Int_t   nColMax     = fPar->GetColMax(iplan);
        Int_t   nTimeBefore = fPar->GetTimeBefore();
        Int_t   nTimeTotal  = fPar->GetTimeTotal();  

        Float_t row0        = fPar->GetRow0(iplan,icham,isect);
        Float_t col0        = fPar->GetCol0(iplan);
        Float_t rowSize     = fPar->GetRowPadSize(iplan,icham,isect);
        Float_t colSize     = fPar->GetColPadSize(iplan);

        // Get the digits
        digits = fDigitsManager->GetDigits(idet);
        digits->Expand();
        track0 = fDigitsManager->GetDictionary(idet,0);
        track0->Expand();
        track1 = fDigitsManager->GetDictionary(idet,1);
        track1->Expand();
        track2 = fDigitsManager->GetDictionary(idet,2); 
        track2->Expand();

        // Loop through the chamber and find the maxima 
        for ( row = 0;  row <  nRowMax;    row++) {
	  //          for ( col = 2;  col <  nColMax;    col++) {
          for ( col = 4;  col <  nColMax-2;    col++) {
            for (time = 0; time < nTimeTotal; time++) {

              Int_t signalL = TMath::Abs(digits->GetDataUnchecked(row,col  ,time));
              Int_t signalM = TMath::Abs(digits->GetDataUnchecked(row,col-1,time));
              Int_t signalR = TMath::Abs(digits->GetDataUnchecked(row,col-2,time));
 
	      // Look for the maximum
              if (signalM >= maxThresh) {
                if (((signalL >= sigThresh) &&
                     (signalL <  signalM))  ||
                    ((signalR >= sigThresh) &&
                     (signalR <  signalM))) {
                  // Maximum found, mark the position by a negative signal
                  digits->SetDataUnchecked(row,col-1,time,-signalM);
		}
	      }

            }  
          }    
        }      

        // Now check the maxima and calculate the cluster position
        for ( row = 0;  row <  nRowMax  ;  row++) {
          for (time = 0; time < nTimeTotal; time++) {
            for ( col = 1;  col <  nColMax-1;  col++) {

              // Maximum found ?             
              if (digits->GetDataUnchecked(row,col,time) < 0) {

                Int_t iPad;
                for (iPad = 0; iPad < kNclus; iPad++) {
                  Int_t iPadCol = col - 1 + iPad;
                  clusterSignal[iPad]     = TMath::Abs(digits->GetDataUnchecked(row
                                                                               ,iPadCol
                                                                               ,time));
                  clusterDigit[iPad]      = digits->GetIndexUnchecked(row,iPadCol,time);
                  clusterTracks[3*iPad  ] = track0->GetDataUnchecked(row,iPadCol,time) - 1;
		  clusterTracks[3*iPad+1] = track1->GetDataUnchecked(row,iPadCol,time) - 1;
		  clusterTracks[3*iPad+2] = track2->GetDataUnchecked(row,iPadCol,time) - 1;
                }

		// Count the number of pads in the cluster
                Int_t nPadCount = 0;
                Int_t ii        = 0;
                while (TMath::Abs(digits->GetDataUnchecked(row,col-ii  ,time))
                                                                  >= sigThresh) {
                  nPadCount++;
                  ii++;
                  if (col-ii   <        0) break;
		}
                ii = 0;
                while (TMath::Abs(digits->GetDataUnchecked(row,col+ii+1,time))
                                                                  >= sigThresh) {
                  nPadCount++;
                  ii++;
                  if (col+ii+1 >= nColMax) break;
		}

                nClusters++;
                switch (nPadCount) {
                case 2:
                  iType = 0;
                  nClusters2pad++;
                  break;
                case 3:
                  iType = 1;
                  nClusters3pad++;
                  break;
                case 4:
                  iType = 2;
                  nClusters4pad++;
                  break;
                case 5:
                  iType = 3;
                  nClusters5pad++;
                  break;
                default:
                  iType = 4;
                  nClustersLarge++;
                  break;
		};

		// Don't analyze large clusters
                //if (iType == 4) continue;

                // Look for 5 pad cluster with minimum in the middle
                Bool_t fivePadCluster = kFALSE;
                if (col < nColMax-3) {
                  if (digits->GetDataUnchecked(row,col+2,time) < 0) {
                    fivePadCluster = kTRUE;
	  	  }
                  if ((fivePadCluster) && (col < nColMax-5)) {
                    if (digits->GetDataUnchecked(row,col+4,time) >= sigThresh) {
                      fivePadCluster = kFALSE;
		    }
		  }
                  if ((fivePadCluster) && (col >         1)) {
                    if (digits->GetDataUnchecked(row,col-2,time) >= sigThresh) {
                      fivePadCluster = kFALSE;
		    }
		  }
		}

		// 5 pad cluster
                // Modify the signal of the overlapping pad for the left part 
		// of the cluster which remains from a previous unfolding
                if (iUnfold) {
                  clusterSignal[0] *= ratioLeft;
                  iType   = 3;
                  iUnfold = 0;
		}

		// Unfold the 5 pad cluster
                if (fivePadCluster) {
                  for (iPad = 0; iPad < kNsig; iPad++) {
                    padSignal[iPad] = TMath::Abs(digits->GetDataUnchecked(row
                                                                         ,col-1+iPad
                                                                         ,time));
                  }
                  // Unfold the two maxima and set the signal on 
                  // the overlapping pad to the ratio
                  ratioRight        = Unfold(kEpsilon,iplan,padSignal);
                  ratioLeft         = 1.0 - ratioRight; 
                  clusterSignal[2] *= ratioRight;
                  iType   = 3;
                  iUnfold = 1;
                }

                Float_t clusterCharge = clusterSignal[0]
                                      + clusterSignal[1]
                                      + clusterSignal[2];
                
		// The position of the cluster
                clusterPads[0] = row + 0.5;
		// Take the shift of the additional time bins into account
                clusterPads[2] = time - nTimeBefore + 0.5;

                if (fPar->LUTOn()) {

  		  // Calculate the position of the cluster by using the
		  // lookup table method
                  clusterPads[1] = col + 0.5
                                 + fPar->LUTposition(iplan,clusterSignal[0]
                                                          ,clusterSignal[1]
					                  ,clusterSignal[2]);

		}
		else {

  		  // Calculate the position of the cluster by using the
		  // center of gravity method
                  clusterPads[1] = col + 0.5 
                                 + (clusterSignal[2] - clusterSignal[0]) 
		                 / clusterCharge;

		}

                Float_t q0 = clusterSignal[0];
		Float_t q1 = clusterSignal[1];
                Float_t q2 = clusterSignal[2];
                Float_t clusterSigmaY2 = (q1*(q0+q2)+4*q0*q2) /
                                         (clusterCharge*clusterCharge);

                // Correct for ExB displacement
                if (fPar->ExBOn()) { 
                  Int_t   local_time_bin = (Int_t) clusterPads[2];
                  Float_t driftLength    = local_time_bin * timeBinSize + kAmWidth;
                  Float_t colSize        = fPar->GetColPadSize(iplan);
                  Float_t deltaY         = omegaTau*driftLength/colSize;
                  clusterPads[1]         = clusterPads[1] - deltaY;
                }
                                       
                if (fVerbose > 1) {
                  printf("-----------------------------------------------------------\n");
                  printf("Create cluster no. %d\n",nClusters);
                  printf("Position: row = %f, col = %f, time = %f\n",clusterPads[0]
			                                            ,clusterPads[1]
                                                                    ,clusterPads[2]);
                  printf("Indices: %d, %d, %d\n",clusterDigit[0]
			                        ,clusterDigit[1]
                                                ,clusterDigit[2]);
                  printf("Total charge = %f\n",clusterCharge);
                  printf("Tracks: pad0 %d, %d, %d\n",clusterTracks[0]
			                            ,clusterTracks[1]
                                                    ,clusterTracks[2]);
                  printf("        pad1 %d, %d, %d\n",clusterTracks[3]
			                            ,clusterTracks[4]
                                                    ,clusterTracks[5]);
                  printf("        pad2 %d, %d, %d\n",clusterTracks[6]
			                            ,clusterTracks[7]
                                                    ,clusterTracks[8]);
                  printf("Type = %d, Number of pads = %d\n",iType,nPadCount);
                }

		// Calculate the position and the error
                Float_t clusterPos[3];
                clusterPos[0] = clusterPads[1] * colSize + col0;
                clusterPos[1] = clusterPads[0] * rowSize + row0;
                clusterPos[2] = clusterPads[2];
                Float_t clusterSig[2];
                clusterSig[0] = (clusterSigmaY2 + 1./12.) * colSize*colSize;
                clusterSig[1] = rowSize * rowSize / 12.;

                // Add the cluster to the output array 
                AddCluster(clusterPos
			   ,idet
			   ,clusterCharge
			   ,clusterTracks
			   ,clusterSig
			   ,iType);

              }
            } 
          }   
        }     

	// Compress the arrays
        digits->Compress(1,0);
        track0->Compress(1,0);
        track1->Compress(1,0);
        track2->Compress(1,0);

        // Write the cluster and reset the array
	WriteClusters(idet);
	ResetRecPoints();

        if (fVerbose > 0) {
          printf("<AliTRDclusterizerV1::MakeCluster> ");
          printf("Found %d clusters in total.\n"
                ,nClusters);
          printf("                                    2pad:  %d\n",nClusters2pad);
          printf("                                    3pad:  %d\n",nClusters3pad);
          printf("                                    4pad:  %d\n",nClusters4pad);
          printf("                                    5pad:  %d\n",nClusters5pad);
          printf("                                    Large: %d\n",nClustersLarge);
	}

      }    
    }      
  }        

  if (fVerbose > 0) {
    printf("<AliTRDclusterizerV1::MakeCluster> ");
    printf("Done.\n");
  }

  return kTRUE;

}

//_____________________________________________________________________________
Float_t AliTRDclusterizerV1::Unfold(Float_t eps, Int_t plane, Float_t* padSignal)
{
  //
  // Method to unfold neighbouring maxima.
  // The charge ratio on the overlapping pad is calculated
  // until there is no more change within the range given by eps.
  // The resulting ratio is then returned to the calling method.
  //

  Int_t   irc               = 0;
  Int_t   itStep            = 0;      // Count iteration steps

  Float_t ratio             = 0.5;    // Start value for ratio
  Float_t prevRatio         = 0;      // Store previous ratio

  Float_t newLeftSignal[3]  = {0};    // Array to store left cluster signal
  Float_t newRightSignal[3] = {0};    // Array to store right cluster signal
  Float_t newSignal[3]      = {0};

  // Start the iteration
  while ((TMath::Abs(prevRatio - ratio) > eps) && (itStep < 10)) {

    itStep++;
    prevRatio = ratio;

    // Cluster position according to charge ratio
    Float_t maxLeft  = (ratio*padSignal[2] - padSignal[0]) 
                     / (padSignal[0] + padSignal[1] + ratio*padSignal[2]);
    Float_t maxRight = (padSignal[4] - (1-ratio)*padSignal[2]) 
                     / ((1-ratio)*padSignal[2] + padSignal[3] + padSignal[4]);

    // Set cluster charge ratio
    irc = fPar->PadResponse(1.0,maxLeft ,plane,newSignal);
    Float_t ampLeft  = padSignal[1] / newSignal[1];
    irc = fPar->PadResponse(1.0,maxRight,plane,newSignal);
    Float_t ampRight = padSignal[3] / newSignal[1];

    // Apply pad response to parameters
    irc = fPar->PadResponse(ampLeft ,maxLeft ,plane,newLeftSignal );
    irc = fPar->PadResponse(ampRight,maxRight,plane,newRightSignal);

    // Calculate new overlapping ratio
    ratio = TMath::Min((Float_t)1.0,newLeftSignal[2] / 
                          (newLeftSignal[2] + newRightSignal[0]));

  }

  return ratio;

}
Commit	Line	Data
f7336fa3	1	/**************************************************************************
	2	* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
	3	* *
	4	* Author: The ALICE Off-line Project. *
	5	* Contributors are mentioned in the code where appropriate. *
	6	* *
	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	**************************************************************************/
	15
88cb7938	16	/* $Id$ */
f7336fa3	17
	18	///////////////////////////////////////////////////////////////////////////////
	19	// //
	20	// TRD cluster finder for the slow simulator.
	21	// //
	22	///////////////////////////////////////////////////////////////////////////////
	23
	24	#include <TF1.h>
94de3818	25	#include <TTree.h>
793ff80c	26	#include <TH1.h>
a819a5f7	27	#include <TFile.h>
f7336fa3	28
793ff80c	29	#include "AliRun.h"
88cb7938	30	#include "AliRunLoader.h"
88cb7938	31	#include "AliLoader.h"
793ff80c	32
f7336fa3	33	#include "AliTRDclusterizerV1.h"
	34	#include "AliTRDmatrix.h"
	35	#include "AliTRDgeometry.h"
6f1e466d	36	#include "AliTRDdataArrayF.h"
793ff80c	37	#include "AliTRDdataArrayI.h"
793ff80c	38	#include "AliTRDdigitsManager.h"
17b26de4	39	#include "AliTRDparameter.h"
f7336fa3	40
	41	ClassImp(AliTRDclusterizerV1)
	42
	43	//_____________________________________________________________________________
	44	AliTRDclusterizerV1::AliTRDclusterizerV1():AliTRDclusterizer()
	45	{
	46	//
	47	// AliTRDclusterizerV1 default constructor
	48	//
	49
17b26de4	50	fDigitsManager = 0;
db30bf0f	51
f7336fa3	52	}
	53
	54	//_____________________________________________________________________________
	55	AliTRDclusterizerV1::AliTRDclusterizerV1(const Text_t* name, const Text_t* title)
	56	:AliTRDclusterizer(name,title)
	57	{
	58	//
	59	// AliTRDclusterizerV1 default constructor
	60	//
	61
6f1e466d	62	fDigitsManager = new AliTRDdigitsManager();
17b26de4	63	fDigitsManager->CreateArrays();
f7336fa3	64
	65	}
	66
8230f242	67	//_____________________________________________________________________________
dd9a6ee3	68	AliTRDclusterizerV1::AliTRDclusterizerV1(const AliTRDclusterizerV1 &c)
73ae7b59	69	:AliTRDclusterizer(c)
8230f242	70	{
	71	//
	72	// AliTRDclusterizerV1 copy constructor
	73	//
	74
dd9a6ee3	75	((AliTRDclusterizerV1 &) c).Copy(*this);
8230f242	76
	77	}
	78
f7336fa3	79	//_____________________________________________________________________________
	80	AliTRDclusterizerV1::~AliTRDclusterizerV1()
	81	{
8230f242	82	//
	83	// AliTRDclusterizerV1 destructor
	84	//
f7336fa3	85
6f1e466d	86	if (fDigitsManager) {
6f1e466d	87	delete fDigitsManager;
abaf1f1d	88	fDigitsManager = NULL;
f7336fa3	89	}
	90
	91	}
	92
dd9a6ee3	93	//_____________________________________________________________________________
	94	AliTRDclusterizerV1 &AliTRDclusterizerV1::operator=(const AliTRDclusterizerV1 &c)
	95	{
	96	//
	97	// Assignment operator
	98	//
	99
	100	if (this != &c) ((AliTRDclusterizerV1 &) c).Copy(*this);
	101	return *this;
	102
	103	}
	104
8230f242	105	//_____________________________________________________________________________
43da34c0	106	void AliTRDclusterizerV1::Copy(TObject &c)
8230f242	107	{
	108	//
	109	// Copy function
	110	//
	111
17b26de4	112	((AliTRDclusterizerV1 &) c).fDigitsManager = 0;
8230f242	113
	114	AliTRDclusterizer::Copy(c);
	115
	116	}
	117
f7336fa3	118	//_____________________________________________________________________________
	119	Bool_t AliTRDclusterizerV1::ReadDigits()
	120	{
	121	//
	122	// Reads the digits arrays from the input aliroot file
	123	//
	124
88cb7938	125	if (!fRunLoader) {
17b26de4	126	printf("<AliTRDclusterizerV1::ReadDigits> ");
f7336fa3	127	printf("No input file open\n");
	128	return kFALSE;
	129	}
88cb7938	130	AliLoader* loader = fRunLoader->GetLoader("TRDLoader");
88cb7938	131	if (!loader->TreeD()) loader->LoadDigits();
abaf1f1d	132
f7336fa3	133	// Read in the digit arrays
88cb7938	134	return (fDigitsManager->ReadDigits(loader->TreeD()));
f7336fa3	135
	136	}
	137
	138	//_____________________________________________________________________________
793ff80c	139	Bool_t AliTRDclusterizerV1::MakeClusters()
f7336fa3	140	{
	141	//
	142	// Generates the cluster.
	143	//
	144
	145	Int_t row, col, time;
	146
bdbb05bb	147	/*
3e1a3ad8	148	if (fTRD->IsVersion() != 1) {
17b26de4	149	printf("<AliTRDclusterizerV1::MakeCluster> ");
f7336fa3	150	printf("TRD must be version 1 (slow simulator).\n");
	151	return kFALSE;
	152	}
bdbb05bb	153	*/
f7336fa3	154
f7336fa3	155	// Get the geometry
bdbb05bb	156	AliTRDgeometry *geo = AliTRDgeometry::GetGeometry(fRunLoader);
f7336fa3	157
17b26de4	158	// Create a default parameter class if none is defined
	159	if (!fPar) {
	160	fPar = new AliTRDparameter("TRDparameter","Standard TRD parameter");
5443e65e	161	printf("<AliTRDclusterizerV1::MakeCluster> ");
5443e65e	162	printf("Create the default parameter object.\n");
17b26de4	163	}
	164
	165	Float_t timeBinSize = fPar->GetTimeBinSize();
a819a5f7	166	// Half of ampl.region
	167	const Float_t kAmWidth = AliTRDgeometry::AmThick()/2.;
	168
17b26de4	169	Float_t omegaTau = fPar->GetOmegaTau();
47517f42	170	if (fVerbose > 0) {
17b26de4	171	printf("<AliTRDclusterizerV1::MakeCluster> ");
47517f42	172	printf("OmegaTau = %f \n",omegaTau);
17b26de4	173	printf("<AliTRDclusterizerV1::MakeCluster> ");
47517f42	174	printf("Start creating clusters.\n");
47517f42	175	}
f7336fa3	176
8230f242	177	AliTRDdataArrayI *digits;
793ff80c	178	AliTRDdataArrayI *track0;
	179	AliTRDdataArrayI *track1;
	180	AliTRDdataArrayI *track2;
f7336fa3	181
3e1a3ad8	182	// Threshold value for the maximum
17b26de4	183	Int_t maxThresh = fPar->GetClusMaxThresh();
3e1a3ad8	184	// Threshold value for the digit signal
17b26de4	185	Int_t sigThresh = fPar->GetClusSigThresh();
f7336fa3	186
f7336fa3	187	// Iteration limit for unfolding procedure
8230f242	188	const Float_t kEpsilon = 0.01;
f7336fa3	189
8230f242	190	const Int_t kNclus = 3;
8230f242	191	const Int_t kNsig = 5;
3e1a3ad8	192	const Int_t kNtrack = 3 * kNclus;
3e1a3ad8	193
db30bf0f	194	Int_t iType = 0;
	195	Int_t iUnfold = 0;
	196
	197	Float_t ratioLeft = 1.0;
	198	Float_t ratioRight = 1.0;
	199
3e1a3ad8	200	Float_t padSignal[kNsig];
	201	Float_t clusterSignal[kNclus];
	202	Float_t clusterPads[kNclus];
	203	Int_t clusterDigit[kNclus];
	204	Int_t clusterTracks[kNtrack];
f7336fa3	205
f7336fa3	206	Int_t chamBeg = 0;
793ff80c	207	Int_t chamEnd = AliTRDgeometry::Ncham();
f7336fa3	208	Int_t planBeg = 0;
793ff80c	209	Int_t planEnd = AliTRDgeometry::Nplan();
f7336fa3	210	Int_t sectBeg = 0;
793ff80c	211	Int_t sectEnd = AliTRDgeometry::Nsect();
f7336fa3	212
3e1a3ad8	213	// Start clustering in every chamber
f7336fa3	214	for (Int_t icham = chamBeg; icham < chamEnd; icham++) {
	215	for (Int_t iplan = planBeg; iplan < planEnd; iplan++) {
	216	for (Int_t isect = sectBeg; isect < sectEnd; isect++) {
	217
8230f242	218	Int_t idet = geo->GetDetector(iplan,icham,isect);
f7336fa3	219
db30bf0f	220	Int_t nClusters = 0;
	221	Int_t nClusters2pad = 0;
	222	Int_t nClusters3pad = 0;
	223	Int_t nClusters4pad = 0;
	224	Int_t nClusters5pad = 0;
	225	Int_t nClustersLarge = 0;
3e1a3ad8	226
47517f42	227	if (fVerbose > 0) {
17b26de4	228	printf("<AliTRDclusterizerV1::MakeCluster> ");
47517f42	229	printf("Analyzing chamber %d, plane %d, sector %d.\n"
	230	,icham,iplan,isect);
	231	}
f7336fa3	232
5443e65e	233	Int_t nRowMax = fPar->GetRowMax(iplan,icham,isect);
	234	Int_t nColMax = fPar->GetColMax(iplan);
	235	Int_t nTimeBefore = fPar->GetTimeBefore();
	236	Int_t nTimeTotal = fPar->GetTimeTotal();
	237
	238	Float_t row0 = fPar->GetRow0(iplan,icham,isect);
	239	Float_t col0 = fPar->GetCol0(iplan);
	240	Float_t rowSize = fPar->GetRowPadSize(iplan,icham,isect);
	241	Float_t colSize = fPar->GetColPadSize(iplan);
f7336fa3	242
3e1a3ad8	243	// Get the digits
8230f242	244	digits = fDigitsManager->GetDigits(idet);
3e1a3ad8	245	digits->Expand();
793ff80c	246	track0 = fDigitsManager->GetDictionary(idet,0);
3e1a3ad8	247	track0->Expand();
793ff80c	248	track1 = fDigitsManager->GetDictionary(idet,1);
3e1a3ad8	249	track1->Expand();
793ff80c	250	track2 = fDigitsManager->GetDictionary(idet,2);
3e1a3ad8	251	track2->Expand();
	252
	253	// Loop through the chamber and find the maxima
	254	for ( row = 0; row < nRowMax; row++) {
95d99e62	255	// for ( col = 2; col < nColMax; col++) {
95d99e62	256	for ( col = 4; col < nColMax-2; col++) {
3e1a3ad8	257	for (time = 0; time < nTimeTotal; time++) {
3e1a3ad8	258
a819a5f7	259	Int_t signalL = TMath::Abs(digits->GetDataUnchecked(row,col ,time));
	260	Int_t signalM = TMath::Abs(digits->GetDataUnchecked(row,col-1,time));
	261	Int_t signalR = TMath::Abs(digits->GetDataUnchecked(row,col-2,time));
3e1a3ad8	262
3e1a3ad8	263	// Look for the maximum
db30bf0f	264	if (signalM >= maxThresh) {
	265	if (((signalL >= sigThresh) &&
	266	(signalL < signalM)) \|\|
	267	((signalR >= sigThresh) &&
	268	(signalR < signalM))) {
3e1a3ad8	269	// Maximum found, mark the position by a negative signal
	270	digits->SetDataUnchecked(row,col-1,time,-signalM);
	271	}
	272	}
	273
	274	}
	275	}
	276	}
	277
	278	// Now check the maxima and calculate the cluster position
	279	for ( row = 0; row < nRowMax ; row++) {
db30bf0f	280	for (time = 0; time < nTimeTotal; time++) {
db30bf0f	281	for ( col = 1; col < nColMax-1; col++) {
3e1a3ad8	282
	283	// Maximum found ?
	284	if (digits->GetDataUnchecked(row,col,time) < 0) {
f7336fa3	285
9d0b222b	286	Int_t iPad;
8230f242	287	for (iPad = 0; iPad < kNclus; iPad++) {
3e1a3ad8	288	Int_t iPadCol = col - 1 + iPad;
	289	clusterSignal[iPad] = TMath::Abs(digits->GetDataUnchecked(row
	290	,iPadCol
	291	,time));
	292	clusterDigit[iPad] = digits->GetIndexUnchecked(row,iPadCol,time);
	293	clusterTracks[3*iPad ] = track0->GetDataUnchecked(row,iPadCol,time) - 1;
	294	clusterTracks[3*iPad+1] = track1->GetDataUnchecked(row,iPadCol,time) - 1;
	295	clusterTracks[3*iPad+2] = track2->GetDataUnchecked(row,iPadCol,time) - 1;
f7336fa3	296	}
f7336fa3	297
db30bf0f	298	// Count the number of pads in the cluster
	299	Int_t nPadCount = 0;
	300	Int_t ii = 0;
	301	while (TMath::Abs(digits->GetDataUnchecked(row,col-ii ,time))
	302	>= sigThresh) {
	303	nPadCount++;
	304	ii++;
	305	if (col-ii < 0) break;
	306	}
	307	ii = 0;
	308	while (TMath::Abs(digits->GetDataUnchecked(row,col+ii+1,time))
	309	>= sigThresh) {
	310	nPadCount++;
	311	ii++;
	312	if (col+ii+1 >= nColMax) break;
	313	}
	314
	315	nClusters++;
	316	switch (nPadCount) {
	317	case 2:
	318	iType = 0;
	319	nClusters2pad++;
	320	break;
	321	case 3:
	322	iType = 1;
	323	nClusters3pad++;
	324	break;
	325	case 4:
	326	iType = 2;
	327	nClusters4pad++;
	328	break;
	329	case 5:
	330	iType = 3;
	331	nClusters5pad++;
	332	break;
	333	default:
	334	iType = 4;
	335	nClustersLarge++;
	336	break;
	337	};
	338
	339	// Don't analyze large clusters
	340	//if (iType == 4) continue;
	341
	342	// Look for 5 pad cluster with minimum in the middle
	343	Bool_t fivePadCluster = kFALSE;
3e1a3ad8	344	if (col < nColMax-3) {
3e1a3ad8	345	if (digits->GetDataUnchecked(row,col+2,time) < 0) {
db30bf0f	346	fivePadCluster = kTRUE;
	347	}
	348	if ((fivePadCluster) && (col < nColMax-5)) {
	349	if (digits->GetDataUnchecked(row,col+4,time) >= sigThresh) {
	350	fivePadCluster = kFALSE;
	351	}
	352	}
	353	if ((fivePadCluster) && (col > 1)) {
	354	if (digits->GetDataUnchecked(row,col-2,time) >= sigThresh) {
	355	fivePadCluster = kFALSE;
	356	}
	357	}
	358	}
	359
	360	// 5 pad cluster
	361	// Modify the signal of the overlapping pad for the left part
	362	// of the cluster which remains from a previous unfolding
	363	if (iUnfold) {
	364	clusterSignal[0] *= ratioLeft;
	365	iType = 3;
	366	iUnfold = 0;
	367	}
	368
	369	// Unfold the 5 pad cluster
	370	if (fivePadCluster) {
	371	for (iPad = 0; iPad < kNsig; iPad++) {
	372	padSignal[iPad] = TMath::Abs(digits->GetDataUnchecked(row
	373	,col-1+iPad
	374	,time));
f7336fa3	375	}
db30bf0f	376	// Unfold the two maxima and set the signal on
db30bf0f	377	// the overlapping pad to the ratio
17b26de4	378	ratioRight = Unfold(kEpsilon,iplan,padSignal);
db30bf0f	379	ratioLeft = 1.0 - ratioRight;
	380	clusterSignal[2] *= ratioRight;
	381	iType = 3;
	382	iUnfold = 1;
f7336fa3	383	}
f7336fa3	384
3e1a3ad8	385	Float_t clusterCharge = clusterSignal[0]
	386	+ clusterSignal[1]
	387	+ clusterSignal[2];
	388
db30bf0f	389	// The position of the cluster
3e1a3ad8	390	clusterPads[0] = row + 0.5;
3e1a3ad8	391	// Take the shift of the additional time bins into account
	392	clusterPads[2] = time - nTimeBefore + 0.5;
	393
17b26de4	394	if (fPar->LUTOn()) {
db30bf0f	395
	396	// Calculate the position of the cluster by using the
	397	// lookup table method
5443e65e	398	clusterPads[1] = col + 0.5
5443e65e	399	+ fPar->LUTposition(iplan,clusterSignal[0]
17b26de4	400	,clusterSignal[1]
17b26de4	401	,clusterSignal[2]);
db30bf0f	402
	403	}
	404	else {
	405
	406	// Calculate the position of the cluster by using the
	407	// center of gravity method
	408	clusterPads[1] = col + 0.5
	409	+ (clusterSignal[2] - clusterSignal[0])
	410	/ clusterCharge;
	411
	412	}
	413
5443e65e	414	Float_t q0 = clusterSignal[0];
	415	Float_t q1 = clusterSignal[1];
	416	Float_t q2 = clusterSignal[2];
	417	Float_t clusterSigmaY2 = (q1(q0+q2)+4q0*q2) /
	418	(clusterCharge*clusterCharge);
a819a5f7	419
a819a5f7	420	// Correct for ExB displacement
17b26de4	421	if (fPar->ExBOn()) {
a819a5f7	422	Int_t local_time_bin = (Int_t) clusterPads[2];
a819a5f7	423	Float_t driftLength = local_time_bin * timeBinSize + kAmWidth;
17b26de4	424	Float_t colSize = fPar->GetColPadSize(iplan);
a819a5f7	425	Float_t deltaY = omegaTau*driftLength/colSize;
	426	clusterPads[1] = clusterPads[1] - deltaY;
	427	}
	428
47517f42	429	if (fVerbose > 1) {
3e1a3ad8	430	printf("-----------------------------------------------------------\n");
	431	printf("Create cluster no. %d\n",nClusters);
	432	printf("Position: row = %f, col = %f, time = %f\n",clusterPads[0]
	433	,clusterPads[1]
	434	,clusterPads[2]);
	435	printf("Indices: %d, %d, %d\n",clusterDigit[0]
	436	,clusterDigit[1]
	437	,clusterDigit[2]);
	438	printf("Total charge = %f\n",clusterCharge);
	439	printf("Tracks: pad0 %d, %d, %d\n",clusterTracks[0]
	440	,clusterTracks[1]
	441	,clusterTracks[2]);
	442	printf(" pad1 %d, %d, %d\n",clusterTracks[3]
	443	,clusterTracks[4]
	444	,clusterTracks[5]);
	445	printf(" pad2 %d, %d, %d\n",clusterTracks[6]
	446	,clusterTracks[7]
	447	,clusterTracks[8]);
db30bf0f	448	printf("Type = %d, Number of pads = %d\n",iType,nPadCount);
f7336fa3	449	}
f7336fa3	450
5443e65e	451	// Calculate the position and the error
	452	Float_t clusterPos[3];
	453	clusterPos[0] = clusterPads[1] * colSize + col0;
	454	clusterPos[1] = clusterPads[0] * rowSize + row0;
	455	clusterPos[2] = clusterPads[2];
	456	Float_t clusterSig[2];
	457	clusterSig[0] = (clusterSigmaY2 + 1./12.) * colSize*colSize;
	458	clusterSig[1] = rowSize * rowSize / 12.;
	459
f7336fa3	460	// Add the cluster to the output array
bdbb05bb	461	AddCluster(clusterPos
	462	,idet
	463	,clusterCharge
	464	,clusterTracks
	465	,clusterSig
	466	,iType);
f7336fa3	467
f7336fa3	468	}
3e1a3ad8	469	}
	470	}
	471	}
f7336fa3	472
3e1a3ad8	473	// Compress the arrays
	474	digits->Compress(1,0);
	475	track0->Compress(1,0);
	476	track1->Compress(1,0);
	477	track2->Compress(1,0);
f7336fa3	478
3e1a3ad8	479	// Write the cluster and reset the array
793ff80c	480	WriteClusters(idet);
bdbb05bb	481	ResetRecPoints();
793ff80c	482
47517f42	483	if (fVerbose > 0) {
17b26de4	484	printf("<AliTRDclusterizerV1::MakeCluster> ");
47517f42	485	printf("Found %d clusters in total.\n"
	486	,nClusters);
	487	printf(" 2pad: %d\n",nClusters2pad);
	488	printf(" 3pad: %d\n",nClusters3pad);
	489	printf(" 4pad: %d\n",nClusters4pad);
	490	printf(" 5pad: %d\n",nClusters5pad);
	491	printf(" Large: %d\n",nClustersLarge);
	492	}
f7336fa3	493
3e1a3ad8	494	}
	495	}
	496	}
f7336fa3	497
47517f42	498	if (fVerbose > 0) {
17b26de4	499	printf("<AliTRDclusterizerV1::MakeCluster> ");
47517f42	500	printf("Done.\n");
47517f42	501	}
f7336fa3	502
	503	return kTRUE;
	504
	505	}
	506
	507	//_____________________________________________________________________________
17b26de4	508	Float_t AliTRDclusterizerV1::Unfold(Float_t eps, Int_t plane, Float_t* padSignal)
f7336fa3	509	{
	510	//
	511	// Method to unfold neighbouring maxima.
	512	// The charge ratio on the overlapping pad is calculated
	513	// until there is no more change within the range given by eps.
	514	// The resulting ratio is then returned to the calling method.
	515	//
	516
17b26de4	517	Int_t irc = 0;
3e1a3ad8	518	Int_t itStep = 0; // Count iteration steps
f7336fa3	519
3e1a3ad8	520	Float_t ratio = 0.5; // Start value for ratio
3e1a3ad8	521	Float_t prevRatio = 0; // Store previous ratio
f7336fa3	522
3e1a3ad8	523	Float_t newLeftSignal[3] = {0}; // Array to store left cluster signal
3e1a3ad8	524	Float_t newRightSignal[3] = {0}; // Array to store right cluster signal
17b26de4	525	Float_t newSignal[3] = {0};
f7336fa3	526
3e1a3ad8	527	// Start the iteration
f7336fa3	528	while ((TMath::Abs(prevRatio - ratio) > eps) && (itStep < 10)) {
	529
	530	itStep++;
	531	prevRatio = ratio;
	532
3e1a3ad8	533	// Cluster position according to charge ratio
	534	Float_t maxLeft = (ratio*padSignal[2] - padSignal[0])
	535	/ (padSignal[0] + padSignal[1] + ratio*padSignal[2]);
	536	Float_t maxRight = (padSignal[4] - (1-ratio)*padSignal[2])
	537	/ ((1-ratio)*padSignal[2] + padSignal[3] + padSignal[4]);
f7336fa3	538
3e1a3ad8	539	// Set cluster charge ratio
17b26de4	540	irc = fPar->PadResponse(1.0,maxLeft ,plane,newSignal);
	541	Float_t ampLeft = padSignal[1] / newSignal[1];
	542	irc = fPar->PadResponse(1.0,maxRight,plane,newSignal);
	543	Float_t ampRight = padSignal[3] / newSignal[1];
f7336fa3	544
3e1a3ad8	545	// Apply pad response to parameters
17b26de4	546	irc = fPar->PadResponse(ampLeft ,maxLeft ,plane,newLeftSignal );
17b26de4	547	irc = fPar->PadResponse(ampRight,maxRight,plane,newRightSignal);
f7336fa3	548
3e1a3ad8	549	// Calculate new overlapping ratio
26edf6a4	550	ratio = TMath::Min((Float_t)1.0,newLeftSignal[2] /
db30bf0f	551	(newLeftSignal[2] + newRightSignal[0]));
f7336fa3	552
	553	}
	554
	555	return ratio;
	556
	557	}
	558