In the Run-3 of LHCb, the High Level Trigger will have to process events at full LHC collision rate (30 MHz). This is a very challenging goal, and delegating some low-level tasks to FPGA accelerators can be very helpful by saving precious computing time. In particular, the 2D pixel geometry of the new LHCb VELO detector makes the cluster-finding process particularly CPU-time demanding. We realized and tested a highly parallel FPGA-based clustering algorithm, capable of performing this reconstruction in real time at 30 MHz event rate using a modest amount of hardware resources, that can be a viable alternative solution.
Real-time cluster finding for LHCb silicon pixel VELO detector using FPGA
Lazzari, Federico
;Bassi, Giovanni
;Cenci, Riccardo
;Morello, Michael J.
;Punzi, Giovanni
2020
Abstract
In the Run-3 of LHCb, the High Level Trigger will have to process events at full LHC collision rate (30 MHz). This is a very challenging goal, and delegating some low-level tasks to FPGA accelerators can be very helpful by saving precious computing time. In particular, the 2D pixel geometry of the new LHCb VELO detector makes the cluster-finding process particularly CPU-time demanding. We realized and tested a highly parallel FPGA-based clustering algorithm, capable of performing this reconstruction in real time at 30 MHz event rate using a modest amount of hardware resources, that can be a viable alternative solution.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
Lazzari_2020_J._Phys. _Conf._Ser._1525_012044.pdf
accesso aperto
Tipologia:
Published version
Licenza:
Creative Commons
Dimensione
1.21 MB
Formato
Adobe PDF
|
1.21 MB | Adobe PDF |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.