—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, we 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 . We evaluate the performance of these algorithms by implementing them on the TMS320C62x DSP and also on the Virtex-II pro FPGAs. Finally we show that the paired-transform based algorithm of the FFT is faster than the radix-2 FFT, consequently it is useful for higher sampling rates.
—Frequency analysis, fast algorithms, DFT, FFT, paired transforms.
Narayanam Ranganadh is with the Department of Electrical Engineering, The University of Texas at San Antonio (e-mail: firstname.lastname@example.org)
Cite:Narayanam Ranganadh, Parimal A Patel, and Artyom M. Grigoryan, "Case Study of Grigoryan FFT onto FPGAs and DSPs," International Journal of Future Computer and Communication vol. 2, no. 6, pp. 678-681, 2013.