Neural-Network-Assisted Binary Template Construction for Matrix-Based Pattern Matching in the STCF MDC

Abstract

The Super Tau-Charm Facility, operating at high luminosity, will produce high event rates and high data throughput, imposing stringent requirements on fast track finding and data reduction and compression algorithms in the High-Level Trigger. Local track segment finding in the Main Drift Chamber underpins subsequent segment combination and full track reconstruction, yet high background rates and limited detection efficiency can significantly increase the risk of false triggers and signal loss in pattern matching algorithms. This paper presents a neural-network-assisted framework for constructing binary template libraries used in matrix-based pattern matching for MDC local track segment finding. The framework formulates template construction as a differentiable multi-objective optimization problem, employing a neural network to jointly learn template parameters under multiple constraints. After training, only binary template pairs are exported and deployed into the existing bitwise pattern matching routine, requiring no neural network inference at runtime and thus preserving the deterministic, fast, and parallelizable nature of the online algorithm. Experimental results based on simulation samples demonstrate that, under limited detection efficiency, the resulting template library maintains relatively high signal retention across different transverse momentum ranges and background levels, and can be flexibly tailored to adjust the coverage range according to practical requirements. The proposed approach decouples the physics performance from the computational speed by combining the improved physics performance brought by offline neural-network-based optimization with the determinism and high speed of a conventional online algorithm, suggesting a new research direction for artificial-intelligence-enhanced online data processing in high-luminosity particle collider experiments.