论文标题
最佳周期性搜索:重新访问大型PULSAR调查的快速折叠算法
Optimal periodicity searching: Revisiting the Fast Folding Algorithm for large-scale pulsar surveys
论文作者
论文摘要
快速折叠算法(FFA)是用于周期性信号的相位共指搜索技术。它很少在无线电脉冲星搜索中使用,历史上因较不昂贵的快速傅立叶变换(FFT)而取代了不连贯的谐波总和(IHS)。在这里,我们源于第一原则,即FFA搜索紧密接近对所有周期信号的理论最佳敏感性。分析表明,与标准的FFT+IHS方法相比,它的敏感性要高得多,无论脉搏周期和占空比如何。因此,数十年来,系统的一部分脉冲星空间已经被系统探索了。旨在充分采样PULSAR种群的PULSAR调查应包括FFA搜索作为其数据分析的一部分。我们已经开发了一个FFA软件包,Riptide,足够快,可以大规模处理无线电观察结果。 Riptide已经发现了使用现有的FFT+IHS实现的来源。我们在搜索技术之间的敏感性比较还表明,需要一个更现实的辐射计方程,其中包括一个附加术语:搜索效率。我们得出了FFA和FFT+IHS方法的理论效率,并讨论了排除该术语对PULSAR种群合成研究的影响。
The Fast Folding Algorithm (FFA) is a phase-coherent search technique for periodic signals. It has rarely been used in radio pulsar searches, having been historically supplanted by the less computationally expensive Fast Fourier Transform (FFT) with incoherent harmonic summing (IHS). Here we derive from first principles that an FFA search closely approaches the theoretical optimum sensitivity to all periodic signals; it is analytically shown to be significantly more sensitive than the standard FFT+IHS method, regardless of pulse period and duty cycle. A portion of the pulsar phase space has thus been systematically under-explored for decades; pulsar surveys aiming to fully sample the pulsar population should include an FFA search as part of their data analysis. We have developed an FFA software package, riptide, fast enough to process radio observations on a large scale; riptide has already discovered sources undetectable using existing FFT+IHS implementations. Our sensitivity comparison between search techniques also shows that a more realistic radiometer equation is needed, which includes an additional term: the search efficiency. We derive the theoretical efficiencies of both the FFA and the FFT+IHS methods and discuss how excluding this term has consequences for pulsar population synthesis studies.