• FFTW

  • Referenced in 433 articles [sw04126]
  • subroutine library for computing the discrete Fourier transform (DFT) in one or more dimensions ... well as of even/odd data, i.e. the discrete cosine/sine transforms or DCT/DST). We believe that...
  • SAMURAI

  • Referenced in 26 articles [sw09145]
  • uses a polynomial interpolation exploiting the Discrete Fourier Transform. SAMURAI can process integrands written either...
  • cuFFT

  • Referenced in 21 articles [sw11258]
  • describes cuFFT, the NVIDIA® CUDA™ Fast Fourier Transform (FFT) product. It consists of two separate ... conquer algorithm for efficiently computing discrete Fourier transforms of complex or real-valued data sets...
  • PERMS

  • Referenced in 7 articles [sw20247]
  • elements; Characters, Littlewood-Richardson rule, plethysms; Discrete Fourier transform; Tools, concerning tensor investigations...
  • AS 83

  • Referenced in 4 articles [sw03890]
  • Algorithm AS 83. Complex discrete fast Fourier transform...
  • AS 97

  • Referenced in 4 articles [sw03891]
  • Algorithm AS 97. Real discrete fast Fourier transform...
  • SFFT

  • Referenced in 2 articles [sw25343]
  • linear time algorithms for computing the discrete Fourier transform of a time domain signal which...
  • nuSpectral

  • Referenced in 2 articles [sw26228]
  • show the equivalence to the discrete Fourier transform applied onto uniformly sampled data...
  • ZKCM

  • Referenced in 2 articles [sw16659]
  • singular-value decomposition, and the discrete Fourier transform. For basic floating-point operations...
  • SFAPS

  • Referenced in 2 articles [sw22490]
  • particular protein interaction after computing the Discrete Fourier Transform for protein sequences. The informational spectrum...
  • GPB

  • Referenced in 2 articles [sw18875]
  • derive the probability distribution via the discrete Fourier transform of the characteristic function...
  • JTransforms

  • Referenced in 1 article [sw20195]
  • four types of transforms are available: Discrete Fourier Transform (DFT), Discrete Cosine Transform (DCT), Discrete...
  • DFTI

  • Referenced in 1 article [sw00201]
  • Transform (FFT) algorithm that calculates the Discrete Fourier Transform (DFT) is one of the major...
  • FFTE

  • Referenced in 1 article [sw30388]
  • Transform Package. A package to compute Discrete Fourier Transforms of 1-, 2- and 3- dimensional...
  • AS 186

  • Referenced in 2 articles [sw27936]
  • algorithm of data permutation in discrete fast Fourier transform...
  • AS 117

  • Referenced in 1 article [sw03892]
  • Algorithm AS 117. The Chirp discrete Fourier transform of general length...
  • NFFT.jl

  • Referenced in 1 article [sw30131]
  • implementation of the Non-equidistant Fast Fourier Transform (NFFT). For a detailed introduction into ... fast implementation of the Non-equidistant Discrete Fourier Transform (NDFT) that is basically...
  • gNUFFTW

  • Referenced in 1 article [sw31003]
  • Transforms. Non-uniform sampling of the Fourier transform appears in many important applications such ... fast application of the non-uniform discrete Fourier transform (NUDFT) and its adjoint operation...
  • DHT

  • Referenced in 1 article [sw31550]
  • same path as the Discrete Fourier/Continuous Fourier transform. This DHT possesses orthogonality properties which lead ... also possesses the standard set of discrete shift, modulation, multiplication and convolution rules. The proposed...
  • WignerEisenbud

  • Referenced in 1 article [sw10351]
  • package WignerEisenbud, which uses the Fourier discrete cosine transform to compute the Wigner-Eisenbud functions...