Fast Fourier Transform (FFT)

FAST FOURIER
TRANSFORM (FFT)
FFT
• Fast Fourier Transform (FFT), a method developed by Cooley and Turkey.
• The FFT may be defined as an algorithm (or a method) for computing the DFT
efficiently (with reduced number of calculations).
• The computational efficiency is achieved by adopting a divide and conquer
approach.
• This approach is based on the decomposition of an N-point DFT into successively
smaller DFTs and then combining them to give the total transform.
• Based on this basic approach, a family of computational algorithms were
developed and they are collectively known as FFT algorithms.
• Basically there are two FFT algorithms; Decimation- in-time (DIT) FFT algorithm
and Decimation-in-frequency (DIF) FFT algorithm.
• The DFT of a sequence x(n) of length N is expressed by a complex-
valued sequence X(k) as
• Let WN be the complex valued phase factor, which is an Nth root of

unity given by
• From the above equations for X(k) and x(n), it is clear that for each
value of k, the direct computation of X(k) involves N complex
multiplications (4N real multiplications) and N – 1 complex additions
(4N – 2 real additions).
• Therefore, to compute all N values of DFT, N2 complex multiplications
and N(N – 1) complex additions are required. In fact the DFT and IDFT
involve the same type of computations.
• If x(n) is a complex-valued sequence, then the N-point DFT given in
equation for X(k) can be expressed as
The direct computation of the DFT needs 2N2 evaluations of trigonometric functions,
4N2 real multiplications and 4N(N – 1) real additions. Also this is primarily inefficient as it
cannot exploit the symmetry and periodicity properties of the phase factor WN, which are
• FFT algorithm exploits the above two symmetry properties and so is an
efficient algorithm for DFT computation.
• By adopting a divide and conquer approach, a computationally efficient
algorithm can be developed. This approach depends on the decomposition of
an N-point DFT into successively smaller size DFTs.
• An N-point sequence, if N can be expressed as N = r1 r2 r3 , ..., rm
• where r1 = r2 = r3 = ... = rm, then N = rm, can be decimated into r-point
sequences.
• For each r-point sequence, r-point DFT can be computed. Hence the DFT is of
size r. The number r is called the radix of the FFT algorithm and the number m
indicates the number of stages in computation.
Decimation in Time (DIT) Radix-2 FFT
• In Decimation in time (DIT) algorithm, the time domain sequence x(n) is
decimated and smaller point DFTs are computed and they are combined
to get the result of N-point DFT.
• In general, we can say that, in DIT algorithm the N-point DFT can be
realized from two numbers of N/2-point DFTs, the N/2-point DFT can be
realized from two numbers of N/4-point DFTs, and so on.
• In DIT radix-2 FFT, the N-point time domain sequence is decimated into 2-
point sequences and the 2-point DFT for each decimated sequence is
computed. From the results of 2-point DFTs, the 4-point DFTs, from the
results of 4-point DFTs, the 8-point DFTs and so on are computed until we
get N-point DFT.
• Let x(n) be an N-sample sequence, where N is a power of 2. Decimate
or break this sequence into two sequences f1(n) and f2(n) of length
N/2, one composed of the even indexed values of x(n) and the other
of odd indexed values of x(n)
Butterfly Diagram
(i) In each computation, two complex numbers a and b are considered.
(ii) The complex number b is multiplied by a phase factor WNk.
(iii) The product bWNk is added to the complex number a to form a new
complex number A.
(iv) The product bWNk is subtracted from complex number a to form
new complex number B.
The signal flow graph is also called butterfly diagram since it resembles
a butterfly
The complete flow graph for 8-point DIT FFT considering periodicity drawn in a
way
to remember easily is shown in Figure 7.8.
Decimation in Frequency (DIF) RADIX-2
FFT
• In decimation in frequency algorithm, the frequency domain sequence X(k) is
decimated. In this algorithm, the N-point time domain sequence is converted to
two numbers of N/2-point sequences.
• Then each N/2-point sequence is converted to two numbers of N/4-point
sequences. This process is continued until we get N/2 numbers of 2-point
sequences.
• Finally, the 2-point DFT of each 2-point sequence is computed. The 2-point DFTs of
N/2 numbers of 2-point sequences will give N-samples, which is the N-point DFT of
the time domain sequence.
• Here the equations for N/2-point sequences, N/4-point sequences, etc., are
obtained by decimation of frequency domain sequences. Hence this method is
called DIF.
• To derive the decimation-in-frequency form of the FFT algorithm for
N, a power of 2, we can first divide the given input sequence x(n) =
{x(0), x(1), x(2), x(3), x(4), x(5), x(6), x(7)} into the first half and last
half of the points so that its DFT X(k) is
• It is important to observe that while the above equation for X(k)
contains two summations over N/2 points.

Fast Fourier Transform (FFT)

Uploaded by

Copyright:

Available Formats

Fast Fourier Transform (FFT)

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Fast Fourier Transform (FFT)

Uploaded by

Copyright:

Available Formats

FAST FOURIER

• Let WN be the complex valued phase factor, which is an Nth root of

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.