69 search results - page 1 / 14 » Optimizing the Fast Fourier Transform on a Multi-core Archit... |
IPPS
2007
IEEE
13 years 11 months ago
2007
IEEE
The rapid revolution in microprocessor chip architecture due to multicore technology is presenting unprecedented challenges to the application developers as well as system softwar...
STOC
2012
ACM
11 years 7 months ago
2012
ACM
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
CAIP
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. In this article, we deal with fast algorithms for the quaternionic Fourier transform (QFT). Our aim is to give a guideline for choosing algorithms in practical cases. Hen...
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...
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...