Sciweavers

55 search results - page 2 / 11
» Generalized Discrete Fourier Transform with optimum correlat...
Sort
View
DAC
2005
ACM
14 years 6 months ago
Automatic generation of customized discrete fourier transform IPs
This paper presents a parameterized soft core generator for the discrete Fourier transform (DFT). Reusable IPs of digital signal processing (DSP) kernels are important time-saving...
Grace Nordin, Peter A. Milder, James C. Hoe, Marku...
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
13 years 10 months ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
JMIV
2011
135views more  JMIV 2011»
13 years 7 days ago
Periodic Plus Smooth Image Decomposition
When the Discrete Fourier Transform of an image is computed, the image is implicitly assumed to be periodic. Since there is no reason for opposite borders to be alike, the “peri...
Lionel Moisan
STOC
2012
ACM
192views Algorithms» more  STOC 2012»
11 years 7 months 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 ...
TSP
2010
12 years 12 months ago
Algebraic signal processing theory: sampling for infinite and finite 1-D space
We derive a signal processing framework, called space signal processing, that parallels time signal processing. As such, it comes in four versions (continuous/discrete, infinite/fi...
Jelena Kovacevic, Markus Püschel