245 search results - page 13 / 49 » A Fast Fourier Transform Compiler |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place ...
NIPS
2001
13 years 8 months ago
2001
In previous work on "transformed mixtures of Gaussians" and "transformed hidden Markov models", we showed how the EM algorithm in a discrete latent variable mo...
FPGA
2006
ACM
13 years 11 months ago
2006
ACM
This paper presents an equation-based resource utilization model for automatically generated discrete Fourier transform (DFT) soft core IPs. The parameterized DFT IP generator all...
DAC
1996
ACM
13 years 11 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...
IPPS
2008
IEEE
14 years 1 months ago
2008
IEEE
With the evolution of Graphics Processing Units (GPUs) into powerful and cost-efficient computing architectures, their range of application has expanded tremendously, especially i...