Track fitting at the full LHC collision rate

summary

The gist

The LHCb experiment at the Large Hadron Collider underwent a major upgrade before the LHC Run 3 data taking period…

In short

The LHCb experiment upgraded its trigger system using a fast, parameterized Kalman filter for real-time track fitting at 30 MHz collision frequency. This new method replaces slow lookups and numerical integration with analytical parameterizations, significantly boosting momentum resolution by a factor of two for D0 and J/psi hadrons. It also improves background rejection and enhances robustness against detector misalignment.

Key concepts

Kalman Filter
A mathematical tool used to estimate the state of a system by combining predictions with actual measurements. In this context, it is adapted to track charged particles through magnetic fields, helping determine their precise trajectories in real-time.
Parameterised Kalman Filter
A simplified version of the Kalman filter tailored for high-energy physics. It uses pre-calculated functions instead of complex numerical solving and magnetic field map lookups, allowing it to run very fast on hardware while maintaining the core mathematical benefits of filtering.
Momentum Resolution
This refers to how accurately the experiment can measure the speed (momentum) of a particle. The new filter provides a significant improvement, meaning the reconstructed mass peaks for particles like D0 and J/psi are much narrower and sharper than before.
Real-Time Trigger (HLT1)
This is the first stage of data processing that decides which events are important enough to keep. The new algorithm allows for full track fitting at the very high collision rate of 30 MHz, enabling better event selection before data is stored.

Terminology used across episodes

This episode discusses

The paper

Track fitting at the full LHC collision rate · Read on arXiv

Laboratoire de Physique Nucléaire et de Hautes Energies (LPNHE) · Department of Physics, Indiana University · Department of Physics & Astronomy, University of Manchester · Physikalisches Institut, Ruprecht-Karls-Universität Heidelberg

The LHCb experiment at the Large Hadron Collider underwent a major upgrade before the LHC Run 3 data-taking period, employing an all-software approach in its trigger system. Here we present a fast implementation of a Kalman filter, used in the first trigger stage since the 2025 data-taking period, allowing to determine parameter estimates of charged-particle trajectories at the full LHCb collision frequency of 30 MHz. This approach replaces computationally expensive magnetic field map lookups and numerical integration methods with fast analytical parameterisations while maintaining the mathematical framework of Kalman filtering. Implemented on approximately 500 GPUs within the first-level trigger, the algorithm has replaced the previous partial track fitting algorithm in the real-time trigger environment at the cost of a 2% increase in processing time. Compared to the previous fitter this parameterised Kalman filter shows a significantly improved momentum resolution, resulting in a factor of two improvement in the invariant mass resolutions for reconstructed D0 and J/ψ hadrons. It additionally demonstrates greater robustness against detector misalignment effects and substantially sharpens the discrimination between genuine particle trajectories and accidental background, more than doubling the rejection of the latter at no cost to genuine-track efficiency, for a standard selection working point.

DOI: 10.1140/epjc/s10052-026-16478-2

Transcript

Introduction to the show: ident: High Energy Physics: Experiment. The day in high-energy experiment: detectors, searches and limits.

Kai: We're looking at the paper: "Track fitting at the full LHC collision rate".

Mira: Here's the gist of the paper. The LHCb experiment at the Large Hadron Collider underwent a major upgrade before the LHC Run 3 data taking period, employing an all-software approach in its trigger system Here we present a fast implementation of a Kalman filter, used in the first trigger stage since the 2025 data taking period, allowing to determine parameter estimates of charged-particle trajectories at the full LHCb collision frequency of 30 MHz This approach replaces computationally expensive magnetic field map lookups and numerical integration methods with fast analytical parameterisations while maintaining the mathematical framework of Kalman filtering Compared to the previous fitter this parameterised Kalman filter shows a significantly improved momentum resolution, resulting in a factor of two improvement in the invariant mass resolutions for reconstructed D0 and J/ψ hadrons It additionally demonstrates greater robustness against detector misalignment effects and substantially sharpens the discrimination between genuine particle trajectories and accidental background, more than doubling the rejection of the latter at no cost to genuine-track efficiency, for a standard selection working point.

Kai: Algorithm Development The core of this work is a fast implementation of a Kalman filter used in the first trigger stage since the 2025 data taking period This algorithm replaces the previous partial track fitting algorithm in the real-time trigger environment at the cost of a 2% increase in processing time.

Mira: The Parameterised Kalman Filter is a Kalman filter as defined in the previous section, but uses simplifications specific to typical implementations in a high-energy physics context which allows it to be executed with minimal time consumption.

Kai: It was developed as a drop-in replacement for the previous track fitting algorithm, the VELO Only Kalman Filter, to provide better momentum (and therefore mass) resolution, more robustness against detector misalignments, and improved rejection against fake tracks (so-called ghosts) in the HLT1 stage of LHCb.

Title and authors: Kai: So we're looking at this paper, "Track fitting at the full LHC collision rate," and it’s about how they rebuilt the first trigger stage for LHCb using a Kalman filter. It seems like they’re moving away from older methods that were too slow for what the detector can actually produce now.

Mira: That's right, Kai, it touches on making sure we can actually keep up with data taking at the full LHC collision frequency of thirty MHz <ref:2607.14793#pg1,at the full LHC collision>. It’s about this fast implementation of a Kalman filter they use to estimate particle paths.

Lev: From an engineering standpoint, replacing the magnetic field map lookups and numerical integration with analytical parameterizations is smart because it needs to run in real time. If you have to solve equations every time a collision happens, that overhead kills your trigger rate.

Kai: Exactly, and the paper says this new approach allows them to determine parameter estimates of charged particle trajectories at that full thirty MHz frequency without slowing down the trigger system by much more than a two percent increase in processing time <ref:2607.14793#pg1,to determine parameter estimates of charged particle trajectories at>.

Mira: But what’s really interesting is how they use this Kalman filter not just for speed, but for something else—improving the quality of the measurements they get from those tracks.

Lev: The paper implies that this isn't just about fitting tracks faster; it’s about getting better momentum resolution because they are incorporating information from all three tracking detectors: the VELO, the UT, and SciFi.

Kai: So, when you look at the results section of this paper, they show a factor of two improvement in the invariant mass resolutions for reconstructed D zero and J psi hadrons compared to what they got with their previous fitter.

Mira: That is a big deal because those mass resolutions directly tell us how well we can measure the properties of the heavy particles we’re looking for, like those mesons.

Lev: And it also speaks to robustness; they found that this parameterised Kalman filter shows greater robustness against detector misalignment effects, which is something that often degrades momentum estimates when you rely only on pattern recognition.

Kai: So, if the magnetic field map shifts slightly in the detector geometry, their estimates for particle momentum don't fall apart as much as they used to. It makes the reconstruction more stable across different conditions.

Mira: And they also mentioned substantially sharpening the discrimination between genuine particle trajectories and accidental background events in that first trigger stage, which means they are rejecting fake tracks much better than before.

Lev: The paper quantifies this rejection improvement by saying it doubles the rejection of those accidental background events at a standard selection working point, and this happens without sacrificing genuine track efficiency.

Title and authors: Kai: That’s a crucial detail for me because efficiency is always a trade-off in these kinds of systems, so having that improvement happen while keeping the real track acceptance high is important.

Mira: It really shows that you can gain better rejection and better resolution simultaneously just by changing how you model the particle movement.

Lev: And they did this by choosing a simple function to parameterize the extrapolation instead of solving the full equations of motion numerically, which is what made it fast enough for real-time hardware.

Kai: So, in short, they took a complex mathematical framework and simplified the physics assumptions just enough to make it work reliably at the full collision rate with good performance gains.

Mira: It points toward this idea that you can achieve offline quality reconstruction right there in the trigger system before you even get to the offline analysis stage.

Lev: And they conclude by saying that this deployment demonstrates a real potential for advanced reconstruction algorithms running on GPUs, which is a step toward getting that high-quality work done at the full collision frequency.

Kai: So we’re looking at this paper, "Track fitting at the full LHC collision rate," which shows how they implemented a fast Kalman filter for track fitting in the first trigger stage since two thousand twenty-five <ref:2607.14793#pg1,Track fitting at the full LHC collision rate>.

Mira: It’s about replacing slow numerical methods with fast analytical parameterizations to get momentum estimates at thirty MHz, leading to a factor of two improvement in mass resolutions for D zero and J psi hadrons <ref:2607.14793#pg1>.

Lev: The key improvements are better momentum resolution, increased robustness against detector misalignment, and substantially sharper discrimination against background events.

Kai: It really shows how much performance can be gained by focusing on parameterizing the extrapolation instead of running heavy numerical integration.

Mira: And the implication for me is that this sets a new benchmark for what we can expect from real-time reconstruction algorithms in high energy physics experiments.

Lev: From my side, it confirms that if you can reduce the computational cost to fit within real-time constraints while maintaining precision, you open up much more possibilities for running complex fits on actual hardware.

Kai: So, to wrap up this discussion on "Track fitting at the full LHC collision rate," we see a fast implementation of a Kalman filter that gets us better momentum resolution and rejection against fake tracks without sacrificing efficiency.

Mira: It’s a solid step toward achieving offline quality reconstruction right in the trigger system, which should boost the statistical precision of future measurements in Run three and beyond <ref:2607.14793#pg1>.

Lev: And for real hardware running, it shows that this level of optimization is achievable, paving the way for even more complex fitting routines on GPUs.

The paper's summary: Kai: So, this paper is about taking track fitting to the full LHC collision rate, which means they’re finally building something that can handle all that data coming in at once.

Mira: It boils down to replacing older tracking methods with a new Kalman filter setup for the first trigger stage since two thousand twenty-five.

Kai: Right, so it’s this fast implementation of a Kalman filter designed to estimate particle paths at thirty mega hertz collision frequency. It’s moving away from partial fitting to full track fitting in real time.

Lev: From my side, that means they’re replacing the old partial fit algorithm entirely. That old thing was limited because it assumed a magnetic field map was perfect and only looked at the VELO segment.

Mira: And this new parameterised version uses the full track information from all three detectors: VELO, UT, and SciFi. They use simple functions to describe how a particle moves between layers instead of solving complex equations every time.

Kai: That’s what they’re doing to keep it fast for the hardware. They replace expensive magnetic field map lookups and numerical integration with these analytical parameterizations while keeping the core Kalman filtering math intact.

Lev: And they claim this change only increases processing time by about two percent, which is pretty good for a real-time trigger system. It shows they managed to keep the overhead low enough for GPU architectures too.

Mira: The main payoff is the momentum resolution. They see a factor of two improvement in the invariant mass resolutions for things like D zero and J psi hadrons compared to what was achieved with the older VELO Only Kalman Filter.

Kai: A factor of two improvement in mass resolution means we can measure those particles much more precisely. That’s significant for how we understand their properties.

Lev: And they also found it’s more robust against detector misalignment effects, which is a big deal because that stuff messes up momentum estimates when you only rely on pattern recognition algorithms.

Mira: Plus, it substantially sharpens the discrimination between real particle trajectories and accidental background events. They doubled the rejection of those fake tracks at a standard selection working point without sacrificing genuine track efficiency.

Kai: So, they’ve got speed, better resolution on mass, and better rejection against noise all in one package for the trigger stage. It’s a lot to fit into that real-time environment.

Lev: The caveat is that this is just for the first trigger stage; they aren't claiming it solves everything offline. They are building a solid foundation for something better down the line, like adding outlier removal or state estimates for particle identification later on.

Mira: It’s a step toward getting an offline-quality reconstruction right there in the trigger system, which is what we’re really aiming for in this kind of high energy physics computing.

Kai: It means more effective event selection at the trigger level, which boosts efficiency and ultimately enhances the statistical precision of LHCb measurements for Run three and beyond.

Lev: So they’ve shown that you can get a lot of performance gain by simplifying the physics model just enough to make it run on hardware efficiently.

Mira: And this sets a benchmark for how we can expect advanced reconstruction algorithms to function at the full collision frequency in experiments like this one.

The paper's improvements: Kai: We’ve looked at how they built this fast Kalman filter for the LHCb trigger, so now we need to talk about what they suggest as improvements to this whole system.

Mira: The paper points out that while the parameterised version is much faster, there are still some areas where they think things could get even better.

Lev: They mention that for a real hardware setup running at the full collision rate, you still need to worry about how those analytical functions handle extreme detector misalignment.

Kai: So they suggest adding a layer of outlier removal right into this process, something that can clean up those noisy estimates before they get used for event selection.

Mira: Right, and they also talk about the need to add state estimates for particle identification using the RICH detectors in the future. That’s a clear roadmap for what comes next after this initial trigger stage is set up.

Lev: From an engineering standpoint, if you want to get closer to that offline quality reconstruction at the full collision frequency, you can't just stop at parameterization; you have to figure out how to integrate those future identification steps into the existing pipeline.

Kai: It sounds like they’re proposing a staged upgrade path then. First, this fast trigger filter gets us running reliably on all three detectors and improving mass resolution significantly.

Mira: And then, in the next iteration of this system, you layer on those more complex physics steps like particle identification to really sharpen the track quality metric.

Lev: The assumption here is that because they’ve mastered the speed and robustness of this Kalman filter implementation now, adding those more complex components won't break the real-time requirements too badly.

Kai: So they’re suggesting that this success opens the door to moving toward a full offline quality reconstruction even at high collision rates, assuming we can manage those future computational demands.

Mira: It really frames this paper as the critical first step in achieving that ultimate goal of getting offline-quality reconstruction done on GPUs.

Lev: The implication for hardware is that this shows the path: get the fast, robust core running now and then tackle the more computationally intensive additions like outlier removal later.

Kai: It’s a clear message to hardware developers that optimizing those analytical parameterizations is a viable way to push reconstruction quality right into the real-time environment.

Conclusion: Tom: So we’re wrapping up this look at the paper, "Track fitting at the full LHC collision rate," which focused on that fast Kalman filter implementation for LHCb data taking.

Kai: To recap, they managed to get a fast track fitting algorithm running at the full collision frequency of thirty mega hertz using analytical parameterizations instead of slow numerical integration.

Mira: And the main result is a factor of two improvement in invariant mass resolutions for D zero and J psi hadrons because they’re using all three detectors.

Lev: I just want to say that even with this speed boost, you still have to deal with the fact that real hardware needs robust methods for detector misalignment.

Kai: True, and the authors did acknowledge that this is a first step; they aren't claiming it solves everything offline yet, but it’s a massive improvement for what’s possible in the trigger system right now.

Mira: Exactly, so we’ve seen how you can use this technique to get better track quality metrics and background rejection without sacrificing efficiency at the working point.

Lev: For me, it shows that if you can keep the overhead low like they did with that two percent increase in processing time, then pushing more complex physics models down into the trigger level becomes much more feasible on actual hardware.

Kai: It sets a clear direction for what we need to build next—that future particle identification step they mentioned is definitely the next big thing after this foundational work.

Mira: We’re seeing a move toward getting offline quality reconstruction right there in the trigger system, which really boosts the statistical precision of LHCb measurements moving into Run three and beyond.

Lev: It confirms that optimizing that analytical parameterization approach is a solid way to push computational limits on real-time systems.

Kai: So this paper, "Track fitting at the full LHC collision rate," shows we can get significant gains in resolution and background rejection by changing how we model particle movement for real-time use.

Mira: It’s a strong demonstration of how theoretical insights about Kalman filtering can be translated into practical hardware performance.

Lev: And it opens up the door for more complex fitting routines to run on real hardware, provided you handle those detector shifts carefully.

Kai: Next week, we’ll be looking at some work on GPU-based kalman filters that take this idea even further and try to push the limits of what's possible in terms of processing power.

More episodes

← Home