DISCRETE FOURIER TRANSFORM AND FAST FOURIER ALGORITHM*

Abstract

In recent years the fast Fourier transform algorithm for computing discrete Fourier transforms has come into prominence. This  development is basically due to the fact that the computer time is reduced from N 2 to (N/2) log2 N where N is the number of discrete samples. This paper gives an exposition of the discrete Fourier  transform and the fast Fourier transform algorithm program for the calculation of FFT for pulses is also given.