Sciweavers

160 search results - page 2 / 32
» On the diagonalization of the discrete Fourier transform
Sort
View
JOT
2010
167views more  JOT 2010»
13 years 3 months ago
The Discrete Fourier Transform, Part 5: Spectrogram
This paper is part 5 in a series of papers about the Discrete Fourier Transform (DFT) and the Inverse Discrete Fourier Transform (IDFT). The focus of this paper is on the spectrog...
Douglas Lyon
NIPS
2003
13 years 6 months ago
Generalised Propagation for Fast Fourier Transforms with Partial or Missing Data
Discrete Fourier transforms and other related Fourier methods have been practically implementable due to the fast Fourier transform (FFT). However there are many situations where ...
Amos J. Storkey
ICASSP
2008
IEEE
13 years 11 months ago
Alternatives to the discrete fourier transform
It is well-known that the discrete Fourier transform (DFT) of a finite length discrete-time signal samples the discrete-time Fourier transform of the same signal at equidistant p...
Doru-Cristian Balcan, Aliaksei Sandryhaila, Jonath...
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 ...
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 5 months ago
The discrete Fourier transform: A canonical basis of eigenfunctions
We exhibit a canonical basis of eigenvectors for the discrete Fourier transform (DFT). The transition matrix from the standard basis to defines a novel transform which we call ...
Shamgar Gurevich, Ronny Hadani, Nir A. Sochen