By Topic

Fast Fourier transform method of computing difference equations and simulating filters

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)
Helms, H.D. ; Bell Telephone Laboratories Inc., Whippany, N.J., USA

Two methods for using the fast Fourier transform to reduce the number of arithmetic operations and, therefore the time required for computing discrete, preformulated, and finite convolutions are listed and justified. Under the idealistic assumption that the impulse response of a preformulated difference equation terminates, a theorem is proved that these two methods can be modified to compute such difference equations. This theorem makes plausible the application of these methods when the impulse response does not terminate, provided that the impulse response decays to a small value. In such cases, the fast Fourier transform can be used to compute approximations to the solutions, although usually this use of the fast Fourier transform offers no reduction in the amount of time required for computing the definition of the difference equation. However, if a filtering operation is specified as a frequency response, the fast Fourier transform can be used to compute the filtering operation directly without need of formulating a difference equation, although this simplification is achieved at the cost of a moderate increase (e.g., twice) in the amount of computation time.

Published in:

Audio and Electroacoustics, IEEE Transactions on  (Volume:15 ,  Issue: 2 )