The implementation of a Fast-Folding pipeline for long-period pulsar searching in the PALFA survey
E. Parent, V. M. Kaspi, S. M. Ransom, M. Krasteva, C. Patel, P., Scholz, A. Brazier, M. A. McLaughlin, M. Boyce, W. W. Zhu, Z. Pleunis, B., Allen, S. Bogdanov, K. Caballero, F. Camilo, R. Camuccio, S. Chatterjee, J., M. Cordes, F. Crawford, J. S. Deneva, R. Ferdman

TL;DR
This paper introduces a Fast-Folding Algorithm (FFA) pipeline for the PALFA survey, significantly improving sensitivity to long-period pulsars by outperforming traditional FFT methods, especially for periods over 6 seconds.
Contribution
The paper develops and tests a new FFA-based search pipeline integrated into PALFA, enhancing detection of long-period pulsars beyond existing Fourier-based methods.
Findings
FFA outperforms FFT in ideal and real data scenarios.
Sensitivity improves by at least a factor of two for periods >6 seconds.
New pulsar discoveries demonstrate the pipeline's effectiveness.
Abstract
The Pulsar Arecibo L-Band Feed Array (PALFA) survey, the most sensitive blind search for radio pulsars yet conducted, is ongoing at the Arecibo Observatory in Puerto Rico. The vast majority of the 180 pulsars discovered by PALFA have spin periods shorter than 2 seconds. Pulsar surveys may miss long-period radio pulsars due to the summing of a finite number of harmonic components in conventional Fourier analyses (typically 16), or due to the strong effect of red noise at low modulation frequencies. We address this reduction in sensitivity by using a time-domain search technique: the Fast-Folding Algorithm (FFA). We designed a program that implements a FFA-based search in the PALFA processing pipeline, and tested the efficiency of the algorithm by performing tests under both ideal, white noise conditions, as well as with real PALFA observational data. In the two scenarios, we show…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
