FFT pruning
- 1 December 1971
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Audio and Electroacoustics
- Vol. 19 (4), 305-311
- https://doi.org/10.1109/tau.1971.1162205
Abstract
There are basically four modifications of the N=2Mpoint FFT algorithm developed by Cooley and Tukey which give improved computational efficiency. One of these, FFT pruning, is quite useful for applications such as interpolation (in both the time and frequency domain), and least-squares approximation with trignometric polynomials. It is shown that for situations in which the relative number of zero-valued samples is quite large, significant time-saving can be obtained by pruning the FFT algorithm. The programming modifications are developed and shown to be nearly trivial. Several applications of the method for speech analysis are presented along with Fortran programs of the basic and pruned FFT algorithm. The technique described can also be applied effectively for evaluating a narrow region of the frequency domain by pruning a decimation-in-time algorithm.Keywords
This publication has 6 references indexed in Scilit:
- System for Automatic Formant Analysis of Voiced SpeechThe Journal of the Acoustical Society of America, 1970
- An algorithm for computing the mixed radix fast Fourier transformIEEE Transactions on Audio and Electroacoustics, 1969
- A radix-eight fast Fourier transform subroutine for real-valued seriesIEEE Transactions on Audio and Electroacoustics, 1969
- Speech Analysis-Synthesis System Based on Homomorphic FilteringThe Journal of the Acoustical Society of America, 1969
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965
- Short-Time Spectrum and “Cepstrum” Techniques for Vocal-Pitch DetectionThe Journal of the Acoustical Society of America, 1964