Topic
Discrete Fourier transform
About: Discrete Fourier transform is a research topic. Over the lifetime, 10234 publications have been published within this topic receiving 207520 citations.
Papers published on a yearly basis
Papers
More filters
••
2,320 citations
••
IBM1
TL;DR: An indexing method for time sequences for processing similarity queries using R * -trees to index the sequences and efficiently answer similarity queries and provides experimental results which show that the method is superior to search based on sequential scanning.
Abstract: We propose an indexing method for time sequences for processing similarity queries. We use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain, the crucial observation being that, for most sequences of practical interest, only the first few frequencies are strong. Another important observation is Parseval's theorem, which specifies that the Fourier transform preserves the Euclidean distance in the time or frequency domain. Having thus mapped sequences to a lower-dimensionality space by using only the first few Fourier coefficients, we use R * -trees to index the sequences and efficiently answer similarity queries. We provide experimental results which show that our method is superior to search based on sequential scanning. Our experiments show that a few coefficients (1–3) are adequate to provide good performance. The performance gain of our method increases with the number and length of sequences.
2,082 citations
••
TL;DR: An algorithm to estimate a signal from its modified short-time Fourier transform (STFT) by minimizing the mean squared error between the STFT of the estimated signal and the modified STFT magnitude is presented.
Abstract: In this paper, we present an algorithm to estimate a signal from its modified short-time Fourier transform (STFT). This algorithm is computationally simple and is obtained by minimizing the mean squared error between the STFT of the estimated signal and the modified STFT. Using this algorithm, we also develop an iterative algorithm to estimate a signal from its modified STFT magnitude. The iterative algorithm is shown to decrease, in each iteration, the mean squared error between the STFT magnitude of the estimated signal and the modified STFT magnitude. The major computation involved in the iterative algorithm is the discrete Fourier transform (DFT) computation, and the algorithm appears to be real-time implementable with current hardware technology. The algorithm developed in this paper has been applied to the time-scale modification of speech. The resulting system generates very high-quality speech, and appears to be better in performance than any existing method.
1,899 citations
••
TL;DR: Estimation of the parameters of a single-frequency complex tone from a finite number of noisy discrete-time observations is discussed and appropriate Cramer-Rao bounds and maximum-likelihood estimation algorithms are derived.
Abstract: Estimation of the parameters of a single-frequency complex tone from a finite number of noisy discrete-time observations is discussed. The appropriate Cramer-Rao bounds and maximum-likelihood (MI.) estimation algorithms are derived. Some properties of the ML estimators are proved. The relationship of ML estimation to the discrete Fourier transform is exploited to obtain practical algorithms. The threshold effect of one algorithm is analyzed and compared to simulation results. Other simulation results verify other aspects of the analysis.
1,878 citations
••
TL;DR: A digital method for solving the phase-retrieval problem of optical-coherence theory: the reconstruction of a general object from the modulus of its Fourier transform, which should be useful for obtaining high-resolution imagery from interferometer data.
Abstract: We present a digital method for solving the phase-retrieval problem of optical-coherence theory: the reconstruction of a general object from the modulus of its Fourier transform. This technique should be useful for obtaining high-resolution imagery from interferometer data.
1,762 citations