The application of Tiny Triplet Finder (TTF) in BTeV pixel trigger
Journal Article
·
· IEEE Trans.Nucl.Sci.53:671-676,2006
OSTI ID:891081
We describe a track segment recognition scheme called the Tiny Triplet Finder (TTF) that involves grouping of three hits satisfying a constraint such as forming of a straight line. The TTF performs this O(n{sup 3}) function in O(n) time, where n is number of hits in each detector plane. The word ''tiny'' reflects the fact that the FPGA resource usage is small. The number of logic elements needed for the TTF is O(Nlog(N)), where N is the number of bins in the coordinate considered, which for large N, is significantly smaller than O(N{sup 2}) needed for typical implementations of similar functions. The TTF is also suitable for software implementations as well as many other pattern recognition problems.
- Research Organization:
- Fermi National Accelerator Lab. (FNAL), Batavia, IL (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC02-76CH03000
- OSTI ID:
- 891081
- Report Number(s):
- FERMILAB-PUB-06-063-E; TRN: US0701120
- Journal Information:
- IEEE Trans.Nucl.Sci.53:671-676,2006, Conference: Presented at 14th IEEE - NPSS Real Time Conference 2005 (RT2005), Stockholm, Sweden, 4-10 Jun 2005
- Country of Publication:
- United States
- Language:
- English
Similar Records
Tiny Triplet Finder (TTF) - a track segment recognition scheme and its FPGA implementation developed in the BTeV level 1 trigger system
Curved track segment finding using Tiny Triplet Finder (TTF)
The Tiny Triplet Finder as a Versatile Track Segment Seeding Engine for Trigger Systems
Conference
·
Mon Nov 01 00:00:00 EST 2004
·
OSTI ID:891081
+2 more
Curved track segment finding using Tiny Triplet Finder (TTF)
Conference
·
Wed Nov 01 00:00:00 EST 2006
·
OSTI ID:891081
+1 more
The Tiny Triplet Finder as a Versatile Track Segment Seeding Engine for Trigger Systems
Conference
·
Tue May 16 00:00:00 EDT 2023
·
OSTI ID:891081