Sunday, 24 April 2016

Fast Fourier Transform

The aim of the experiment is to perform Fast Fourier Transform.
The objective is to develop a program to perform FFT of N point signal.
The input specifications were  Length of Signal N and Signal values.
Fast Fourier Transform reduces the number of computations required as compaired to by DFT.
We take any four-point sequence x[n] and find X[k] using forward FFT. 
In FFT, the number of computation done is in the power of 2 to accelerate computation.

https://drive.google.com/drive/folders/0ByMxeH1FMa8uRUpfRjdlcmZJZ1E
Posted by at

4 comments:

  1. Unknown26 April 2016 at 01:32

    The number of complex multiplications and additions are reduced inFFt

    ReplyDelete
  2. Unknown26 April 2016 at 08:24

    in 1965 Cooley and Tukey developed this algorithm

    ReplyDelete
  3. Unknown26 April 2016 at 08:40

    Total no of complex addition and multiplication ,real addition and multiplication of FFT are less than that of DFT

    ReplyDelete
  4. Unknown26 April 2016 at 13:25

    Magnitude spectrum is periodic.

    ReplyDelete

Subscribe to: Post Comments (Atom)