Fast Fourier Transform
I performed this experiment using c programming language in which I implemented the code to perform fast Fourier transform by using the butterfly structure of solving a discrete time signal in which we decompose the n point signal into smaller signals for faster speed of calculation. Using the formula for complex and real addition and multiplication I verified that indeed lesser calculations are required. On discussion with Prof Talele, he asked me to implement the code to find the correlation coefficient of two input signals and take one more case with different values of the input signal. On the basis of values of Pearson’s Coefficient the degree of similarity of input signals was found out. The degree of similarity is approximately 1 for highly similar signals and approximately 0 for highly dissimilar signals.
Fast Fourier Transform is an efficient method to perform fourier transform of any digital input signal.Hence it is used for other digital systems
ReplyDeleteYes, it consumes less memory and also computation is faster
Deletecan we prefer using fft in low memory device?
ReplyDeleteYes, it is preferable. Instead it is very efficient as far as memory is a concern
Deleteis there any other method to implement fft?
ReplyDeleteFor normal fft there are two methods ditfft and diffft. But if you are using it for specific application some alterations are done in the algorithm.
DeleteAll the data should be present at the input if we want to use FFT algorithm.
ReplyDeleteYes it should be
Delete