International Journal of Computer Applications
The Fast Fourier Transform (FFT) and its Inverse Fast Fourier Transform (IFFT) is one of the fundamental operations in the field of Digital Signal Processing (DSP). A Fast Fourier Transform (FFT) is an algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. A Fourier transforms converts time to frequency and vice versa; an FFT rapidly computes such transformations. As a result, FFT are widely used for many applications in engineering, science and mathematics.