BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:A Fast Clustering Block for Silicon Strip Seeded Track Trigger
DTSTART;VALUE=DATE-TIME:20120504T130000Z
DTEND;VALUE=DATE-TIME:20120504T133000Z
DTSTAMP;VALUE=DATE-TIME:20130519T201719Z
UID:indico-contribution-9@cern.ch
DESCRIPTION:Speakers: Mr. NEWCOMER\, Mitch (University of Pennsylvania)\nA
  viable seeded track trigger for a high rate collider detector environment
  must have excellent angular precision\, response times commensurate with 
 beam crossing rate and low mass.    We have designed a fast clustering blo
 ck servicing 128 contiguous strips to be included in an LHC upgrade silici
 on strip readout ASIC with these objectives in mind.   The block is based 
 on the presence of an analog front end with binary (threshold determined) 
 strip readout latched at each beam crossing.  Combinatorial logic tests fo
 r the presence of one or two adjacent strips over threshold\, a cluster\, 
 at each beam crossing and records the seven bit address of  up to two clus
 ters via a high speed  LVDS output.   A correlator chip receives this data
  and looks for coincident hits between silicon strip layers.  Since the cl
 ustering output will report the presence of one or two hit strips\, a half
  strip width (~40um) resolution may be possible for each cluster.   Our re
 sults show that the combinatorial clustering logic will settle within 6ns.
  Assuming a beam crossing rate of 40MHz\,  serialized data shifted out at 
 640MHz will meet the required beam synchronous update rate so that the cor
 relator chip will receive cluster information delayed by a fixed offset of
  only two beam crossings.  Present power estimates suggest that the fast c
 luster block with LVDS driver will consume less than 20mW.\n\nhttp://indic
 o.cern.ch/contributionDisplay.py?contribId=9&sessionId=5&confId=154525
LOCATION:INFN Pisa
URL:http://indico.cern.ch/contributionDisplay.py?contribId=9&sessionId=5&c
 onfId=154525
END:VEVENT
END:VCALENDAR
