Implementation of a fast algorithm to find data clusters

Author

Xu, Qichun ; Martin, Manuel I.

Author_Institution

Michigan Univ., Ann Arbor, MI, USA

Volume

2

fYear

2001

Firstpage

919

Abstract

In this paper we present a very fast general algorithm to find clusters in a stream of data. The algorithm is implemented in FPGAs (Field Programmable Gate Array) using VHDL language. In its most general form, the algorithm is capable of finding n consecutive elements characterized by some common parameters (a cluster) and reporting the parameters of the cluster such as its location and width within the data stream. This algorithm is used in the Dzero Trigger System to find clusters in the PreShower detector and is capable of finding the clusters within a set of 1280 elements and reporting their width and address in 65 clock ticks.

Keywords

field programmable gate arrays; hardware description languages; muon detection; nuclear electronics; pattern clustering; silicon radiation detectors; solid scintillation detectors; trigger circuits; Dzero Trigger System; FPGAs; Field Programmable Gate Array; PreShower detector; VHDL language; data clusters; very fast general algorithm; Clustering algorithms; Detectors; Event detection; Field programmable gate arrays; Mesons; Microprogramming; Physics; Solenoids; Strips; Telephony;

fLanguage

English

Publisher

ieee

Conference_Titel

Nuclear Science Symposium Conference Record, 2001 IEEE

ISSN

1082-3654

Print_ISBN

0-7803-7324-3

Type

conf

DOI

10.1109/NSSMIC.2001.1009705

Filename

1009705