Belle2 Framework/DAQ meeting, Munich, February 2011

Slides:



Advertisements
Similar presentations
May 14, 2015Pavel Řezníček, IPNP Charles University, Prague1 Tests of ATLAS strip detector modules: beam, source, G4 simulations.
Advertisements

Simulation Studies of a (DEPFET) Vertex Detector for SuperBelle Ariane Frey, Max-Planck-Institut für Physik München Contents: Software framework Simulation.
Standalone VeloPix Simulation Jianchun Wang 4/30/10.
28 Feb 2006Digi - Paul Dauncey1 In principle change from simulation output to “raw” information equivalent to that seen in real data Not “reconstruction”,
1Calice-UK Cambridge 9/9/05D.R. Ward David Ward Compare Feb’05 DESY data with Geant4 and Geant3 Monte Carlos. Work in progress – no definitive conclusions.
1 TPG digitization improvements Progress description Rikard Sandström Geneva University Software parallel session 31 Mars -04 CERN.
Jianchun Wang Marina Artuso Syracuse University 11/06/00 MC Simulation of Silicon Pixel Detector.
The Transverse detector is made of an array of 256 scintillating fibers coupled to Avalanche PhotoDiodes (APD). The small size of the fibers (5X5mm) results.
Tracking at LHCb Introduction: Tracking Performance at LHCb Kalman Filter Technique Speed Optimization Status & Plans.
Modern Navigation Thomas Herring
07 October 2004 Hayet KEBBATI -1- Data Flow Reduction and Signal Sparsification in MAPS Hayet KEBBATI (GSI/IReS)
1 Realistic top Quark Reconstruction for Vertex Detector Optimisation Talini Pinto Jayawardena (RAL) Kristian Harder (RAL) LCFI Collaboration Meeting 23/09/08.
Optimising Cuts for HLT George Talbot Supervisor: Stewart Martin-Haugh.
11 Sep 2009Paul Dauncey1 TPAC test beam analysis tasks Paul Dauncey.
Track extrapolation to TOF with Kalman filter F. Pierella for the TOF-Offline Group INFN & Bologna University PPR Meeting, January 2003.
16-Nov-2002Konstantin Beloous1 Digital Hadron Calorimeter Energy Resolution.
1 Calorimetry Simulations Norman A. Graf for the SLAC Group January 10, 2003.
NA62 Gigatracker Working Group 28 July 2009 Massimiliano Fiorini CERN.
G. BrunoOffline week - February Comparison between test- beam data and the SPD simulations in Aliroot G. Bruno, R. Santoro Outline:  strategy of.
CBM ECAL simulation status Prokudin Mikhail ITEP.
Fast Tracking of Strip and MAPS Detectors Joachim Gläß Computer Engineering, University of Mannheim Target application is trigger  1. do it fast  2.
3D Event reconstruction in ArgoNeuT Maddalena Antonello and Ornella Palamara 11 gennaio 20161M.Antonello - INFN, LNGS.
Jyly 8, 2009, 3rd open meeting of Belle II collaboration, KEK1 Charles University Prague Zdeněk Doležal for the DEPFET beam test group 3rd Open Meeting.
Digitization and hit reconstruction for Silicon Tracker in MarlinReco Sergey Shulga, Tatiana Ilicheva JINR, Dubna, Russia GSU, Gomel, Belarus LCWS07 30.
CALOR April Algorithms for the DØ Calorimeter Sophie Trincaz-Duvoid LPNHE – PARIS VI for the DØ collaboration  Calorimeter short description.
ECAL software development Yuri Kharlov IHEP Protvino.
1 Nick Sinev, ALCPG March 2011, Eugene, Oregon Investigation into Vertex Detector Resolution N. B. Sinev University of Oregon, Eugene.
T. Lari – INFN Milan Status of ATLAS Pixel Test beam simulation Status of the validation studies with test-beam data of the Geant4 simulation and Pixel.
1 Oct 2009Paul Dauncey1 Status of 2D efficiency study Paul Dauncey.
Calice Meeting Argonne Muon identification with the hadron calorimeter Nicola D’Ascenzo.
1 Giuseppe G. Daquino 26 th January 2005 SoFTware Development for Experiments Group Physics Department, CERN Background radiation studies using Geant4.
A. SarratILC TPC meeting, DESY, 15/02/06 Simulation Of a TPC For T2K Near Detector Using Geant 4 Antony Sarrat CEA Saclay, Dapnia.
SiD Tracking in the LOI and Future Plans Richard Partridge SLAC ALCPG 2009.
10/25/2007Nick Sinev, ALCPG07, FNAL, October Simulation of charge collection in chronopixel device Nick Sinev, University of Oregon.
BESIII offline software group Status of BESIII Event Reconstruction System.
CMOS Pixels Sensor Simulation Preliminary Results and Plans M. Battaglia UC Berkeley and LBNL Thanks to A. Raspereza, D. Contarato, F. Gaede, A. Besson,
Clear Performance and Demonstration of a novel Clear Concept for DEPFET Active Pixel Sensors Stefan Rummel Max-Planck-Institut für Physik – Halbleiterlabor.
IPHC, Strasbourg / GSI, Darmstadt
High Energy Physics experiments.
Overview Part 2 – Combinational Logic Functions and functional blocks
Straw prototype test beam 2017: first glance at the data
PixSim package to simulate pixel detectors digitization
Some input to the discussion for the design requirements of the GridPixel Tracker and L1thack trigger. Here are some thoughts about possible detector layout.
Spatial Resolution of DEPFET Matrices
Huagen Xu IKP: T. Randriamalala, J. Ritman and T. Stockmanns
TOF CALIBRATION DATABASE
Muon stopping target optimization
HV-MAPS Designs and Results I
Track Finding.
Studies with PandoraPFA
Review Graph Directed Graph Undirected Graph Sub-Graph
Mean Shift Segmentation
Detector Configuration for Simulation (i)
Simulation on the Response of the STAR HFT Pixel Detector
Data Analysis in Particle Physics
p0 life time analysis: general method, updates and preliminary result
Time-sensitive CMOS MAPS
Graphing with Uncertainties
Efficient Importance Sampling Techniques for the Photon Map
Image Coding and Compression
Simulation on the Response of the STAR HFT Pixel Detector
PIXEL Slow Simulation Status Report
Govt. Polytechnic Dhangar(Fatehabad)
ICRC2011, 32ND INTERNATIONAL COSMIC RAY CONFERENCE, BEIJING 2011
Why silicon detectors? Main characteristics of silicon detectors:
Preliminary design of the behavior level model of the chip
° status report analysis details: overview; “where we are”; plans: before finalizing result.. I.Larin 02/13/2009.
Lecture-Hashing.
Clustering-based Studies on the upgraded ITS of the Alice Experiment
Presentation transcript:

Belle2 Framework/DAQ meeting, Munich, 21-23 February 2011 The PXD Digitizer Peter Kvasnička Institute of Particle and Nuclear Physics, Charles University, Prague Belle2 Framework/DAQ meeting, Munich, 21-23 February 2011

The PXD digitizer: What it does For each simulated hit (PXDSimHit) obtained from Geant4 Track generation. The SimHits are created where Geant4 detects a passage of a particle through an active detector. δ electrons are treated separately Ionization. The track segment is divided into sub-segments (“ionization points”), whose charge is smeared according to the Landau distribution using the code borrowed from Geant4 (G4UniversalFluctuation). This provides substantially higher precision than in the generating “all-detector” Geant4 simulation. 75 µm SimHit position

The PXD digitizer: What it does (cont’d) Hit reconstruction. In the present implementation, digitization is coupled with hit reconstruction to avoid the storage of digits when they are not needed (the digits can however be saved if desired). Clustering is based on seed and neighbor threshold values. Hit position is estimated separately in each coordinate, by center-of –gravity for cluster projections of 1 or 2 pixels, and analog head-tail (approximate the cluster by a uniform charge distribution consistent with pixel signals) for larger clusters. Output The output of the digitizer is a collection of PXDDigits, that is, fired pixels stored serially with end-of-cluster marks. Each PXDDigit contains: encoded pixel row and column number + end-of-cluster marks. pixel signal in electrons or AD a collection of PXDHits, with each reconstructed hit containing (apart from sensor identification) position estimate (corrected for mean Lorentz shift) and its error covariance total collected charge (analog in electrons or digital in ADU A reference (relation) to SimHits that contributed.

The PXD digitizer: What it does (cont’d) Drift and diffusion. The ionization points are then drifted to the readout plane, Lorentz-shifted in the presence of a magnetic field and smeared by a Gaussian distribution to account for diffusion during the drift time. Lateral diffusion. Finally, the total charge of an ionization point is split into carrier groups of ~100 electrons. For each carrier group, a random walk in the readout plane is sampled until the internal gate region of a pixel cell is reached. Thus, we have a redistribution of the charge to neighbor pixels. Digitization. For each pixel electrode we now have a signal dependent on how many ionization points contributed. Background and noise. The pixels are then populated by random electronic noise and background signal as appropriate. Analog-To-Digital converters will be used in the data processing pipeline, Therefore, the analog signals are converted first into digital values.

Issues to discuss: Overview Physics: Two issues appeared at the Bonn meeting Landau fluctuations: Odd behavior seen in energy spectra. Handling of photons The digitizer (or, better, the SensitiveDetector class) ignores photons. Code organization Separate the digitizer and the clusterizer: The original concept was not to store digits when they are not needed. But the digits and clustering algos will be important for some time now. Calculation of resolutions. It is not possible (or is at least unreasonably costly) to calculate error matrices of individual reconstructed hits. Currently they are estimated based histograms acquired in calibration runs. Technical issues (code optimization, storage) Storage of digits: The number of digits to process/store can be huge, so the storage and processing times have to be optimized.

Issues to discuss 1: Landau fluctuations Current implementation: We have thin detectors, so Geant typically uses a single step to track a particle through. At such large steps, the electromagnetic simulation is not precise. The energy fluctuations are thus re-computed using basically the same formulas that Geant would use with smaller step (G4UniversalFluctuation) There is a particle energy threshold, below which mean deopisited energy is used instead. Parameters that control energy fluctuations: bool m_landauFluct If set, internal Landau fluctuations will be used instead of those directly from Geant4. float m_landauBetaGammaCut Below this beta*gamma factor, internal Landau fluctuations are not used (default 0.7) double m_prodThreshOnDeltaRays Production threshold cut on delta electrons , same as in Geant4 (80keV ~ 0.05 mm). double m_segmentLength Length of path segment - spatial precision of charge distribution simulation. 10 µm or less recommended.

Issues to discuss 1: Landau fluctuations Proposal: Dispose of internal fluctuations code and use smaller Geant4 steps in Si instead. Optimize at a later stage. +: Get rid of the internal fluctuation mechanism - : More expensive in terms of computation time. - : More complex, or at least different SensitiveDetector and digitizer code: we will have to digitize Geant4 steps. Implementation: Geant step size in Si should be limited to ~10 µm or even less. What shall be done: Set limit on step size in UserLimits for Si sensitive volumes. Implement a “limiting” transport process that will do nothing but apply the limit in SI sensitive volumes.

Issues to discuss 2: Handling of photons Current implementation: The SensitiveDetector class does not generate hits for photons. Tasks: Check that we have correct physics in Geant4 Adjust the SensitiveDetector class.

Issues to discuss 3: Code organization Separate the digitizer and the clusterizer: The original concept was not to store digits when they are not needed. But the digits and clustering algos will be important for some time now. This has to be done, for several reasons: Clearer code organization (obvious, see above) The use of MC particle / SimHit relations to digits will be cleaner if done using the basf2 mechanisms.

Issues to discuss 4: Technical: Storage of digits We need TObject-ized constant-size objects for efficient storage. Clusters are inherently of variable size, storage of pre-defined arrays of pixels is not optimal. Proposal: Store individual fired pixels with end-of-cluster flag set as a bit in the CellID. Danger: Can we be sure that the order is preserved in TClonesArray? We need an int to store CellID (encoded cell row and column), a codec class is provided. Using one bit as an end-of-cluster flag, we will have serialized storage of digits, relatively easy to read and process. Individual digits may have different relations to Mcparticles/SimHits, these will be combined in hit reconstruction. Do we accept multiple relations per reconstructed hit?

Issues to discuss 4: Technical: Data structures The structure that stores digits in processing is typedef std::map<int, std::map<int, Digit*> > DigitsMap; // unique sensorID, unique pixelID, Digit struct Digit { int cellIDZ; int cellIDRPhi; float charge; PXDSimHitMap pxdSimHitMap; }; This seems to be quite efficient overall, but it is awkward to navigate, for example when one searches nearest neighbors of a pixel – and that is the time-consuming step. Proposal: Invest in a single 2D array (boost::MultiArray?), re-used for each sensor. +: Fast access, fast clearing of elements -: Larger memory footprint, some clearing costs. Use sparse array storage, that is, a 1D array plus column and row index arrays. +: Memory efficient, relatively fast navigation -: Re-allocation costs, costly clearing of elements.

Schedule The items discussed here will be implemented after the first release of the digitizer appears (exception: storage of digits)

Thanks for your attention!