SN0238 : The STAR TPC Clusterfinder/Hitfinder
Updated on Mon, 2007-06-18 19:57. Originally created by chajecki on 2007-06-18 19:57.
| Author(s) | : | M.A. Lisa |
| Date | : | Feb. 7, 1996 |
| File(s) | : | sn0238.ps.gz |
| Abstract | : | The current implementation for finding space points in the STAR TPC is described. Data structures and algorithms used to transform TPC pixel information into hits for use by tracking software are explained. Resolution of overlapping hit patterns, spacial uncertainty estimation, and estimates of the track crossing angles by the hitfinder are discussed in detail, particulary the effects of correlated and uncorrelated noise (correlations in time arising from noise filtered by the shaping amplifier) on the position uncertainty. Some minimal algorithm switches are currently implemented, which affect performance and processing speed. The performance of the code, in terms of cpu speed, position resolution, hitfinding efficiency, and number of "ghost" space points produced, is evaluated with slow simulator "data" of Au+Au and p+p events. Finally, a list of work yet to be done on this topic is given.
|
| Keywords | : | |
| Category | : | |
|
