481 search results - page 3 / 97 » A Fast Program Generator of Fast Fourier Transforms |
VMV
2004
15 years 1 months ago
2004
The Fourier volume rendering technique operates in the frequency domain and creates line integral projections of a 3D scalar field. These projections can be efficiently generated ...
126
click to vote
EC
1998
14 years 11 months ago
1998
This paper is the first part of a two part series. It proves a number of direct relationships between the Fourier transform and the simple genetic algorithm. (For a binary repres...
106
click to vote
DAC
1996
ACM
15 years 3 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...
107
click to vote
PACT
2009
Springer
15 years 6 months ago
2009
Springer
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...
JCSS
2010
14 years 10 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...