GPU Fast Convolution via the Overlap-and-Save Method in Shared Memory
arXiv:1910.01972 · doi:10.1145/3394116
Abstract
We present an implementation of the overlap-and-save method, a method for the convolution of very long signals with short response functions, which is tailored to GPUs. We have implemented several FFT algorithms (using the CUDA programming language) which exploit GPU shared memory, allowing for GPU accelerated convolution. We compare our implementation with an implementation of the overlap-and-save algorithm utilizing the NVIDIA FFT library (cuFFT). We demonstrate that by using a shared memory based FFT we can achieved significant speed-ups for certain problem sizes and lower the memory requirements of the overlap-and-save method on GPUs.
arXiv commentaccepted to ACM TACO
References in corpus (5)
- Fast Convolutional Nets With fbfft: A GPU Performance Evaluation
- A GPU implementation of the Correlation Technique for Real-time Fourier Domain Pulsar Acceleration Searches
- Pulsar Acceleration Searches on the GPU for the Square Kilometre Array
- A polyphase filter for many-core architectures
- Improved Acceleration of the GPU Fourier Domain Acceleration Search Algorithm