Sciweavers

129 search results - page 4 / 26
» Discrete Fourier Transform Computation Using Neural Networks
Sort
View
SIPS
2008
IEEE
14 years 4 months ago
Efficient image reconstruction using partial 2D Fourier transform
In this paper we present an efficient way of doing image reconstruction using the 2D Discrete Fourier transform (DFT). We exploit the fact that in the frequency domain, informati...
Lanping Deng, Chi-Li Yu, Chaitali Chakrabarti, Jun...
ICS
2009
Tsinghua U.
14 years 4 months ago
Computer generation of fast fourier transforms for the cell broadband engine
The Cell BE is a multicore processor with eight vector accelerators (called SPEs) that implement explicit cache management through direct memory access engines. While the Cell has...
Srinivas Chellappa, Franz Franchetti, Markus P&uum...
AICCSA
2006
IEEE
168views Hardware» more  AICCSA 2006»
14 years 3 months ago
Power Efficient Algorithms for Computing Fast Fourier Transform over Wireless Sensor Networks
Collaborative signal processing is one of the most promising applications that are currently being investigated for sensor networks. In this paper, we use FFT computation as a veh...
Turkmen Canli, Ajay K. Gupta, Ashfaq A. Khokhar
PRL
2006
103views more  PRL 2006»
13 years 9 months ago
Comparison of extrasystolic ECG signal classifiers using discrete wavelet transforms
This work compares and contrasts results of classifying time-domain ECG signals with pathological conditions taken from the MIT
Tom Froese, Sillas Hadjiloucas, Roberto Kawakami H...
STOC
2012
ACM
192views Algorithms» more  STOC 2012»
12 years 7 days ago
Nearly optimal sparse fourier transform
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...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...