FFT and Inverse FFT was the second experiment of the course. FFT produces same result as DFT but it is fast as compared to DFT due to parallel calculations.
For 4 pt FFT, two stages would be required which are executed using separate array multiplications. Like DFT, real and imaginary part calculations are done separately using two for loops. Finally results are displayed as (real)+j(imaginary part).
We also performed IFFT to verfy our original signal.
https://drive.google.com/open?id=0B2dvoOHjY9tfLUF2UVNtSDIyMHM
FFT is faster than DFT since it decomposes the calculation in small parts and solves them parallaly
ReplyDeleteComputation in FFT varies logarithmically whereas in DFT it varies in direct proportion.
ReplyDeleteFFTs are of great importance to a wide variety of applications, from digital signal processing and solving partial differential equations to algorithms for quick multiplication of large integers.
ReplyDelete