The fast Fourier transform is a mathematical method for transforming a function of time into a function of frequency. Sometimes it is described as transforming from the time domain to the frequency domain. It is very useful for analysis of time-dependent phenomena. These algorithms are very efficient in terms of computations. By using these algorithms, number of arithmetic operations involved in the computation of DFT are greatly reduced.The experiment proved the fact that fast fourier transform involves lesser calculatations and that fast fourier transform has a higher computational efficiency as compared to discrete fourier transform. We developed a function to find the FFT of N point signal.
FFT had independent operations at each stage. This makes it possible to perform parallel processing.
ReplyDeleteThis comment has been removed by the author.
ReplyDeleteI wanna add to it ....with fast processing ...it also reduces the no steps used for doing operations ....this will save the no of cycles if done using dsp processor
ReplyDelete