Friday, 22 April 2016

EXP 3: FAST FOURIER TRANSFORM

Fast Fourier Transform and Inverse Fast Fourier Transform by implementing it in C language. We took an input signal of length 4. FFT was performed on signal of length 4 and then IFFT was performed. FFT is preferred over DFT because it has less complexity and performs less no. of complex additions and multiplications.

https://drive.google.com/open?id=0Bzfvoo_rjoa8X2lZT3BQYWIyalE
https://drive.google.com/open?id=0Bzfvoo_rjoa8ZV8wekt4NmV3OFE
Posted by at

3 comments:

  1. Unknown25 April 2016 at 11:09

    Number of computations required are less, thus speed increases. Parallel processing is used in FFT

    ReplyDelete
  2. Unknown25 April 2016 at 21:12

    FFT is useful for long signals, but fails for shorter ones, since it just increases the computations for smaller signals.

    ReplyDelete
  3. Mesi25 April 2016 at 22:39

    yes the number of complex multiplications and additions are reduced

    ReplyDelete

Subscribe to: Post Comments (Atom)