An improved fast Fourier transform algorithm using mixed frequency and time decimations
Reads0
Chats0
TLDR
An improved FFT (fast Fourier transform) algorithm combining both decimations in frequency and in time is presented, and stress is placed on the derivation of general formulas for submatrices and multiplicands.Abstract:
An improved FFT (fast Fourier transform) algorithm combining both decimations in frequency and in time is presented. Stress is placed on a derivation of general formulas for submatrices and multiplicands. Computational efficiency is briefly discussed. >read more
Citations
More filters
Journal ArticleDOI
The Design and Implementation of FFTW3
Matteo Frigo,Steven G. Johnson +1 more
TL;DR: It is shown that such an approach can yield an implementation of the discrete Fourier transform that is competitive with hand-optimized libraries, and the software structure that makes the current FFTW3 version flexible and adaptive is described.
Book ChapterDOI
Fast Fourier Transforms
TL;DR: In this paper, the authors discuss the controversial claim that any continuous periodic signal could be represented by the sum of properly chosen sinusoidal waves, and discuss the use of the Fourier transform for digital signal processing.
Journal ArticleDOI
Real-time FFT with pre-calculation
TL;DR: The technique of pre-calculation process for real-time FFT, which simultaneously constructs and computes the butterfly modules while the incoming data is collected, is presented and is a better choice for a critical mission requiring a shorter time to complete the FFT calculation.
Proceedings ArticleDOI
An intelligent circuit breaker with synchronous closing function based on DSP
Cai Zhiyuan,Yu Li,Ma Shaohua +2 more
TL;DR: An intelligent circuit breaker with synchronous closing function based on DSP is presented in this paper and the simulation results show a good agreement with the predictions.
Proceedings ArticleDOI
Research on the Intelligence High-Voltage Circuit Breaker Based on DSP
TL;DR: In this paper an intelligence recloser with faults breaking and synchronizing make function based on DSP is presented and the experiments show that it is effectively to reduce the making current and obviously to improve circuit breaker's performance.
References
More filters
Journal ArticleDOI
An algorithm for the machine calculation of complex Fourier series
J.W. Cooley,John W. Tukey +1 more
TL;DR: Good generalized these methods and gave elegant algorithms for which one class of applications is the calculation of Fourier series, applicable to certain problems in which one must multiply an N-vector by an N X N matrix which can be factored into m sparse matrices.
Journal ArticleDOI
An algorithm for computing the mixed radix fast Fourier transform
TL;DR: This paper presents an algorithm for computing the fast Fourier transform, based on a method proposed by Cooley and Tukey, and includes an efficient method for permuting the results in place.
Journal ArticleDOI
A prime factor FFT algorithm using high-speed convolution
TL;DR: Two recently developed ideas, the conversion of a discrete Fourier transform to convolution and the implementation of short convolutions with a minimum of multiplications, are combined to give efficient algorithms for long transforms.
Journal ArticleDOI
On computing the Discrete Fourier Transform.
TL;DR: New algorithms for computing the Discrete Fourier Transform of n points use substantially fewer multiplications than the best algorithm previously known, and about the same number of additions.
Journal ArticleDOI
A new principle for fast Fourier transformation
C. Rader,N. Brenner +1 more
TL;DR: In this paper, an alternative form of the fast Fourier transform (FFT) is developed, which has the peculiarity that none of the multiplying constants required are complex-most are pure imaginary.