
MKL
 Referenced in 50 articles
[sw06975]
 vectorized and threaded Linear Algebra, Fast Fourier Transforms (FFT), Vector Math and Statistics functions. Through...

SWIFFT
 Referenced in 32 articles
[sw11588]
 SWIFFT: A modest proposal for FFT hashing. We propose SWIFFT, a collection of compression functions ... novel use of the Fast Fourier Transform (FFT) to achieve “diffusion,” together with a linear...

cuFFT
 Referenced in 17 articles
[sw11258]
 describes cuFFT, the NVIDIA® CUDA™ Fast Fourier Transform (FFT) product. It consists of two separate...

kWave
 Referenced in 8 articles
[sw07387]
 detector geometry based on the fast Fourier transform (FFT) is also included. The architecture...

decon
 Referenced in 7 articles
[sw11088]
 adapt the ”Fast Fourier Transform” (FFT) algorithm for density estimation with errorfree data...

UHFFT
 Referenced in 6 articles
[sw03128]
 portable software library for fast Fourier transforms (FFT...

DAMRO1
 Referenced in 2 articles
[sw07446]
 regards to the time domain, fast Fourier transform (FFT) and Poincaré map. Periodic and quasi...

INFFTM
 Referenced in 1 article
[sw20251]
 computational physics owing to the Fast Fourier Transform (FFT) algorithm, efficient techniques for the fast ... language. Here we employ the Nonequispaced Fast Fourier Transform (NFFT, by J. Keiner, S. Kunis...

DFTI
 Referenced in 1 article
[sw00201]
 Fast Fourier Transform (FFT) algorithm that calculates the Discrete Fourier Transform ... software applications that provide fast computation of DFT via FFT differ vastly in functionality...

FFTbor2D
 Referenced in 1 article
[sw11717]
 employing the Fast Fourier Transform (FFT),FFTbor2D computes the same value in time...

DBECGPCUDA
 Referenced in 1 article
[sw18217]
 addition, the Fast Fourier Transform (FFT) library used in the previous version is replaced...

Pescan
 Referenced in 1 article
[sw20134]
 plane wave basis set. Fast Fourier transform (FFT) is used to transform the wavefunction from...

WATERWAVES
 Referenced in 1 article
[sw13596]
 radial kinetic term uses a fast Fourier transform (FFT) to obtain an operator which...

DWT
 Referenced in 1 article
[sw14616]
 user specific decomposition level using Fast Fourier Transform (FFT) and to provide a option...

speaq
 Referenced in 0 articles
[sw17792]
 method makes use of Fast Fourier Transformation (FFT) crosscorrelation. Since the method returns...

PFFT
 Referenced in 8 articles
[sw07582]
 based software library for computing fast Fourier transforms (FFTs) on massively parallel, distributed memory architectures ... interface standard (MPI). Similar to established transpose FFT algorithms, we propose a parallel FFT framework...

PNFFT
 Referenced in 5 articles
[sw07583]
 parallel algorithm for calculating nonequispaced fast Fourier transforms on massively parallel distributed memory architectures ... algorithm due to the use of oversampled FFT. This algorithm has been implemented ... parallel distributed memory algorithm for the fast computation of fully Coulomb interactions in a charged ... adjustment of the underlying parallel nonequispaced fast Fourier transform circumvents severe load imbalance...

gearshifft
 Referenced in 1 article
[sw18804]
 gearshifft  The FFT Benchmark Suite for Heterogeneous Platforms. Fast Fourier Transforms (FFTs) are exploited ... rising data production bandwidths of modern FFT applications, judging best which algorithmic tool to apply...

P3DFFT
 Referenced in 7 articles
[sw06503]
 software package called P3DFFT which implements fast Fourier transforms (FFTs) in three dimensions ... known scalability bottleneck of threedimensional (3D) FFT implementations by using twodimensional domain decomposition...

SW2DFFT
 Referenced in 1 article
[sw11856]
 matrices. Most of the commonly used fast Fourier transform subroutines can not handle large data ... this paper we present a twodimensional FFT program (SW2DFFT) and its long write...