Design Con 2015
Welcome Guest Log In | Register

The Fast Fourier Transform

Authored on: Mar 7, 2005 by Steven W. Smith

Technical Paper

0 1
More InfoLess Info
There are several ways to calculate the Discrete Fourier Transform (DFT), such as solving simultaneous linear equations or the correlation method. The Fast Fourier Transform (FFT) is another method for calculating the DFT. While it produces the same result as the other approaches, it is incredibly more efficient, often reducing the computation time by hundreds. This is the same improvement as flying in a jet aircraft versus walking! If the FFT were not available, many of the techniques described in this book would not be practical. While the FFT only requires a few dozen lines of code, it is one of the most complicated algorithms in DSP. But don't despair! You can easily use published FFT routines without fully understanding the internal workings.

The Scientist and Engineer's Guide to Digital Signal Processing, ©1997-1998 by Steven W. Smith. For more information visit the book's website at: www.DSPguide.com

View
 
1 comment
write a comment

No Avatar

Charles793 Posted Feb 18, 2013

This file appears to be damaged & can't be opened.

reply

Please Login

You will be redirected to the login page

×

Please Login

You will be redirected to the login page

×

Please Login

You will be redirected to the login page