FAST FOURIER TRANSFORM

(FFT)
(GROUP 3)
PINEDA, GIAN RAYNIEL R.
TUGADE, AMIEL NIKO O.
UPAO, HASSANAL J.
VILLARANDA, PATRICK JOHN T.

FOURIER TRANSFORM
Deals primarily with the transformation of discrete
data between time and frequency domains.

Discrete-Time Fourier Transform (DTDT)

Discrete Fourier Transform(DFT)
Fast Fourier Transform(FFT)

FAST FOURIER TRANSFORM (FFT)

Direct computation of the DFT equation is not
time-efficient for long processes
FFT algorithm is an efficient way of computing the
DFT , basically using the Divide-and-Conquer
approach

DFT COMPUTATIONAL COMPLEXITY

Thus,

for the input sequence of the

length N the number of arithmetic
operations in direct computation of DFT
is proportional to N.

For N=1000 , about a million

operations are needed!
In 1960s such a number was
considered prohibitive in most applications

DISCOVERY OF FAST FOURIER TRANSFORM (FFT)

When in 1965 Cooley and Turkey first announced discovery of

FFT in 1965 it revolutionized Digital Signal Processing.

They were actually 150 years late The principle of the FFT was
later discovered in obscure section of one of Gauss own
notebooks in 1806.

Cooley and Turkeys paper is the most cited mathematical paper

ever written.

They are just computational schemes for computing the DFT- not
new transform!

IMPORTANT APPLICATIONS:

For Further Understanding: