FFT

The third experiment was of Fast Fourier Transform. A discrete signal with length of 4 was taken as the input i.e. x(k).We entered the values of real and imaginary part of x(k) and got x(n) using FFT. Also by the given formulae’s we got the following:[1] total complex multiplication [2] total real multiplication [3] total complex addition and [4] total real addition.We observed that from the perspective of arithmetic computations the number of arithmetic calculations is less than in DFT. Also due to parallel calculations FFT is faster than DFT.

codes:

https://drive.google.com/open?id=0BxpSA0zcKUVjaTNvbzdERDVRMFE

https://drive.google.com/open?id=0BxpSA0zcKUVjOXVIaTNIM2Yzbmc