Scribd Logo
Upload

Welcome to Scribd!

  • 6 views

    Fast Fourier Transform (FFT) : - FFT Algorithm Efficiently Computes DFT

    Uploaded by

    memasaad
    The FFT algorithm computes the discrete Fourier transform (DFT) more efficiently than direct computation. It reduces the complexity from O(N^2) to O(NlogN) by exploiting symmetry and periodicity properties. The FFT decomposes the DFT of a sequence of length N into successively smaller DFTs of length N/2, N/4, etc. using either a decimation-in-time (DIT) or decimation-in-frequency (DIF) approach. DIT breaks the time sequence into even and odd subsequences at each stage, while DIF breaks the frequency coefficients into smaller sets.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPTX, PDF, TXT or read online from Scribd

    Fast Fourier Transform (FFT) : - FFT Algorithm Efficiently Computes DFT

    Uploaded by

    memasaad
    6 views23 pages
    The FFT algorithm computes the discrete Fourier transform (DFT) more efficiently than direct computation. It reduces the complexity from O(N^2) to O(NlogN) by exploiting symmetry and periodicity properties. The FFT decomposes the DFT of a sequence of length N into successively smaller DFTs of length N/2, N/4, etc. using either a decimation-in-time (DIT) or decimation-in-frequency (DIF) approach. DIT breaks the time sequence into even and odd subsequences at each stage, while DIF breaks the frequency coefficients into smaller sets.

    Original Title

    FFT (1)

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The FFT algorithm computes the discrete Fourier transform (DFT) more efficiently than direct computation. It reduces the complexity from O(N^2) to O(NlogN) by exploiting symmetry and periodicity properties. The FFT decomposes the DFT of a sequence of length N into successively smaller DFTs of length N/2, N/4, etc. using either a decimation-in-time (DIT) or decimation-in-frequency (DIF) approach. DIT breaks the time sequence into even and odd subsequences at each stage, while DIF breaks the frequency coefficients into smaller sets.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    6 views23 pages

    Fast Fourier Transform (FFT) : - FFT Algorithm Efficiently Computes DFT

    Uploaded by

    memasaad
    The FFT algorithm computes the discrete Fourier transform (DFT) more efficiently than direct computation. It reduces the complexity from O(N^2) to O(NlogN) by exploiting symmetry and periodicity properties. The FFT decomposes the DFT of a sequence of length N into successively smaller DFTs of length N/2, N/4, etc. using either a decimation-in-time (DIT) or decimation-in-frequency (DIF) approach. DIT breaks the time sequence into even and odd subsequences at each stage, while DIF breaks the frequency coefficients into smaller sets.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    You are on page 1of 23

    Fast Fourier Transform (FFT)

    FFT algorithm efficiently computes DFT

    Let WN be the complex valued phase factor

    FFT (contd)
    To compute all N values of DFT N2 complex multiplications and N(N-1) complex additions required The DFT and IDFT involves same type of computations This is primarily inefficient as it does not exploit the symmetry property and periodicity properties of WN (Phase factor)

    The total number of complex multiplications are reduced to N log2N

    FFT (contd)
    If x(n) is a complex valued sequence

    The real and imaginary parts of the above eqn

    In this case 2N2 evaluations of trigonometric functions 4N2 real multiplications, 4N(N-1) real additions

    FFT (contd)

    FFT (contd)
    FFT algorithms based on the fundamental principle of decomposing the DFT of a sequence of length N into successively smaller DFTs The manner in which this is implemented DIT or DIF In the process of arranging DFT into smaller DFTs the time sequence x(n) is decomposed into successively smaller subsequences- Hence DIT If the discrete fourier transform coefficients are X(k) {sequence in frequency domain} are decomposed into smaller subsequences- DIF

    Decimation in Time Algorithm (DIT)


    Let x(n) represent a sequence of N values N is an integer power of 2 ie N=rL (r is the radix of FFT algorithm here 2) Given sequence is decimated (broken) into two N/2 point sequences consisting of Even numbered values of x(n) Odd numbered values of x(n)

    DIT algorithm (contd)

    Substitute n=2r for n even and n=2r+1 for n odd

    DIT algorithm (contd)

    where G(k) and H(k) are the N/ 2 point DFTs of even and odd numbered sequences Since G(k) and H(k) are considered periodic with period N/2

    DIT algorithm(contd)

    Flow graph first stage DIT algorithm for N=8

    DIT algorithm (contd)

    DIT algorithm (contd)

    Hence the previous signal flow graph can also be represented as


    He

    DIT algorithm (contd)


    Above process is continued by expressing each of the two N/2 point DFTs G(K) and H(k) as combination of two N/4 point DFTs

    DIT algorithm (contd)

    DIT algorithm (contd)

    Stage 2 and Stage 3 of FFT signal flow graph can also be represented as

    DIT algorithm (contd)

    DIT algorithm (contd)

    DIT algorithm (contd)

    DIT algorithm (contd)

    DIT algorithm (contd)

    DFT of a sequence
    x(n)={1,2,3,4,4,3,2,1}

    DFT of a sequence

    You might also like

    pFad - Phonifier reborn

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

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy