Issue |
A&A
Volume 679, November 2023
|
|
---|---|---|
Article Number | A20 | |
Number of page(s) | 10 | |
Section | Numerical methods and codes | |
DOI | https://doi.org/10.1051/0004-6361/202347356 | |
Published online | 01 November 2023 |
PulsarX: A new pulsar searching package
I. A high performance folding program for pulsar surveys
1
Max-Planck-Institut für Radioastronomie,
Auf dem Hügel 69,
53121
Bonn, Germany
e-mail: ypmen@mpifr-bonn.mpg.de
2
Max Planck Institute for Gravitational Physics (Albert Einstein Institute),
Callinstraße 38,
30167
Hannover, Germany
3
Leibniz Universität Hannover,
Welfengarten 1,
30167
Hannover, Germany
4
Jodrell Bank Centre for Astrophysics, Department of Physics and Astronomy, The University of Manchester,
Manchester
M13 9PL, UK
Received:
4
July
2023
Accepted:
5
September
2023
Context. Pulsar surveys with modern radio telescopes are becoming increasingly computationally demanding. This is particularly true for wide field-of-view pulsar surveys with radio interferometers and those conducted in real or quasi-real time. These demands result in data analysis bottlenecks that can limit the parameter space covered by the surveys and diminish their scientific return.
Aims. In this paper we address the computational challenge of ‘candidate folding’ in pulsar searching, presenting a novel, efficient approach designed to optimise the simultaneous folding of large numbers of pulsar candidates. We provide a complete folding pipeline appropriate for large-scale pulsar surveys that includes radio frequency interference mitigation, de-dispersion, folding, and parameter optimisation.
Methods. By leveraging the fast discrete dispersion measure transform (FDMT) algorithm, we have developed an optimised and cache-friendly implementation that we term the pruned FDMT (pFDMT). This implementation is specifically designed for candidate folding scenarios where the candidates are broadly distributed in dispersion measure space. The pFDMT approach efficiently reuses intermediate processing results and prunes the unused computation paths, resulting in a significant reduction in arithmetic operations. In addition, we propose a novel folding algorithm based on the Tikhonov-regularised least squares method that can improve the time resolution of the pulsar profile.
Results. We present the performance of its real-world application as an integral part of two major pulsar search projects conducted with the MeerKAT telescope: the MPIfR-MeerKAT Galactic Plane Survey (MMGPS) and the Transients and Pulsars with MeerKAT (TRAPUM) project. In our processing of approximately 500 candidates, the theoretical number of de-dispersion operations can be reduced by a factor of around 50 when compared to brute-force de-dispersion, which scales with the number of candidates.
Key words: methods: data analysis / pulsars: general
© The Authors 2023
Open Access article, published by EDP Sciences, under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
This article is published in open access under the Subscribe to Open model.
Open Access funding provided by Max Planck Society.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.