Pileup recovery algorithms for digital gamma ray spectroscopy

, and

Published 21 September 2012 Published under licence by IOP Publishing Ltd
, , Citation I I Mahmoud et al 2012 JINST 7 P09013 DOI 10.1088/1748-0221/7/09/P09013

1748-0221/7/09/P09013

Abstract

This paper presents algorithms for overcoming a common problem of gamma ray spectroscopy, namely the peak pileup recovery problem. Three different approaches are studied and evaluated within a spectroscopy system. The algorithms are evaluated by the means of parameters error and fitting error calculations. The first approach is a direct search based on Nelder-Mead technique without any derivatives in order to find the local minimum points. A Gaussian shape in conjunction with the peak height and its position of each pulse are used to construct the pulse. So, the main pulse parameters such as peak amplitude, position and width can be determined. The second algorithm is based on the nonlinear least square method. In this paper another technique is tried. This technique which is proposed as third algorithm is based on a maximum peak search method combined with the first derivative method to determine peak position of each pulse. Comparison among these approaches is conducted in terms of parameters errors. The pulse parameters have been calculated and compared with the actual one. The second approach shows the best accuracy, for determining peak height and position, but the width parameter scored the highest error.

Export citation and abstract BibTeX RIS

10.1088/1748-0221/7/09/P09013