Comparison of Discrete Fourier Transform and Fast Fourier Transform with Reduced Number of Multiplication and Addition Operations

Abstract

Fast Fourier Transform is an advanced algorithm for computing Discrete Fourier Transform efficiently. Although the results available from the operation of Discrete Fourier Transform (DFT) and Fast Fourier Transform (FFT) are same, but exploiting the periodicity and symmetry property of phase factor Fast Fourier Transform computes the Discrete Fourier Transform using reduced number of multiplication and addition operations. The basic structure used in the operations of Fast Fourier Transform is the Butterfly structure. For the implementation of Fast Fourier Transform the two methods are used such as decimation in time (DIT) and decimation in frequency (DIF). Both the methods give same result but for decimation in time of Fast Fourier Transform bit reversed inputs are applied and for decimation in frequency of Fast Fourier Transform normal order inputs are applied, and the result is reversed again. In this paper, operations for DFT and FFT have been discussed and shown with examples. It is found that generalized formula for FFT have been described same in the books, but the expressions in the intermediate computations for the first decimation and second decimation are different in the various books of Digital Signal Processing. The expressions in the intermediate computation of FFT described in different books are broadly compared in this paper