Implementation of 64 point FFT using radix 8 algorithm

The Fast Fourier Transform (FFT) and its inverse (IFFT) are very useful algorithms in signal processing. Radix-8 FFT can accomplish more computing speed than its previous approaches and also achieves cost effective performance with less development time. For fast calculation, Twiddle Factor is introduced in the mathematical operation. The algorithm of radix 8 FFT is formulated depending on the basic approach involved in solving a radix-n FFT. By using radix 2 and Radix 4 algorithms more number of stages are required to design 64 point FFT, whereas the 64 point FFT can be developed by using only 2 stages of radix 8 algorithms which reduces the development time of FFT. The design can be verified using the simulation results.