225 search results - page 2 / 45 » The Future Fast Fourier Transform |
SIAMNUM
2010
13 years 2 days ago
2010
A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like ...
APCCAS
2006
IEEE
13 years 7 months ago
2006
IEEE
- 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...
Book
"The Discrete Fourier Transform (DFT) can be understood as a numerical approximation to the Fourier transform. However, the DFT has its own exact Fourier theory, which is the ...
JCSS
2010
13 years 3 months ago
2010
Convolution y(t) = a(t − s) · x(s) ds is one of the main techniques in digital signal processing. A straightforward computation of the convolution y(t) requires O(n2) steps, wh...
AAECC
1999
Springer
13 years 9 months ago
1999
Springer