Skip to main content

Fast Fourier Transform

Fast Fourier Transform

Just like DFT, FFT is also used to find the frequency representation of a discrete time signal.
The result of FFT is same as that of DFT. But FFT is computationally fast as it uses Cooley and Tuckey's algorithm to find the result. FFT does parallel processing of the input sequence as it decomposes an N point sequence into two sequences i.e. even and odd signals.

 In this experiment, FFT of 4 point and 8 point signals was calculated using DITFFT. Comparison of no. of complex addition and multiplications as well as real addition and multiplications required to calculate FFT and DFT prove that FFT is fast.
  

Comments

  1. Chaitanya S26 April 2017 at 07:28

    Good explanation

    ReplyDelete
  2. Unknown26 April 2017 at 07:58

    Adopting fast methods is essential for systems

    ReplyDelete
  3. Unknown26 April 2017 at 08:11

    FFT enhances fast large integer and polynomial multiplication

    ReplyDelete
  4. Unknown26 April 2017 at 10:48

    FFT of radix 2 divides the input into two N/2 pt DFT's. Similarly N/2 is divided into two N/4 sequences, decreasing the computations required, making it faster.

    ReplyDelete
  5. Nobody26 April 2017 at 11:22

    The two types of FFT : 1) DITFFT
    2)DIFFFT are equally efficient.

    ReplyDelete

Post a Comment

Popular posts from this blog

Chebyshev Filter Design

Chebyshev Filter Design Having designed a filter by Butterworth design method previously, designing filter by Chebyshev Method requires calculation of a lot more parameters than butterworth method. We designed Chebyshev 1 filter and simulated its magnitude and frequency response using Scilab .  The order of the filter and the Transfer Function were calculated after entering the values of various parameters like : Pass band Attenuation (Ap), Stop Band Attenuation (As), Passband frequency, Stopband frequency. The obtained frequency response was very close to the ideal response. From the obtained characteristics, we verified that, for a Chebyshev 1 filter Pass band : Equiripple Stop band: monotonic No ripples in Passband Lesser transition width, slow roll-off at high frequencies Scilab simulation software made the process of computing Transfer Function of higher order filters and plotting the magnitude and frequency response easier and efficient.    ...
3 comments
Read more