Development of Clustering Algorithm for Pixel Detectors for FPGA

Modern pixel particle detectors allow possibility to determine coordinates of hit with high accuracy. Some of them, for example Medipix series detectors, provide possibilities to evaluate particle energy deposit. However, pixel detectors have a difficult problem of a dividing of the charge, appeared by interaction with hitting particle, into neighbor pixels. To compensate this effect the clustering procedure is used. The clustering procedure is the process of union of neighbor non-zero pixels. A cluster is a group of pixels with common borders. Sum of energy deposit in pixels of a cluster provide estimation of particle energy with higher accuracy. The clustering procedure usually operates with ready data saved on a computer what required a long time and big amount of memory. Here the clustering algorithm for FPGA to include in DAQ systems of pixel detectors is presented. The including clustering procedure in DAQ reduces amount of memory and time required for data processing.

Authors

Institutions

Publication Details

Journal
Physics of Particles and Nuclei Letters
Published
2024-08-01
DOI
https://doi.org/10.1134/s1547477124701140
Primary Topic
Particle Detector Development and Performance
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Development of Clustering Algorithm for Pixel Detectors for FPGA

Hoang-Minh Truong, V. V. Makarova, R. Sotenskii, A. V. Lapkin et al.
Physics of Particles and Nuclei Letters
Particle Detector Development and Performance
article

Development of Clustering Algorithm for Pixel Detectors for FPGA

Hoang-Minh Truong, V. V. Makarova, R. Sotenskii, A. V. Lapkin, G. Lavrov
article en

Abstract

Modern pixel particle detectors allow possibility to determine coordinates of hit with high accuracy. Some of them, for example Medipix series detectors, provide possibilities to evaluate particle energy deposit. However, pixel detectors have a difficult problem of a dividing of the charge, appeared by interaction with hitting particle, into neighbor pixels. To compensate this effect the clustering procedure is used. The clustering procedure is the process of union of neighbor non-zero pixels. A cluster is a group of pixels with common borders. Sum of energy deposit in pixels of a cluster provide estimation of particle energy with higher accuracy. The clustering procedure usually operates with ready data saved on a computer what required a long time and big amount of memory. Here the clustering algorithm for FPGA to include in DAQ systems of pixel detectors is presented. The including clustering procedure in DAQ reduces amount of memory and time required for data processing.

Physics of Particles and Nuclei LettersVol. 21(4)
Joint Institute for Nuclear Research (RU), Vietnam Academy of Science and Technology (VN)
Openalex Percentile: Top 96%
Particle Detector Development and Performance
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Development of Clustering Algorithm for Pixel Detectors for FPGA — Hoang-Minh Truong, V. V. Makarova, et al. · Physics of Particles and Nuclei Letters (2024) | TGRS Research Map | TGRS