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
••
TL;DR: RDFT has better performance than DFT in the computation of real convolution because of the reduced number of operations, and the fact that forward and inverse transforms can be implemented with the same signal flowgraph, thereby facilitating hardware and software design.
Abstract: The real discrete Fourier transform (RDFT) corresponds to the Fourier series for sampled periodic signals with sampled periodic frequency responses just as discrete Fourier transform (DFT) corresponds to the complex Fourier series for the same type of signals RDFT has better performance than DFT in data compression and filtering for all signals in the sense that Pearl's measure for RDFT is less than Pearl's measure for DFT by an amount ΔW RDFT also has better performance than DFT in the computation of real convolution because of the reduced number of operations, and the fact that forward and inverse transforms can be implemented with the same signal flowgraph, thereby facilitating hardware and software design
77 citations
••
TL;DR: A space-vector discrete-time Fourier transform is proposed for fast and precise detection of the fundamental-frequency and harmonic positive- and negative-sequence vector components of three-phase input signals.
Abstract: In this paper, a space-vector discrete-time Fourier transform is proposed for fast and precise detection of the fundamental-frequency and harmonic positive- and negative-sequence vector components of three-phase input signals. The discrete Fourier transform is applied to the three-phase signals represented by Clarke's αβ vector. It is shown that the complex numbers output from the Fourier transform are the instantaneous values of the positive- and negative-sequence harmonic component vectors of the input three-phase signals. The method allows the computation of any desired positive- or negative-sequence fundamental-frequency or harmonic vector component of the input signal. A recursive algorithm for low-effort online implementation is also presented. The detection performance for variable-frequency and interharmonic input signals is discussed. The proposed and other usual method performances are compared through simulations and experiments.
77 citations
••
TL;DR: This correspondence shows that the amount of work can be cut to doing two single length FFT's, which is equivalent to doing one double length fast Fourier transform.
Abstract: Ahmed has shown that a discrete cosine transform can be implemented by doing one double length fast Fourier transform (FFT). In this correspondence, we show that the amount of work can be cut to doing two single length FFT's.
77 citations
••
TL;DR: A notion of 2D discrete Radon transforms for2D discrete images, which is based on summation along lines of absolute slope less than 1, is defined, and is shown to be geometrically faithful: the summation avoids wrap-around effects.
Abstract: Although naturally at the heart of many fundamental physical computations, and potentially useful in many important image processing tasks, the Radon transform lacks a coherent discrete definition for two-dimensional (2D) discrete images which is algebraically exact, invertible, and rapidly computable. We define a notion of 2D discrete Radon transforms for 2D discrete images, which is based on summation along lines of absolute slope less than 1. Values at nongrid locations are defined using trigonometric interpolation on a zero-padded grid. Our definition is shown to be geometrically faithful: the summation avoids wrap-around effects. Our proposal uses a special collection of lines in $\mathbb{R}^{2}$ for which the transform is rapidly computable and invertible. We describe a fast algorithm using $O(N\log{N})$ operations, where $N =n^{2}$ is the number of pixels in the image. The fast algorithm exploits a discrete projection-slice theorem, which associates the discrete Radon transform with the pseudopolar Fourier transform [A. Averbuch et al., SIAM J. Sci. Comput., 30 (2008), pp. 764-784]. Our definition for discrete images converges to a natural continuous counterpart with increasing refinement.
77 citations
••
TL;DR: In this paper, it was shown that the Fourier transform belongs to Lq(r, da) for a certain natural measure on the su.rface of a circular cone in R3.
Abstract: Let r be the su.rface of a circular cone in R3. We show that if 1 < p < 4/3, 1/q = 3(1-1/p) and f E LP(R3), then the Fourier transform of f belongs to Lq(r, da) for a certain natural measure a on r. Following P. Tomas we also establish bounds for restrictions of Fourier transforms to conic annuli at the endpoint p = 4/3, with logarithmic growth of the bound as the thickness of the annulus tends to zero.
77 citations