Tiny Triplet Finder (TTF) - a track segment recognition scheme and its FPGA implementation developed in the BTeV level 1 trigger system
Conference
·
OSTI ID:15017014
We describe a track segment recognition scheme called the Tiny Triplet Finder (TTF) that involves the grouping of three hits satisfying a constraint, for example, forming a straight line. The TTF performs this O(n{sup 3}) function in O(n)time. The logic element usage in FPGA implementations of typical track segment recognition functions are O(N{sup 2}), where N is the number of bins in the coordinate considered, while that for the TTF is O( log( )), which is significantly smaller for large N. The TTF is also suitable for software implementation and 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:
- 15017014
- Report Number(s):
- FERMILAB-CONF-04-270-E; TRN: US0605241
- Country of Publication:
- United States
- Language:
- English
Similar Records
The application of Tiny Triplet Finder (TTF) in BTeV pixel trigger
Curved track segment finding using Tiny Triplet Finder (TTF)
The Tiny Triplet Finder as a Versatile Track Segment Seeding Engine for Trigger Systems
Journal Article
·
Wed Mar 01 00:00:00 EST 2006
· IEEE Trans.Nucl.Sci.53:671-676,2006
·
OSTI ID:15017014
+1 more
Curved track segment finding using Tiny Triplet Finder (TTF)
Conference
·
Wed Nov 01 00:00:00 EST 2006
·
OSTI ID:15017014
+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:15017014