Topic
Discrete-time Fourier transform
About: Discrete-time Fourier transform is a research topic. Over the lifetime, 5072 publications have been published within this topic receiving 144643 citations. The topic is also known as: DTFT.
Papers published on a yearly basis
Papers
More filters
42 citations
TL;DR: A method to randomize the Fourier transform, which can be applied in the field of image encryption and decryption because of the ambiguity of the eigenvalues.
Abstract: We have investigated the multiplicity and complexity in eigenvalues of the fractional Fourier transform and found that the ambiguity of the eigenvalues may indicate randomness. We have therefore proposed a method to randomize the Fourier transform. Such a random Fourier transform can be applied in the field of image encryption and decryption.
42 citations
TL;DR: A graph-theoretic model for a class of linear algorithms computing the discrete Fourier transform of sequences of length a power of 2 is presented and shown to be umquely optimal in tim class with respect to a naturally defined cost.
Abstract: A graph-theoretic model for a class of linear algorithms computing the discrete Fourier transform of sequences of length a power of 2, the mformat~on flow network, is presented The information flow network correspondmg to the fast Fourier transform IS shown to be umquely optimal in tim class with respect to a naturally defined cost
42 citations
TL;DR: In this paper, the Fast Fourier Transform (FFT) is used for fitting experimental data described by a sum of exponentials, which has been shown to be well suited for use even on a small computer.
42 citations
TL;DR: The problem of estimating the frequency of a complex single tone is considered and two iterative Fourier interpolation algorithms are generalized by introducing an additional parameter to allow for selection of the Fouriers interpolation coefficients relative to the true frequency.
42 citations