Title :
Logarithmic pruning of FFT frequencies
Author :
Barash, S. ; Ritov, Ya´acov
Author_Institution :
Dept. of Neurobiol., Weizmann Inst. of Sci., Rehovot, Israel
fDate :
3/1/1993 12:00:00 AM
Abstract :
A standard fast Fourier transform (FFT) computes the transform at evenly spaced points on a linear scale. A simple modification of the FFT algorithm that results in an efficient method for calculating the transform only at evenly spaced frequencies on a logarithmic scale is proposed. The saving in the number of operations, compared with a standard FFT, is approximately 60% for typical values
Keywords :
fast Fourier transforms; FFT algorithm; FFT frequencies; evenly spaced frequencies; fast Fourier transform; logarithmic pruning; logarithmic scale; Artificial neural networks; Associative memory; Bridges; Discrete Fourier transforms; Distributed processing; Fast Fourier transforms; Fourier transforms; Frequency domain analysis; Neural networks; Notice of Violation;
Journal_Title :
Signal Processing, IEEE Transactions on
