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 Laboratory (FNAL), Batavia, IL
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC02-76CH03000
- OSTI ID:
- 15017014
- Report Number(s):
- FERMILAB-CONF-04-270-E
- 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)
A 3D FPGA Track Segment Seeding Engine Based on the Tiny Triplet Finder
Journal Article
·
Tue Feb 28 23:00:00 EST 2006
· IEEE Trans.Nucl.Sci.53:671-676,2006
·
OSTI ID:891081
Curved track segment finding using Tiny Triplet Finder (TTF)
Conference
·
Tue Oct 31 23:00:00 EST 2006
·
OSTI ID:897234
A 3D FPGA Track Segment Seeding Engine Based on the Tiny Triplet Finder
Conference
·
Thu Dec 31 23:00:00 EST 2020
·
OSTI ID:1833303