Scribd Logo
Upload

Welcome to Scribd!

  • 133 views

    Dit-Fft With Derivation

    Uploaded by

    tanvi garg
    The document discusses the discrete Fourier transform (DFT) and fast Fourier transform (FFT) algorithms. It explains that FFT is an efficient algorithm for computing the DFT using divide and conquer. FFT decomposes a sequence into its frequency components and is faster than direct DFT computation, with a time complexity of O(NlogN). Some applications of FFT mentioned are image compression, digital signal processing, communication systems, spectral analysis, and mathematics/science domains.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd

    Dit-Fft With Derivation

    Uploaded by

    tanvi garg
    133 views23 pages
    The document discusses the discrete Fourier transform (DFT) and fast Fourier transform (FFT) algorithms. It explains that FFT is an efficient algorithm for computing the DFT using divide and conquer. FFT decomposes a sequence into its frequency components and is faster than direct DFT computation, with a time complexity of O(NlogN). Some applications of FFT mentioned are image compression, digital signal processing, communication systems, spectral analysis, and mathematics/science domains.

    Original Title

    DIT-FFT WITH DERIVATION

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses the discrete Fourier transform (DFT) and fast Fourier transform (FFT) algorithms. It explains that FFT is an efficient algorithm for computing the DFT using divide and conquer. FFT decomposes a sequence into its frequency components and is faster than direct DFT computation, with a time complexity of O(NlogN). Some applications of FFT mentioned are image compression, digital signal processing, communication systems, spectral analysis, and mathematics/science domains.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    133 views23 pages

    Dit-Fft With Derivation

    Uploaded by

    tanvi garg
    The document discusses the discrete Fourier transform (DFT) and fast Fourier transform (FFT) algorithms. It explains that FFT is an efficient algorithm for computing the DFT using divide and conquer. FFT decomposes a sequence into its frequency components and is faster than direct DFT computation, with a time complexity of O(NlogN). Some applications of FFT mentioned are image compression, digital signal processing, communication systems, spectral analysis, and mathematics/science domains.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    You are on page 1of 23

    DIT-FFT WITH DERIVATION

    SUBMITTED TO: PROF. PRADIP TIWARI

    BY: ANUSHKA DOSHI – B025


    TANVI GARG – B028
    INTRODUCTION

    • Fourier analysis converts a signal from its original domain to a representation in


    the frequency domain and vice versa. The DFT is obtained by decomposing
    a sequence of values into components of different frequencies.

    • A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier
    transform (DFT) of a sequence, or its inverse (IDFT). The decimation of the input
    sequence is done in the time domain.
    BIT REVERSAL TECHNIQUE
    ADVANTAGE
    • FFT is an algorithm for computing the DFT. It is faster than the more obvious way of computing the DFT
    according to the formula.
    • The time taken by this algorithm is less because it uses the divide and conquer method
    • We divide our signal into smaller ones, and perform DFT of these smaller signals.
    • At the end we add all the smaller DFT to get actual DFT of the big signal.
    • This gives great benefit asymptotically. So for large values of N, a lot of time is saved. (O(NlogN))

    APPLICATION
    • The fast fourier transform (FFT) is an important technique for image compression, digital signal
    processing and communication especially for application in multiple input multiple output OFDM
    system.
    • It is also used in the Spectral analysis of signals and has various applications in the mathematics and
    science domains.
    • It is used to simplify the mathematical analysis
    APPLICATIONS

    You might also like