By Topic

FFT pruning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Markel, J. ; Speech Communications Research Laboratory, Santa Barbara, CA

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.

Published in:

Audio and Electroacoustics, IEEE Transactions on  (Volume:19 ,  Issue: 4 )