Fast Fourier Transform (FFT) on GPUs

DOI10.1007/978-3-319-06548-9_16MaRDI QIDQ5261414zbMATH OpenOpenAlexFDO

Authors Yash Ukidave, Gunar Schirner, David Kaeli

Publication date 3 July 2015

Published in Numerical Computations with GPUs (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-06548-9_16

zbMATH Keywords

algorithmfast Fourier transformperformancesignal processing

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Precorrected-FFT Method on Graphics Processing Units
• Big prime field FFT on the GPU
• Accelerating the Fourier split operator method via graphics processing units
• Computation of the Vilenkin-Chrestenson transform on a GPU
• Parallelization of fast Fourier transforms
• Fast Fourier transform algorithms for parallel computers
• scientific article; zbMATH DE number 610966
• A CUDA-MPI algorithm for the fast Fourier transform on the hexagon and its implementation
• scientific article; zbMATH DE number 3976283

Cited in

(2)

• A new theoretical derivation of NFFT and its implementation on GPU
• Accelerating the Fourier split operator method via graphics processing units

Describes a project that uses

Uses Software

• OpenCL
• clAmdfft
• CUDA

This page was built for publication: Fast Fourier Transform (FFT) on GPUs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261414)