Fast Fourier Transform ( FFT ) is used instead of Discrete Fourier Transform as the number of calculations required are less in FFT which in turn increases the speed of processor. This is because the signal is divided into two parts and computations are carried out only for N/2 signal values which reduces the calculations.
FFT of a 4 pt sequence and an 8 pt sequence were calculated. It was observed that the first value was the sum of all the values of the input. Later a counter was used in the code to count the number of calculations required.
FFT of a 4 pt sequence and an 8 pt sequence were calculated. It was observed that the first value was the sum of all the values of the input. Later a counter was used in the code to count the number of calculations required.
Informative..
ReplyDelete