Fast Fourier Transform
Fast Fourier Transform (FFT), as the name suggests is faster than DFT since computations in FFT are done parallely. So here the signal is divided into 2 parts, so the computation is carried out only for N/2 signal values.
C language code of DITFFT (Decimation in Time FFT) algorithm was executed for the FFT calculation. In DITFFT, the input is divided as even and odd parts also it is not in order while the output is obtained in order.
FFT has made working in frequency domain computationally feasible in image processing and signal processing because of its application in large integer and polynomial multiplication.
Well written!
ReplyDeleteinformative
ReplyDeleteThanks.
DeleteIs your algorithm strictly for radix 2 FFT?
ReplyDeleteYes, the code we had executed was according to the algorithm of radix 2 FFT.
ReplyDelete