TL;DR
This paper presents a GPU-accelerated implementation of the Fourier Domain Acceleration Search algorithm for pulsar detection, significantly improving processing speed for real-time analysis in radio astronomy.
Contribution
The authors develop and compare GPU-based implementations of FDAS, including a custom FFT shared memory approach, achieving substantial speedups over existing methods.
Findings
Shared memory FFT is 1.5 to 3.2 times faster than cuFFT for small filters.
GPU implementation is 4 to 6 times faster than previous GPU and OpenMP versions.
The work enables real-time pulsar acceleration searches for large radio astronomy datasets.
Abstract
The study of binary pulsars enables tests of general relativity. Orbital motion in binary systems causes the apparent pulsar spin frequency to drift, reducing the sensitivity of periodicity searches. Acceleration searches are methods that account for the effect of orbital acceleration. Existing methods are currently computationally expensive, and the vast amount of data that will be produced by next generation instruments such as the Square Kilometre Array (SKA) necessitates real-time acceleration searches, which in turn requires the use of High Performance Computing (HPC) platforms. We present our implementation of the Correlation Technique for the Fourier Domain Acceleration Search (FDAS) algorithm on Graphics Processor Units (GPUs). The correlation technique is applied as a convolution with multiple Finite Impulse Response filters in the Fourier domain. Two approaches are compared:…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
