Tiny Triplet Finder (TTF) A Rack Segment Recognition Scheme and its FPGA Implementation Developed in the BTeV Level 1 Trigger System

摘要

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(N log(N)), which is significantly smaller for large N. The TTF is also suitable for software implementation and many other pattern recognition problems.