1 / 39

Latest developments on high pT „mosaic trigger”

Latest developments on high pT „mosaic trigger”. A. Fulop, A. Agocs, B. Bozsogi and G. Vesztergombi. CBM Collaboration Meeting Split, 5-9 October 2009. OUTLINE. Introduction General case: curved tracks (CBM-STS) Special case: linear tracks (SHINE-Beam Monitor) Conclusion.

padma
Download Presentation

Latest developments on high pT „mosaic trigger”

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. Latest developments on high pT „mosaic trigger” A. Fulop, A. Agocs, B. Bozsogi and G. Vesztergombi CBM Collaboration Meeting Split, 5-9 October 2009

  2. OUTLINE Introduction General case: curved tracks (CBM-STS) Special case: linear tracks (SHINE-Beam Monitor) Conclusion

  3. Praga, CHEP 2009. Proceedings

  4. CORRIDORs Global Local MOSAICs

  5. Mosaics and chips on detector plane #N *2 HIT-OBJECT nr. #2: [M2,N,K2,(x2,y2),T2,S2] *1 HIT-OBJECT nr. #1: [M1,N,K1,(x1,y1),T1,S1]

  6. DEFINITION of the MOSAICs Each hit belongs to one SINGLE mosaic. One detector plane (pixel or strip) can be read out by a number of of xyter chips, and can be divided virtually to any number of mosaics, thus the chip boundaries generally are not coinciding with chip boundaries, but in special cases it is not excluded. CLUSTER assumption: In the next it is assumed that each hit will fire only a single pixel or strip, there is no analogue information only 0/1. HIT-OBJECT consists of integers: M = mosaic nr., N = plane nr., K = xyter-chip nr., X (Y) = coordinate(s), T = time, S = Slice-time Slice-time = ToF subtracted from T in units of the coincidence time window

  7. MemA Phase: A Detector SIMD cluster FILLING PROCESSING MemB DOUBLE BUFFER SCHEME MemA Detector SIMD cluster PROCESSING FILLING MemB Phase: B

  8. Double BUFFER xyter READ-OUT PARALLEL data-driven loading into Mosaic Memory Network: Mem(M,N) Each Mem(M,N) memory unit has connection to the corresponding Xyter-chip(s). Each has Nmem memory cell to store for each HIT-OBJECT: { K, (x,y), T, S} the rest of the information is contained in the unit address Serial filling during TBuffer in the MemA-set: Normal planes: S=0, 1, 2, …… Data will stay in MemA(M,N) units untouched. BUT!!!! Special treatment for Principal plane nr. N* Each HIT-OBJECT with N*=NPRINCIPAL will initiate a THREAD setting up the tables for the SIMD run after the end of the buffering period. Each THREAD will process one CORRIDOR.

  9. NORMAL PLANES: NORMAL PLANES: Hits from Mosaic(m,n) Ordered by SLICE-TIME: s Hits from Mosaic(m,n) Ordered by SLICE-TIME: s PRINCIPAL PLANE PRINCIPAL PLANE Mosaic address LIST for j-th hit (x,y,s) Mosaic address LIST for j-th hit (x,y,s) SIMD cluster PIXEL case in N* MemA Thread #j INIT: address LIST LOAD: hits defined by j-th hit in N* for slices: {s-1, s, s+1} FILLING TRACKING: within the CORRIDOR #j Principal plane CHECK: Trigger condition PROCESSING PHASE: A Detector planes: Mosaic(m,n) MemB

  10. SIMD in Corridor THREADs Load hits to Corridor Memory Principal plane defines the mosaics in each normal plane, one should collect hits from time-slices {S-1, S , S+1} to take into account boundary effects. Start tracking plane by plane After last plane detect surviving THREADs.

  11. NORMAL PLANES: NORMAL PLANES: Thread #j Hits from Mosaic(m,n) Ordered by SLICE-TIME: s Hits from Mosaic(m,n) Ordered by SLICE-TIME: s INIT: address LIST LOAD: hits defined by j-th hit in N* for slices: {s-1, s, s+1} PRINCIPAL PLANE PRINCIPAL PLANE TRACKING: within the CORRIDOR #j Mosaic address LIST for j-th hit (x,y,s) Mosaic address LIST for j-th hit (x,y,s) CHECK: Trigger condition PHASE: B PIXEL case in N* MemA PROCESSING Principal plane FILLING Detector planes: Mosaic(m,n) SIMD cluster MemB

  12. Special case: SHINE linear tracking with x and y strips

  13. Total cross-section trigger

  14. Beam Target NEAR FAR Valid interaction amin SHINE TPC experiment less than 107 proton/sec

  15. TRIGGER First level: ANTI ( BEAM+NEAR+FAR) Second level: ACCEPT: No continuation for BEAM particle in NEAR module or multiple track in NEAR (Single particle in NEAR without FAR is dubious.) Third level: CORRECTIONS: elastic scattering with FAR NEAR inefficiency interaction in NEAR single particle in NEAR but no BEAM in FAR - single low momentum secondary from target - interaction after NEAR

  16. X-corridor: Y-corridor: { M1,(i*-1),i*,(i*+1)} (x*) { M3,(i*-1),i*,(i*+1)} { M1,(j*-1),j*,(j*+1)} (y*) { M3,(j*-1),j*,(j*+1)} Test BEAM hodoscope Plane #1 Plane #2 Plane #3 Y-mosaics * * * Principal plane X-mosaics (x*,y*) in mozaics i* and j*

  17. DETNI-A 157Gd/Si Detector Module Goals • 108 n/sec in 100 cm2 • with 2 views, 2 hit/strip:400 MHz strip hit rate • with 5 Byte/hit:2 GByte/sec data Consequences • 128 channel ASIC • 20 chip/module • 20 MHz/chip • 100 MByte/chip 100 mm slide courtesy C.J.Schmidt

  18. Measurement of time, energy and position Data acquisition speed ~ 1Gbps Input Clock ~ 250MHz Input channels ~ 1024 or higher Data - 8-bit parallel after flash ADC ADC – Flash type 8-bit (MAX-106 600MSPS) Time stamp, channel-ID and status signals 32 bit(8-bit parallel x 4 packet) Understanding Data Acquisition System forN-XYTER www.gsi.de/documents/DOC-2007-Aug-28-2.ppt

  19. N-XYTER Block Schematic

  20. NORMAL PLANES: NORMAL PLANES: Hits from Mosaic(m,n) Ordered by SLICE-TIME: s Hits from Mosaic(m,n) Ordered by SLICE-TIME: s PRINCIPAL PLANE PRINCIPAL PLANE Mosaic address LIST for j-th hit (x.s) and(y,s) Mosaic address LIST for j-th hit (x,s) and (y,s) SIMD cluster STRIP case in N* MemA Thread #i, #j INIT: address LIST LOAD: hits defined by j-th hit in N* for slices: {s-1, s, s+1} FILLING TRACKING: within the CORRIDOR #i,j Principal plane CHECK: Match: X and Y time PROCESSING PHASE: A Detector planes: Mosaic X and Y MemB

  21. X and Y identical SIMD in parallel threads Load Corridor in Plane1 to HitCAMx(y) Search nearest hit : x1(y1) if any Load Corridor in Plane3 to HitCAMx(y) Search nearest hit : x3(y3) if any Calculate: abs(x1-x3) and abs((x1+x3)/2-x*) same on y If they are within the limits, then the BEAM x and y are accepted Compare x and y timing

  22. 3 Double sided x,y chip with strips of 50 micron pitch 6 n-xyter chips with 128 channel in each Mozaic size: 16 strips, 8 mozaics/chip Theoretical Number of SIMD threads = 16 ( 8 in X and 8 Y) If there is only maximum 1 hit/mozaic in Pricipal plane. Real number of SIMD threads = total number of hits in X and Y hits in the Principal plane during the TBuffer time. Good desing: beam intensity and buffer time matched to ensure in average 1 hit/mozaic. One expects less than 20 SIMD threads, which reqires 40 HitCAM1 associative memory units of limited size (<8) CONCLUSION: Beam trigger can be programmed in a SINGLE FPGA.

  23. Conclusions Simulations produced effective algorithms Basic SIMD structure of DAQ and Trigger is proposed Start hardware design for 3 plane Beam Hodoscope

  24. END

More Related