Provided by: International forum of researchers Students and Academician
Date Added: Jun 2013
Fast Fourier Transform (FFT) algorithm is one of the many methods used for the calculation of DFT. But they are preferred due to their increased speed and higher efficiency which arises due to the fact that for the calculation of N-point samples. The FFT core is able to perform an N-point FFT in approximately 2.4N clock cycles. Radix-2 is the fastest method for calculating FFT. Radix-2 algorithms are amongst the one of the large number of FFT algorithms being developed. The design has parameterized the number of samples and the number of the data's bits.