242 search results - page 11 / 49 » Optimized Fast Algorithms for the Quaternionic Fourier Trans... |
ICIP
2010
IEEE
13 years 6 months ago
2010
IEEE
The Fast Fourier Transform (FFT) allows the Discrete Time Fourier Transform (DTFT) to be efficiently sampled on a uniform grid in frequency. In many applications, including Magnet...
DATE
2008
IEEE
14 years 3 months ago
2008
IEEE
This paper presents a new application field for the Goertzel algorithm. The test of mixed-signal circuits involves the generation and analysis of signals. A standard method for th...
IPPS
2003
IEEE
14 years 2 months ago
2003
IEEE
In this paper we use a mathematical approach to automatically generate high performance short vector code for the discrete Fourier transform (DFT). We represent the well-known Coo...
FOCM
2010
13 years 7 months ago
2010
We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how t...
CCGRID
2011
IEEE
13 years 9 days ago
2011
IEEE
– Efficient implementations of the Discrete Fourier Transform (DFT) for GPUs provide good performance with large data sizes, but are not competitive with CPU code for small data ...