An efficient approach to the computation of fast fourier transform(FFT) by Radix-3 algorithm

In this paper an efficient approach to compute Discrete Fourier Transform (DFT) using Radix-3 algorithm, which is a Fast Fourier Transform (FFT), has been presented. It takes less multiplication than the usual one. The key idea is that matrix formed by different powers of twiddle factor (phase factor) is decomposed into two matrices and it has been shown that it takes less complex multiplications to compute the result than original Cooley-Tukey method. Later, Matlab simulations verifying the calculations have been added to demonstrate the outcome.