1 / 12

L1 Reconstruction

L1 Reconstruction. Ivan Kisel Kirchhoff-Institut für Physik , Uni-Heidelberg. KIP. CBM Collaboration Meeting, GSI, 28.02.06. Outline. CA track finding in STS and detector geometry CA track finding in TRD KF for track fit KF for primary and secondary vertex fit EN for RICH ring finding.

gaura
Download Presentation

L1 Reconstruction

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. L1 Reconstruction Ivan Kisel Kirchhoff-Institut für Physik, Uni-Heidelberg KIP CBM Collaboration Meeting, GSI, 28.02.06

  2. Outline • CA track finding in STS and detector geometry • CA track finding in TRD • KF for track fit • KF for primary and secondary vertex fit • EN for RICH ring finding Ivan Kisel, KIP, Uni-Heidelberg

  3. Event Processing Steps (HLT) STS Data RICH Data TRD Data CA Track Finder EN Ring Finder CA Track Finder KFTrack Fit KFTrack Fit Track Merger PV Finder KFTrack Fit PV GeoFit SV GeoFit SV ConstrFit Performance Select/Discard Event Ivan Kisel, KIP, Uni-Heidelberg

  4. PC Sub-Farm Scheduler Input Data Farm Control System -Farm Sub-Farm Sub-Farm Sub-Farm HWP/AB HWP/AB HWP/AB HWP/AB HWP/AB HWP/AB HWP/AB HWP/AB HWP/AB HWP/AB HWP/AB HWP/AB Pnet Pnet Pnet SWP SWP SWP SWP SWP SWP SWP SWP SWP SWP SWP SWP SWP SWP SWP SWP SWP Ivan Kisel, KIP, Uni-Heidelberg

  5. Detector design I: two strip planes per stations 100% det. eff. track found 95% det. eff. track found 95% det. eff. track not found 95% det. eff. track found 9 1 6 8 4 7 3 5 2 • Double sided STS stations or two single sided detectors per station • Need minimum 4 consecutive hits per track to be found • Slow combinatorial track finding and fast track selection • Move detector inefficiency problem outside of the combinatorial part • Need extra 2 stations = in total 9 stations • The same is valid for MAPS and hybrids Ivan Kisel, KIP, Uni-Heidelberg

  6. Detector design II: three strip planes per station xy xy+u N3D points= NMC points + 5*NMC points = 6*NMC points N3D points= 0.9*NMC points + 5*0.1*NMC points = 1.4*NMC points • Inefficient strip detector with three sensitive planes gives only about 50% more fake hits • Much easier and faster combinatorics • Inefficiency of a single plane does not kill the space point, but equivalent to the double sided detectors case • Modified strip hit producer • Need more planes, but not extra stations • Double sided strip detectors give about 5 times more fake hits • Large and slow combinatorics due to fake hits • Inefficiency of a single plane kills the space point • Need more stations Ivan Kisel, KIP, Uni-Heidelberg

  7. Detector design III: four strip planes per station xy+uv Frontal view Side view Hybrid detector xy uv Target N3D points == NMC points • Gives tracklets within station • Combinatorics is lower as in hybrid detector • More complicated strip hit producer becomes a part of track finding • Single track cuts can be possible already at the level of tracklets • Space point reconstruction is reliable with respect to inefficiency of a single plane • Combinatorics is almost as in the hybrid detector (+ local space point creation) Ivan Kisel, KIP, Uni-Heidelberg

  8. Detector design IV: unified STS-TRD track finding TRD STS STS TRD x y x y (uv?) x y u v • Uniform track finding approach in the STS and TRD detectors possible • Common procedures can be developed and used • Unified track finder can also be possible Ivan Kisel, KIP, Uni-Heidelberg

  9. Kalman Filter for track fit • Future implementation on Cell processor: • Vector instructions (also for SSE2 on Pentium 4) • Array of 4 double (almost finished) • Vector of 4 float (some technical problems with gcc) • Vector of 8 short integer (needs math. investigation) • Memory optimization (not necessary for track fitting) • Parallel processing on 8 SPUs (the Cell simulator installed) Ivan Kisel, KIP, Uni-Heidelberg

  10. Kalman Filter for vertexing soon • The vertex code is completely reworked and rewritten • The algorithms are very simple without matrix operations • The algorithms are ready for further developing based on the SIMD or FPGA features Ivan Kisel, KIP, Uni-Heidelberg

  11. EN RICH ring finder • Ring finding with magnetic field in the RICH detector has been investigated (U. Bergmann) • Add track guidance into the EN ring finder to be universal (future plan) Ivan Kisel, KIP, Uni-Heidelberg

  12. To do Optimized STS geometry design Adapt the CA track finder for the new STS design CA TRD standalone track finder SIMD implementation of the KF track fit FPGA implementation of the KF track fit SIMD implementation of the CA track finder Add track guidance to the EN RICH ring finder Selective CA track finder (trigger version) Priorities depend on available time and manpower Ivan Kisel, KIP, Uni-Heidelberg

More Related