Off-Detector Processing for Phase II Track Trigger Ulrich Heintz (Brown University) for U.H., M. Narain (Brown U) M. Johnson, R. Lipton (Fermilab) E. Hazen,

Slides:



Advertisements
Similar presentations
Track Trigger Designs for Phase II Ulrich Heintz (Brown University) for U.H., M. Narain (Brown U) M. Johnson, R. Lipton (Fermilab) E. Hazen, S.X. Wu, (Boston.
Advertisements

1 ACES Workshop, March 2011 Mark Raymond, Imperial College. Two-in-one module PT logic already have a prototype readout chip for short strips in hand CBC.
CS 277 – Spring 2002Notes 21 CS 277: Database System Implementation Notes 02: Hardware Arthur Keller.
Jan. 2009Jinyuan Wu & Tiehui Liu, Visualization of FTK & Tiny Triplet Finder Jinyuan Wu and Tiehui Liu Fermilab January 2010.
TDC in ACTEL FPGA Tom Sluijk Wilco Vink Albert Zwart Fabian Jansen.
Some Thoughts on L1 Pixel Trigger Wu, Jinyuan Fermilab April 2006.
LHCb Upgrade Overview ALICE, ATLAS, CMS & LHCb joint workshop on DAQ Château de Bossey 13 March 2013 Beat Jost / Cern.
8th Workshop on Electronics for LHC Experiment, Colmar, France, 10 Sep R.Ichimiya, ATLAS Japan 1 Sector Logic Implementation for the ATLAS Endcap.
Chapter 1 and 2 Computer System and Operating System Overview
L1 CTT May 14, 2002 New Scheme for Tracking Marvin Johnson.
BTeV Trigger Architecture Vertex 2002, Nov. 4-8 Michael Wang, Fermilab (for the BTeV collaboration)
February 19th 2009AlbaNova Instrumentation Seminar1 Christian Bohm Instrumentation Physics, SU Upgrading the ATLAS detector Overview Motivation The current.
FTK poster F. Crescioli Alberto Annovi
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.
The Track-Finding Processor for the Level-1 Trigger of the CMS Endcap Muon System D.Acosta, A.Madorsky, B.Scurlock, S.M.Wang University of Florida A.Atamanchuk,
LECC 2004 – Boston – September 13 th L.Guiducci – INFN Bologna 1 The Muon Sorter in the CMS Drift Tubes Regional Trigger G.M. Dallavalle, Luigi Guiducci,
Proposal by the Numbers 3 Trigger layers (plus 2 “short” layers) provide full coverage to eta=??? in 15 degree sectors Hits collected in real time, sent.
L1 Pixel Trigger: Is 20 us Latency Achievable? David Christian Fermilab April 29, 2015.
U N C L A S S I F I E D FVTX Detector Readout Concept S. Butsyk For LANL P-25 group.
Leo Greiner IPHC meeting HFT PIXEL DAQ Prototype Testing.
Evaluation of the Optical Link Card for the Phase II Upgrade of TileCal Detector F. Carrió 1, V. Castillo 2, A. Ferrer 2, V. González 1, E. Higón 2, C.
10/18: Lecture topics Memory Hierarchy –Why it works: Locality –Levels in the hierarchy Cache access –Mapping strategies Cache performance Replacement.
ATLAS Forward Detector Trigger ATLAS is presently planning to install forward detectors (Roman Pot system) in the LHC tunnel with prime goal to measure.
CPT Week, April 2001Darin Acosta1 Status of the Next Generation CSC Track-Finder D.Acosta University of Florida.
April CMS Trigger Upgrade Workshop - Paris1 Christian Bohm, Stockholm University for the L1 calorimeter collaboration The ATLAS Trigger Upgrade.
Phase 2 Tracker R&D Background: Initial work was in the context of the long barrel on local tracklet- based designs. designs of support structures and.
Ronald Lipton PMG June Layer 0 Status 48 modules, 96 SVX4 readout chips 6-fold symmetry 8 module types different in sensor and analog cable length.
NA62 Trigger Algorithm Trigger and DAQ meeting, 8th September 2011 Cristiano Santoni Mauro Piccini (INFN – Sezione di Perugia) NA62 collaboration meeting,
A Pattern Recognition Scheme for Large Curvature Circular Tracks and Its FPGA Implementation Example Using Hash Sorter Jinyuan Wu and Z. Shi Fermi National.
Design Discussion of Mechanical / Electrical Interfaces Bill Cooper (Fermilab) (Layer 1) VXD.
CMS and the Number Sorter Presented to you by: Bobby Scurlock Faculty Mentor: Darin Acosta.
Phase 2 Tracker R&D Background: Initial work was in the context of the long barrel on local tracklet- based designs. designs of support structures and.
CALTECH CS137 Winter DeHon CS137: Electronic Design Automation Day 13: February 20, 2002 Routing 1.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Connecting Devices CORPORATE INSTITUTE OF SCIENCE & TECHNOLOGY, BHOPAL Department of Electronics and.
March 9, 2005 HBD CDR Review 1 HBD Electronics Preamp/cable driver on the detector. –Specification –Schematics –Test result Rest of the electronics chain.
KLM Trigger Status Barrel KLM RPC Front-End Brandon Kunkler, Gerard Visser Belle II Trigger and Data Acquistion Workshop January 17, 2012.
Roberto Barbera (Alberto Pulvirenti) University of Catania and INFN ACAT 2003 – Tsukuba – Combined tracking in the ALICE detector.
2001/02/16TGC off-detector PDR1 Sector Logic Status Report Design Prototype-(-1) Prototype-0 Schedule.
December 16, 2005M Jones1 New Level 1 Track Triggers Outputs from SLAM provide lists of axial tracks plus associated stereo information Consider new Level.
STAR Pixel Detector readout prototyping status. LBNL-IPHC-06/ LG22 Talk Outline Quick review of requirements and system design Status at last meeting.
3/12/2013Computer Engg, IIT(BHU)1 CONCEPTS-1. Pipelining Pipelining is used to increase the speed of processing It uses temporal parallelism In pipelining,
CMS Upgrade Workshop - Fermilab Trigger Studies Using Stacked Pixel Layers Mark Pesaresi
The SLHC CMS L1 Pixel Trigger & Detector Layout Wu, Jinyuan Fermilab April 2006.
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 External Sorting Chapter 13.
LHCb upgrade Workshop, Oxford, Xavier Gremaud (EPFL, Switzerland)
Proposal for a “Switchless” Level-1 Trigger Architecture Jinyuan Wu, Mike Wang June 2004.
3 May 2003, LHC2003 Symposium, FermiLab Tracking Performance in LHCb, Jeroen van Tilburg 1 Tracking performance in LHCb Tracking Performance Jeroen van.
Dave Kieda* for the VERITAS Collaboration *University of Utah Department of Physics & Astronomy.
Simulation Plan Discussion What are the priorities? – Higgs Factory? – 3-6 TeV energy frontier machine? What detector variants? – Basic detector would.
August 24, 2011IDAP Kick-off meeting - TileCal ATLAS TileCal Upgrade LHC and ATLAS current status LHC designed for cm -2 s 7+7 TeV Limited to.
FPGA based signal processing for the LHCb Vertex detector and Silicon Tracker Guido Haefeli EPFL, Lausanne Vertex 2005 November 7-11, 2005 Chuzenji Lake,
DAQ Selection Discussion DAQ Subgroup Phone Conference Christopher Crawford
Mu3e Data Acquisition Ideas Dirk Wiedner July /5/20121Dirk Wiedner Mu3e meeting Zurich.
CMX: Update on status and planning Yuri Ermoline, Wojciech Dan Edmunds, Philippe Laurens, Chip Michigan State University 7-Mar-2012.
The LHCb Calorimeter Triggers LAL Orsay and INFN Bologna.
Tracker Trigger System Marvin Johnson for the Tracker Trigger Group October 2009.
GGT-Electronics System design Alexander Kluge CERN-PH/ED April 3, 2006.
Some input to the discussion for the design requirements of the GridPixel Tracker and L1thack trigger. Here are some thoughts about possible detector layout.
Overview of the ATLAS Fast Tracker (FTK) (daughter of the very successful CDF SVT) July 24, 2008 M. Shochet.
CMS EMU TRIGGER ELECTRONICS
Some basic ideas (not a solution)
eXtremely Fast Tracker; An Overview
Vertex 2005 November 7-11, 2005 Chuzenji Lake, Nikko, Japan
Example of DAQ Trigger issues for the SoLID experiment
SVT detector electronics
Counters Next, we’ll look at different kinds of counters and discuss how to build them. These are not only examples of sequential analysis and design,
The LHCb Level 1 trigger LHC Symposium, October 27, 2001
The LHCb L0 Calorimeter Trigger
SVT detector electronics
Counters Next, we’ll look at different kinds of counters and discuss how to build them. These are not only examples of sequential analysis and design,
Presentation transcript:

Off-Detector Processing for Phase II Track Trigger Ulrich Heintz (Brown University) for U.H., M. Narain (Brown U) M. Johnson, R. Lipton (Fermilab) E. Hazen, S.X. Wu, (Boston U)

basic idea for each sector  represent every possible hit combination by a logic “equation”: S 1i  S 1o  S 2i  S 2o  S 3i  S 3o  create a table of all possible equations in FPGA  load all hits for an event into registers in FPGA  evaluate all equations simultaneously in one clock cycle  equations which are satisfied correspond to reconstructed tracks  timing dominated by time needed to load hits into FPGAs problem  if we tried to do all six layers at one time  too many equations  too many inputs  need to factor problem 10/28/2009Ulrich Heintz - CMS Upgrade Workshop2

sector size what is the minimum p T we need to trigger on? tracks must be contained in 3 adjacent sectors sector size  minimum p T built into hardware design need to decide “soon”  here assume 15 o sectors 10/28/2009Ulrich Heintz - CMS Upgrade Workshop3 min p T sector opening angle 2 GeV18 o 2.5 GeV15 o 5 GeV7.5 o  requires more/wider modules  lots of inputs but geometry easier  less inputs – makes trigger easier

tracklets double stacks allow local track finding on each rod combine stubs from the two stacks in each station to form tracklets  drop in rate by about factor 4 (but need  30 bits/tracklet)  for each stack in inner layer need to process data from two adjacent stacks in z in outer layer 10/28/2009Ulrich Heintz - CMS Upgrade Workshop4 stub (2-layer coincidence) Tracklet (4-layer coincidence with P T validation) x x x x x x x x x x x x x x x x x x x x

tracklet inputs max stub rate in simulation0.3 MHz/cm 2 safety fudge factor (MC imperfect, stat fluctuations) 10 ave rate over z/max rate50% module area (inner station)4200 cm 2 stub size20 bits data rate from one layer125 Gb/s link bandwidth8 Gb/s number of links/station30 10/28/2009Ulrich Heintz - CMS Upgrade Workshop5

tracklet processing processing done off detector  input 30 fibers per station  fits into current FPGA (44 inputs at 10 Gb/s)  must do all processing in 25 ns local to each module  42 modules in inner layer  need information from top and bottom stacks plus neighboring stack for z overlap  sensor overlap in  so no rod to rod communication 6

tracklet processing data volume  8 20 bits/stub  160 bits  fits into FPGA registers  compare all hits between stacks simultaneously  compare in both  and z z range restricted by length of IP  range restricted by min. p T 10/28/2009Ulrich Heintz - CMS Upgrade Workshop7

tracklet bandwidth simulation shows tracks are half the stub rate safety factor  10 included fluctuations  should be less over rod  use safety factor of 6  track density drops faster than stub density with z  use same density as for stubs (conservative) bits/tracklet = 48 Gb/s 8

tracklet output sort tracklets by destination segment  send over dedicated fiber line  12 segments/sector times 3 sectors = 36 fibers 48 Gb/s divided among 36 fibers so 8 Gb/s fiber OK  project to 2 different layers  72 output fibers from tracklet forming FPGA 9 Segments must have overlap to account for projection errors (about 10% of segment)

segment processor receive tracklets from 2 stations in 3 sectors plus stubs from anchor layer in home sector  1 fiber/rod/layer/sector for inner and middle layers  3 rods times 3 sectors plus 3 for anchor station = 12 input fibers  plus 1 fiber for trigger output need to compare all possible combinations of input tracklets so need all tracklets in registers in FPGA  3 times 40 tracklets/station = 120 tracklets in 12 segments  10 tracklets/segment times 30 bits = 300 bits so OK output tracks ordered in p T - highest first 10

sector processor 10/28/2009Ulrich Heintz - CMS Upgrade Workshop11 inner station (stubs) 30 middle station (stubs) 30 outer station (stubs) 30 (tracklets) 1 12 FPGAs inner and middle station tracklets from sector n-1 inner and middle station tracklets from sector n tracks out 12 segment blocks tracklet blocks sorter blocks

12 duplicate eliminator find tracks in all 3 layers simultaneously  remove duplicate tracks receive data from 12 segments times 3 anchor stations or 36 fibers tracks ordered in p T  simplifies search output tracks on perhaps 4 fibers

13 pipeline stages in tracklet block (1) load stub data from sensors (2) form tracklets from stubs (3) sort tracklets by destination segment (4) transfer to segment processor

14 pipeline stages in segment processor (5) receive tracklet data from 3 stations (6) find tracks (7) check z consistency (8) transfer tracks to duplicate eliminator

15 pipeline stages duplicate eliminator (9) receive track data from all 3 layers (10) compare inputs, eliminate duplicates (11) send track data to L1 trigger  11 total pipe line stages for system < 1  s

16 FPGA capacity doubling FPGA capacity: 12 segments  6 doubling I/O capacity: 44 lines  88 tracklet processor  6 segments requires only 36 input lines  tracklet input requires 30 lines and output 36 so it would fit segment processor and duplicate eliminator are not changed

trigger and download (unidirectional GBT) download is infrequent and slow  single twisted pair cable should work. trigger and clock are common to all sensors  optical link to tracker end  twisted pair on rod  could put additional link at mid point of rod if needed 17

18 tracker readout readout event rate is 0.25% of trigger rate at 100 kHz trigger rate factor of 10 larger event size would take 2.5% of the fiber band width put data on the fibers from the sensors and separate it out in the tracklet block

19 optical link power 30 fibers in inner station/sector about same number of tracks in all stations  90 fibers/sector 24 sectors  2160 fibers power  1 watt/driver  2 kW

system advantages robust  can lose a stub in any layer  still form track with middle layer tracklet and stubs in inner and outer layer. easy scaling with bigger gate arrays one sensor or chip failure does not disable the trigger in that part of a layer 20

system drawbacks very large number of high speed links many single fiber connections  reliability  mass problem is significantly more difficult if rate estimates are too low  get better estimates after LHC start up 21

Summary getting all required data into one place is an important constraint very large number of high speed links  reliability, power, mass not constrained by FPGA size 2 layer design is simpler but it still has many of the same issues, potentially not as robust verify rate estimates with LHC data need MC simulations implementing specific algorithms 22