http://arxiv.org/abs/2206.00427
Searching for periodic non-accelerated signals in presence of ideal white noise using the fully phase-coherent Fast Folding Algorithm (FFA) is theoretically established as a more sensitive search method than the Fast Fourier Transform (FFT) search with incoherent harmonic summing. In this paper, we present a comparison of the performance of an FFA search implementation using RIPTIDE and an FFT search implementation using PRESTO, over a range of signal parameters with white noise and with real telescope noise from the GHRSS survey with the uGMRT. We find that FFA search with appropriate de-reddening of time series, performs better than FFT search with spectral whitening for long period pulsars in real GHRSS noise conditions. We describe an FFA search pipeline implemented for the GHRSS survey looking for pulsars over a period range of 0.1 s to 100 s and up to dispersion measure of 500 pc cm$^{-3}$. We processed GHRSS survey data covering $\sim$ 1500 degree$^2$ of the sky with this pipeline. We re-detected 43 known pulsars with better signal-to-noise in the FFA search than in the FFT search. We also report discovery of two new pulsars including a long period pulsar having a short duty-cycle with this FFA search pipeline. The population of long period pulsars with periods of several seconds or higher can help to constrain the pulsar death-line.
S. Singh, J. Roy, U. Panda, et. al.
Thu, 2 Jun 22
21/57
Comments: 20 pages, 11 figures, 1 table, Under review in The Astrophysical Journal
You must be logged in to post a comment.