✦ LIBER ✦

A fast readout algorithm for Cluster Counting/Timing drift chambers on a FPGA board

✍ Scribed by Cappelli, L.; Creti, P.; Grancagnolo, F.; Pepino, A.; Tassielli, G.

Book ID: 122083433
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 640 KB
Volume: 718
Category: Article
ISSN: 0168-9002
DOI: 10.1016/j.nima.2012.10.087

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast cluster counting algorithm for pe

A fast cluster counting algorithm for percolation on and off lattices

✍ E. Stoll 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 343 KB

A fast counting algorithm is used to enumerate the clusters for determining their statistics, for investigation the percolation behavior of the largest cluster and for calculating the fractai dimensions D. The algorithm is suitable for parallel processing. It can be expanded for off-lattice systems,

A fast general-purpose clustering algori

A fast general-purpose clustering algorithm based on FPGAs for high-throughput data processing

✍ A. Annovi; M. Beretta 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 306 KB

We present a fast general-purpose algorithm for high-throughput clustering of data ''with a twodimensional organization''. The algorithm is designed to be implemented with FPGAs or custom electronics. The key feature is a processing time that scales linearly with the amount of data to be processed.