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: The frequency-domain dynamic test of analog-to-digital converters (ADCs) is considered under the assumption of noncoherent sinewave sampling and a procedure is described which is based on the windowed discrete Fourier transform (WDFT), optimized for the achievement of high estimation accuracy.
Abstract: In this paper, the frequency-domain dynamic test of analog-to-digital converters (ADCs) is considered under the assumption of noncoherent sinewave sampling. A procedure is described which is based on the windowed discrete Fourier transform (WDFT), optimized for the achievement of high estimation accuracy. With this aim, the class of windows belonging to the set of discrete prolate spheroidal sequences is adopted for the reduction of the effects of spectral leakage. Practical suggestions are given for a straightforward applicability of derived results and for an efficient estimation of ADC spectral parameters. Finally, experimental results are presented in order to validate the proposed testing approach.
56 citations
TL;DR: This brief presents a novel scalable architecture for in-place fast Fourier transform (IFFT) computation for real-valued signals based on a modified radix-2 algorithm, which removes the redundant operations from the flow graph.
Abstract: This brief presents a novel scalable architecture for in-place fast Fourier transform (IFFT) computation for real-valued signals. The proposed computation is based on a modified radix-2 algorithm, which removes the redundant operations from the flow graph. A new processing element (PE) is proposed using two radix-2 butterflies that can process four inputs in parallel. A novel conflict-free memory-addressing scheme is proposed to ensure the continuous operation of the FFT processor. Furthermore, the addressing scheme is extended to support multiple parallel PEs. The proposed real-FFT processor simultaneously requires fewer computation cycles and lower hardware cost compared to prior work. For example, the proposed design with two PEs reduces the computation cycles by a factor of 2 for a 256-point real fast Fourier transform (RFFT) compared to a prior work while maintaining a lower hardware complexity. The number of computation cycles is reduced proportionately with the increase in the number of PEs.
56 citations
TL;DR: Two methods for FFT of one-dimensional arrays of data to be fast Fourier transformed are presented-one efficient when data storage is only slightly larger than available internal memory, and one when data is much larger.
Abstract: Occasionally, arrays of data to be fast Fourier transformed (FFT'ed) are too large to fit in internal computer memory, and must be kept on an external storage device. This situation is especially serious for one-dimensional arrays, since they cannot be factored along the natural cleavage planes, as multi-dimensional arrays can. Two methods for FFT of such data are presented-one efficient when data storage is only slightly larger than available internal memory, and one when data is much larger. A FORTRAN program based on these methods is available.
56 citations
01 Jan 1992
TL;DR: In this article, the basic objects of study are functions of several variables which are periodic in each of these variables and the corresponding periods are assumed to be the same and equal to 2π.
Abstract: The basic objects of study in this article are functions of several variables which are periodic in each of these variables. We may assume (this assumption is not very restrictive) that the corresponding periods are the same and equal to 2π.
56 citations
TL;DR: The new method has a similar computational complexity to the old, and is exactly reversible, and uses the well-known decomposition of rotation into three pure shears.
56 citations