25 search results - page 2 / 5 » The Centered Discrete Fourier Transform and a parallel imple... |
ICIP
2001
IEEE
14 years 7 months ago
2001
IEEE
New algorithms for computing the Discrete Fourier Transform (DFT) spectra along different directions are derived and implemented. For computing the DFT spectrum along any given di...
ICASSP
2009
IEEE
13 years 9 months ago
2009
IEEE
We derive a recursive general-radix pruned Cooley-Tukey fast Fourier transform (FFT) algorithm in Kronecker product notation. The algorithm is compatible with vectorization and pa...
ISCAS
2005
IEEE
13 years 11 months ago
2005
IEEE
— Fast Fourier transform (FFT) algorithms are used in a wide variety of digital signal processing applications and many of these require high-performance parallel implementations...
HIPC
2007
Springer
13 years 11 months ago
2007
Springer
The Fast Fourier Transform (FFT) is of primary importance and a fundamental kernel in many computationally intensive scientific applications. In this paper we investigate its perf...
DAC
1996
ACM
13 years 9 months ago
1996
ACM
In order to optimize interconnect to avoid signal integrity problems, very fast and accurate 3-D capacitance extraction is essential. Fast algorithms, such as the multipole or prec...