Sciweavers

133 search results - page 1 / 27
» Multithreaded algorithms for the fast Fourier transform
Sort
View
SPAA
2000
ACM
13 years 9 months ago
Multithreaded algorithms for the fast Fourier transform
Parimala Thulasiraman, Kevin B. Theobald, Ashfaq A...
NIPS
2003
13 years 6 months ago
Generalised Propagation for Fast Fourier Transforms with Partial or Missing Data
Discrete Fourier transforms and other related Fourier methods have been practically implementable due to the fast Fourier transform (FFT). However there are many situations where ...
Amos J. Storkey
APCCAS
2006
IEEE
261views Hardware» more  APCCAS 2006»
13 years 6 months ago
A Grouped Fast Fourier Transform Algorithm Design For Selective Transformed Outputs
- In this paper, the grouped scheme is specially applied to compute the fast Fourier transform (FFT) when the portions of transformed outputs are calculated selectively. The groupe...
Chih-Peng Fan, Guo-An Su
CPHYSICS
2010
195views more  CPHYSICS 2010»
13 years 4 months ago
Fast spherical Bessel transform via fast Fourier transform and recurrence formula
We propose a new method for the numerical evaluation of the spherical Bessel transform. A formula is derived for the transform by using an integral representation of the spherical...
Masayuki Toyoda, Taisuke Ozaki
AAECC
1999
Springer
109views Algorithms» more  AAECC 1999»
13 years 9 months ago
A Fast Program Generator of Fast Fourier Transforms
Michael Clausen, Meinard Müller