International Association of Computer Science & Information Technology (IACSIT)
Frequency analysis plays vital role in the applications like cryptanalysis, steganalysis, system identification, controller tuning, speech recognition, noise filters, etc. Discrete Fourier Transform (DFT) is a principal mathematical method for the frequency analysis. The way of splitting the DFT gives out various fast algorithms. In this paper, the authors present the implementation of two fast algorithms for the DFT for evaluating their performance. One of them is the popular radix-2 cooley-tukey Fast Fourier Transform algorithm (FFT) and the other one is the Grigoryan FFT based on the splitting by the paired transform.