Cargando…

A Highly Parallel FPGA Implementation of a 2D-Clustering Algorithm for the ATLAS Fast TracKer (FTK) Processor

The highly parallel 2D-clustering FPGA implementation used for the input system of the ATLAS Fast TracKer (FTK) processor is presented. The input system for the FTK processor will receive data from the Pixel and micro-strip detectors read out drivers (RODs) at 760Gbps, the full rate of level 1 trigg...

Descripción completa

Detalles Bibliográficos
Autores principales: Kimura, N, Annovi, A, Beretta, M, Gatta, M, Gkaitatzis, S, Iizawa, T, Kordas, K, Korikawa, T, Nikolaidis, N, Petridou, P, Sotiropoulou, C-L, Yorita, K, Volpi, G
Lenguaje:eng
Publicado: 2014
Materias:
Acceso en línea:http://cds.cern.ch/record/1703036
_version_ 1780936350104551424
author Kimura, N
Annovi, A
Beretta, M
Gatta, M
Gkaitatzis, S
Iizawa, T
Kordas, K
Korikawa, T
Nikolaidis, N
Petridou, P
Sotiropoulou, C-L
Yorita, K
Volpi, G
author_facet Kimura, N
Annovi, A
Beretta, M
Gatta, M
Gkaitatzis, S
Iizawa, T
Kordas, K
Korikawa, T
Nikolaidis, N
Petridou, P
Sotiropoulou, C-L
Yorita, K
Volpi, G
author_sort Kimura, N
collection CERN
description The highly parallel 2D-clustering FPGA implementation used for the input system of the ATLAS Fast TracKer (FTK) processor is presented. The input system for the FTK processor will receive data from the Pixel and micro-strip detectors read out drivers (RODs) at 760Gbps, the full rate of level 1 triggers. Clustering serves two purposes. The first is to reduce the high rate of the received data before further processing. The second is to determine the cluster centroid to obtain the best spatial measurement. For the pixel detectors the clustering is implemented by using a 2D-clustering algorithm that takes advantage of a moving window technique to minimize the logic required for cluster identification. The implementation is fully generic, therefore the detection window size can be optimized for the cluster identification process. Additionally, the implementation can be parallelized by instantiating multiple cores to identify different clusters independently thus exploiting more FPGA resources. This flexibility makes the implementation suitable for a variety of demanding image processing applications. The implementation is robust against bit errors in the input data stream, drops all data that cannot be identified, but also reintroduces missing control words when necessary. The 2D-clustering implementation is developed and tested in both single flow and parallel versions. The first parallel version with 16 parallel cluster identification engines is presented. The input data from the RODs are received through S-Links and the processing units that follow the clustering implementation also require a single data stream, therefore data parallelizing and serializing modules are introduced in order to accommodate the parallelized version and restore the data stream afterwards. We show results of the first hardware tests of the single flow implementation on the custom FTK input mezzanine (IM) board. We report on the integration of 16 parallel engines in the same FPGA and the resulting performances. The parallel 2D-clustering implementation has sufficient processing power to meet the specification for the Pixel layers of ATLAS, for up to 80 overl
id cern-1703036
institution Organización Europea para la Investigación Nuclear
language eng
publishDate 2014
record_format invenio
spelling cern-17030362019-09-30T06:29:59Zhttp://cds.cern.ch/record/1703036engKimura, NAnnovi, ABeretta, MGatta, MGkaitatzis, SIizawa, TKordas, KKorikawa, TNikolaidis, NPetridou, PSotiropoulou, C-LYorita, KVolpi, GA Highly Parallel FPGA Implementation of a 2D-Clustering Algorithm for the ATLAS Fast TracKer (FTK) ProcessorParticle Physics - ExperimentThe highly parallel 2D-clustering FPGA implementation used for the input system of the ATLAS Fast TracKer (FTK) processor is presented. The input system for the FTK processor will receive data from the Pixel and micro-strip detectors read out drivers (RODs) at 760Gbps, the full rate of level 1 triggers. Clustering serves two purposes. The first is to reduce the high rate of the received data before further processing. The second is to determine the cluster centroid to obtain the best spatial measurement. For the pixel detectors the clustering is implemented by using a 2D-clustering algorithm that takes advantage of a moving window technique to minimize the logic required for cluster identification. The implementation is fully generic, therefore the detection window size can be optimized for the cluster identification process. Additionally, the implementation can be parallelized by instantiating multiple cores to identify different clusters independently thus exploiting more FPGA resources. This flexibility makes the implementation suitable for a variety of demanding image processing applications. The implementation is robust against bit errors in the input data stream, drops all data that cannot be identified, but also reintroduces missing control words when necessary. The 2D-clustering implementation is developed and tested in both single flow and parallel versions. The first parallel version with 16 parallel cluster identification engines is presented. The input data from the RODs are received through S-Links and the processing units that follow the clustering implementation also require a single data stream, therefore data parallelizing and serializing modules are introduced in order to accommodate the parallelized version and restore the data stream afterwards. We show results of the first hardware tests of the single flow implementation on the custom FTK input mezzanine (IM) board. We report on the integration of 16 parallel engines in the same FPGA and the resulting performances. The parallel 2D-clustering implementation has sufficient processing power to meet the specification for the Pixel layers of ATLAS, for up to 80 overlATL-DAQ-SLIDE-2014-223oai:cds.cern.ch:17030362014-05-20
spellingShingle Particle Physics - Experiment
Kimura, N
Annovi, A
Beretta, M
Gatta, M
Gkaitatzis, S
Iizawa, T
Kordas, K
Korikawa, T
Nikolaidis, N
Petridou, P
Sotiropoulou, C-L
Yorita, K
Volpi, G
A Highly Parallel FPGA Implementation of a 2D-Clustering Algorithm for the ATLAS Fast TracKer (FTK) Processor
title A Highly Parallel FPGA Implementation of a 2D-Clustering Algorithm for the ATLAS Fast TracKer (FTK) Processor
title_full A Highly Parallel FPGA Implementation of a 2D-Clustering Algorithm for the ATLAS Fast TracKer (FTK) Processor
title_fullStr A Highly Parallel FPGA Implementation of a 2D-Clustering Algorithm for the ATLAS Fast TracKer (FTK) Processor
title_full_unstemmed A Highly Parallel FPGA Implementation of a 2D-Clustering Algorithm for the ATLAS Fast TracKer (FTK) Processor
title_short A Highly Parallel FPGA Implementation of a 2D-Clustering Algorithm for the ATLAS Fast TracKer (FTK) Processor
title_sort highly parallel fpga implementation of a 2d-clustering algorithm for the atlas fast tracker (ftk) processor
topic Particle Physics - Experiment
url http://cds.cern.ch/record/1703036
work_keys_str_mv AT kimuran ahighlyparallelfpgaimplementationofa2dclusteringalgorithmfortheatlasfasttrackerftkprocessor
AT annovia ahighlyparallelfpgaimplementationofa2dclusteringalgorithmfortheatlasfasttrackerftkprocessor
AT berettam ahighlyparallelfpgaimplementationofa2dclusteringalgorithmfortheatlasfasttrackerftkprocessor
AT gattam ahighlyparallelfpgaimplementationofa2dclusteringalgorithmfortheatlasfasttrackerftkprocessor
AT gkaitatziss ahighlyparallelfpgaimplementationofa2dclusteringalgorithmfortheatlasfasttrackerftkprocessor
AT iizawat ahighlyparallelfpgaimplementationofa2dclusteringalgorithmfortheatlasfasttrackerftkprocessor
AT kordask ahighlyparallelfpgaimplementationofa2dclusteringalgorithmfortheatlasfasttrackerftkprocessor
AT korikawat ahighlyparallelfpgaimplementationofa2dclusteringalgorithmfortheatlasfasttrackerftkprocessor
AT nikolaidisn ahighlyparallelfpgaimplementationofa2dclusteringalgorithmfortheatlasfasttrackerftkprocessor
AT petridoup ahighlyparallelfpgaimplementationofa2dclusteringalgorithmfortheatlasfasttrackerftkprocessor
AT sotiropouloucl ahighlyparallelfpgaimplementationofa2dclusteringalgorithmfortheatlasfasttrackerftkprocessor
AT yoritak ahighlyparallelfpgaimplementationofa2dclusteringalgorithmfortheatlasfasttrackerftkprocessor
AT volpig ahighlyparallelfpgaimplementationofa2dclusteringalgorithmfortheatlasfasttrackerftkprocessor
AT kimuran highlyparallelfpgaimplementationofa2dclusteringalgorithmfortheatlasfasttrackerftkprocessor
AT annovia highlyparallelfpgaimplementationofa2dclusteringalgorithmfortheatlasfasttrackerftkprocessor
AT berettam highlyparallelfpgaimplementationofa2dclusteringalgorithmfortheatlasfasttrackerftkprocessor
AT gattam highlyparallelfpgaimplementationofa2dclusteringalgorithmfortheatlasfasttrackerftkprocessor
AT gkaitatziss highlyparallelfpgaimplementationofa2dclusteringalgorithmfortheatlasfasttrackerftkprocessor
AT iizawat highlyparallelfpgaimplementationofa2dclusteringalgorithmfortheatlasfasttrackerftkprocessor
AT kordask highlyparallelfpgaimplementationofa2dclusteringalgorithmfortheatlasfasttrackerftkprocessor
AT korikawat highlyparallelfpgaimplementationofa2dclusteringalgorithmfortheatlasfasttrackerftkprocessor
AT nikolaidisn highlyparallelfpgaimplementationofa2dclusteringalgorithmfortheatlasfasttrackerftkprocessor
AT petridoup highlyparallelfpgaimplementationofa2dclusteringalgorithmfortheatlasfasttrackerftkprocessor
AT sotiropouloucl highlyparallelfpgaimplementationofa2dclusteringalgorithmfortheatlasfasttrackerftkprocessor
AT yoritak highlyparallelfpgaimplementationofa2dclusteringalgorithmfortheatlasfasttrackerftkprocessor
AT volpig highlyparallelfpgaimplementationofa2dclusteringalgorithmfortheatlasfasttrackerftkprocessor