Hostname: page-component-8448b6f56d-c47g7 Total loading time: 0 Render date: 2024-04-24T15:06:09.560Z Has data issue: false hasContentIssue false

The implementation of a Fast-Folding Algorithm in the PALFA survey

Published online by Cambridge University Press:  04 June 2018

E. Parent
Affiliation:
Dept. of Physics and McGill Space Institute, McGill Univ., Montreal, QC H3A 2T8, Canada
V. M. Kaspi
Affiliation:
Dept. of Physics and McGill Space Institute, McGill Univ., Montreal, QC H3A 2T8, Canada
S. M. Ransom
Affiliation:
National Radio Astronomy Observatory, Charlottesville, VA 22903, USA
C. Patel
Affiliation:
Dept. of Physics and McGill Space Institute, McGill Univ., Montreal, QC H3A 2T8, Canada
M. Krasteva
Affiliation:
Dept. of Physics, Concordia Univ., Montreal, H4B 1R6, Canada
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The PALFA survey, the most sensitive blind search for radio pulsars, has now discovered 180 pulsars in the Galactic Plane, the vast of which have periods shorter than 2 seconds. One reason that pulsar surveys may miss long-period radio pulsars is the strong effect of red noise at low modulation frequencies. It is possible to address this reduction in sensitivity by using a Fast-Folding Algorithm (FFA). We have adapted this algorithm for radio pulsar searching and applied it to PALFA observations. A sensitivity analysis of the algorithm has been conducted using synthetic pulsar signals injected in real observational data and this study shows that the FFA improves the PALFA survey sensitivity, as reported in Lazarus et al.(2015), by at least a factor of two at periods of ~6 sec, implying that the PALFA survey should discover more long-period radio pulsars in the future.

Type
Contributed Papers
Copyright
Copyright © International Astronomical Union 2018 

References

Lazarus, P. and Brazier, A. and Hessels, J. W. T. et al. 2015, ApJ, 812, 81CrossRefGoogle Scholar
Dewey, R. J., Taylor, J. H., Weisberg, J. M., & Stokes, G. H., 1995, Ap. Lett., 294, L25Google Scholar
Staelin, D. H., 1969, IEEE Proceedings, 57, 724CrossRefGoogle Scholar
Petigura, E. A., Marcy, G. W., & Howard, A. W. 2013, ApJ, 770, 69Google Scholar