arXiv subjects

Vesal Razavimaleki

Publications and source records attributed to Vesal Razavimaleki.

4 recordsLinked to original sources

arXiv2024

Cosmic ray susceptibility of the Terahertz Intensity Mapper detector arrays

We report on the effects of cosmic ray interactions with the Kinetic Inductance Detector (KID) based focal plane array for the Terahertz Intensity Mapper (TIM). TIM is a NASA-funded balloon-borne experiment designed to probe the peak of the star formation in the Universe. It employs two spectroscopic bands, each equipped with a focal plane of four $\sim\,$900-pixel, KID-based array chips. Measurements of an 864-pixel TIM array shows 791 resonators in a 0.5$\,$GHz bandwidth. We discuss challenges with resonator calibration caused by this high multiplexing density. We robustly identify the physical positions of 788 (99.6$\,$%) detectors using a custom LED-based identification scheme. Using this information we show that cosmic ray events occur at a rate of 2.1$\,\mathrm{events/min/cm^2}$ in our array. 66$\,$% of the events affect a single pixel, and another 33$\,$% affect $<\,$5 KIDs per event spread over a 0.66$\,\mathrm{cm^2}$ region (2 pixel pitches in radius). We observe a total cosmic ray dead fraction of 0.0011$\,$%, and predict that the maximum possible in-flight dead fraction is $\sim\,$0.165$\,$%, which demonstrates our design will be robust against these high-energy events.

astro-ph.IM↗

arXiv2022

Graph Neural Networks for Charged Particle Tracking on FPGAs

The determination of charged particle trajectories in collisions at the CERN Large Hadron Collider (LHC) is an important but challenging problem, especially in the high interaction density conditions expected during the future high-luminosity phase of the LHC (HL-LHC). Graph neural networks (GNNs) are a type of geometric deep learning algorithm that has successfully been applied to this task by embedding tracker data as a graph -- nodes represent hits, while edges represent possible track segments -- and classifying the edges as true or fake track segments. However, their study in hardware- or software-based trigger applications has been limited due to their large computational cost. In this paper, we introduce an automated translation workflow, integrated into a broader tool called $\texttt{hls4ml}$, for converting GNNs into firmware for field-programmable gate arrays (FPGAs). We use this translation tool to implement GNNs for charged particle tracking, trained using the TrackML challenge dataset, on FPGAs with designs targeting different graph sizes, task complexites, and latency/throughput requirements. This work could enable the inclusion of charged particle tracking GNNs at the trigger level for HL-LHC experiments.

physics.ins-det↗

arXiv2021

Charged particle tracking via edge-classifying interaction networks

Recent work has demonstrated that geometric deep learning methods such as graph neural networks (GNNs) are well suited to address a variety of reconstruction problems in high energy particle physics. In particular, particle tracking data is naturally represented as a graph by identifying silicon tracker hits as nodes and particle trajectories as edges; given a set of hypothesized edges, edge-classifying GNNs identify those corresponding to real particle trajectories. In this work, we adapt the physics-motivated interaction network (IN) GNN toward the problem of particle tracking in pileup conditions similar to those expected at the high-luminosity Large Hadron Collider. Assuming idealized hit filtering at various particle momenta thresholds, we demonstrate the IN's excellent edge-classification accuracy and tracking efficiency through a suite of measurements at each stage of GNN-based tracking: graph construction, edge classification, and track building. The proposed IN architecture is substantially smaller than previously studied GNN tracking architectures; this is particularly promising as a reduction in size is critical for enabling GNN-based tracking in constrained computing environments. Furthermore, the IN may be represented as either a set of explicit matrix operations or a message passing GNN. Efforts are underway to accelerate each representation via heterogeneous computing resources towards both high-level and low-latency triggering applications.

hep-ex↗

arXiv2020

Accelerated Charged Particle Tracking with Graph Neural Networks on FPGAs

We develop and study FPGA implementations of algorithms for charged particle tracking based on graph neural networks. The two complementary FPGA designs are based on OpenCL, a framework for writing programs that execute across heterogeneous platforms, and hls4ml, a high-level-synthesis-based compiler for neural network to firmware conversion. We evaluate and compare the resource usage, latency, and tracking performance of our implementations based on a benchmark dataset. We find a considerable speedup over CPU-based execution is possible, potentially enabling such algorithms to be used effectively in future computing workflows and the FPGA-based Level-1 trigger at the CERN Large Hadron Collider.

physics.ins-det↗