Topic
Non-uniform discrete Fourier transform
About: Non-uniform discrete Fourier transform is a research topic. Over the lifetime, 4067 publications have been published within this topic receiving 123952 citations.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: Independence of the evolution time domain size (in the terms of both: dimensionality and evolution time reached), suggests that random sampling should be used rather to design new techniques with large time domain than to accelerate standard experiments.
77 citations
•
01 Jan 1989
TL;DR: Signals and Systems Sampled data and the Z Transform Sinusoidal Response of LSI Systems Couplets and Elementary Filters The Discrete Fourier Transform The Continuous Fourier Integral Transform Application of the Fourier transform to Digital Signal Processing Digital Filter Design Inverse Filtering and Deconvolution Spectral Factorization Power Spectral Estimation Multidimensional DSP References
Abstract: Signals and Systems Sampled Data and the Z Transform Sinusoidal Response of LSI Systems Couplets and Elementary Filters The Discrete Fourier Transform The Continuous Fourier Integral Transform Application of the Fourier Transform to Digital Signal Processing Digital Filter Design Inverse Filtering and Deconvolution Spectral Factorization Power Spectral Estimation Multidimensional DSP References
77 citations
••
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 linear systolic array for the discrete cosine transform, discrete sine transform and their inverses is developed, which has the advantages of pipelinability, regularity, locality, and scalability, making it quite suitable for VLSI signal processing.
Abstract: A linear systolic array for the discrete cosine transform, discrete sine transform, and their inverses is developed. It generates the transform kernel values recursively. Compared to the scheme with the transform kernel values prestored in memory either inside or outside each processing element, the clock period is shortened by a memory access time. In addition, the array pays no cost for prestorage. The systolic array has the advantages of pipelinability, regularity, locality, and scalability, making it quite suitable for VLSI signal processing. >
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