Pile-Up Pulse Decomposition Jia-Ye Chen
Outline Why to study Pile-up Pulse? Pile-up Pulse Decomposition Study Pulse Identification Algorithm : Original vs New Fitting (Normal, Pileup, Shoulder and Saturated) : Well Efficiency : Same as original one Residual : 1 % improvement Event Display of Trouble What I ever tried …
Time Projection Chamber
Get Pulse Form Cluster Get Pulses & Form Clusters
Set Hits & Find Track Candidates Set Hits (0.46) Find Track Candidates 2D 3D Hit Position
Particle Identification Algorithm
Pulse Identification Algorithm Original : nextPeakAdc – prevMinAdc > 15 Pile-up Pulse peakAdc > threshold (dynamic threshold) Separation of peakTdc > 2 clocks Pulse valley away from prevPeakTdc > 2 clocks Shoulder Pulse ( By Su-Yin Wang ) Δ(ΔADC ) < -8. Separation to neighboring peakTdc > 3.
Single Pulse
Pile-up Pulse
Shoulder Pulse
Pile-up & Shoulder Pulse
Saturated Pulse
Current Algorithm Deal with 2-pulse segment ONLY. Pulse width is the same as previous one Use TDC of 1/5 peakADC ” in the raising edge. Rebuild new pulses within the ranges o f old pulse widths. 3 segments within 3 individual pads have the same number of pulses.
Parameter for Pile-up adcForPileup = nextPeakAdc – prevMinAdc > 15
adcForPileup = 12.adcForPileup = 10.
adcForPileup = 8.adcForPileup = 5.
Event Display
What I ever tried New Pulse Identification Algorithm Pile-up, Shoulder, Saturated, and coupled. Number of pulses per segment <= 5 ADC sorting -> TDC sorting Rebuild new Pulse with new pulse width Use “ TDC of peakAdc ” instead of “ TDC of 1/5 peakADC ” in the raising edge.