Introduction

Track finding in a high density environment is rather difficult with silicon pixel and strip detectors, looking at both efficiency and fake rate. Track fitting uses hits associated by the previous track finding phase, thus the proper functioning of this latter is essential.

In the present track finding method seeding starts from pixel layers. Seeds are produced by combining pixel clusters from the two innermost pixel layers. If they are compatible a further check is made on the existence of another compatible hit in the third pixel layer. Due to the combinatorical nature of the process, the number of possible combinations grow with track/cluster multiplicity N as .

Up to know only the position, a kind of center of gravity, of pixel clusters have been used for track finding and fitting. Here new methods for using all information available is presented. These are

  • length of the cluster
  • direction of the cluster
  • enegy deposited in the channels of the cluster

The application of these methods are

  • fast vertex finding with clusters only, before track finding
  • reduction of compatible cluster seeds, resulting in faster tracking, higher efficiency and lower fake rate; in fact, track finding in track parameter space becomes possible
  • direct usage for determining specific energy loss of a particle ("dE/dx")

Of course these advantages come at a price: a proper modelling of the detector is necessary with the use of some powerful tools from numerical analysis.

-- FerencSikler - 11 Jan 2006

Edit | Attach | Watch | Print version | History: r5 | r4 < r3 < r2 < r1 | Backlinks | Raw View | Raw edit | More topic actions...
Topic revision: r1 - 2006-01-11 - FerencSikler
 
This site is powered by the TWiki collaboration platform Powered by Perl This site is powered by the TWiki collaboration platformCopyright &© by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback