We present an improvement of our implementation of the Correlation Technique for the Fourier Domain Acceleration Search (FDAS) algorithm on Graphics Processor Units (GPUs) (Dimoudi and Armour 2015; Dimoudi et al. 2017). Our new improved convolution code which uses our custom GPU FFT code is between 2.5 and 3.9 times faster the than our cuFFT-based implementation (on an NVIDIA P100) and allows for a wider range of filter sizes then our previous version. By using this new version of our convolution code in FDAS we have achieved 44% performance increase over our previous best implementation. It is also approximately 8 times faster than the existing PRESTO GPU implementation of FDAS (Luo 2013). This work is part of the AstroAccelerate project (...
When creating electronic devices, it is essential to model what happens when an electromagnetic fiel...
Time-domain radio astronomy utilizes a harmonic sum algorithm as part of the Fourier domain periodic...
We present an implementation of the overlap-and-save method, a method for the convolution of very lo...
We present an improvement of our implementation of the Correlation Technique for the Fourier Domain ...
The study of binary pulsars enables tests of general relativity. Orbital motion in binary systems ca...
Pulsar acceleration searches are methods for recovering signals from radio telescopes, that may othe...
Binary pulsars are an important target for radio surveys because they present a natural laboratory f...
In this paper, we present a comparison study about implementatons of phase correlation function usin...
International audienceWe are interested in the intensive use of Factorial Correspondence Analysis (F...
The fast Fourier transform (FFT) plays an important role in digital signal processing (DSP)...
The $\mathcal{F}$-statistic is a detection statistic used widely in searches for continuous gravitat...
Fourier methods have revolutionized many fields of science and engineering, such as astronomy, medic...
Using the Fourier Domain Acceleration Search (FDAS) method to search for binary pulsars is a computa...
One-dimensional incoherent harmonic summing is a technique used to improve the sensitivity of Fourie...
We introduce a new approach to get faster MRI acquisition. By reducing the number of data-samples in...
When creating electronic devices, it is essential to model what happens when an electromagnetic fiel...
Time-domain radio astronomy utilizes a harmonic sum algorithm as part of the Fourier domain periodic...
We present an implementation of the overlap-and-save method, a method for the convolution of very lo...
We present an improvement of our implementation of the Correlation Technique for the Fourier Domain ...
The study of binary pulsars enables tests of general relativity. Orbital motion in binary systems ca...
Pulsar acceleration searches are methods for recovering signals from radio telescopes, that may othe...
Binary pulsars are an important target for radio surveys because they present a natural laboratory f...
In this paper, we present a comparison study about implementatons of phase correlation function usin...
International audienceWe are interested in the intensive use of Factorial Correspondence Analysis (F...
The fast Fourier transform (FFT) plays an important role in digital signal processing (DSP)...
The $\mathcal{F}$-statistic is a detection statistic used widely in searches for continuous gravitat...
Fourier methods have revolutionized many fields of science and engineering, such as astronomy, medic...
Using the Fourier Domain Acceleration Search (FDAS) method to search for binary pulsars is a computa...
One-dimensional incoherent harmonic summing is a technique used to improve the sensitivity of Fourie...
We introduce a new approach to get faster MRI acquisition. By reducing the number of data-samples in...
When creating electronic devices, it is essential to model what happens when an electromagnetic fiel...
Time-domain radio astronomy utilizes a harmonic sum algorithm as part of the Fourier domain periodic...
We present an implementation of the overlap-and-save method, a method for the convolution of very lo...