期刊名称：International Journal of Advanced Computer Research
印刷版ISSN：2249-7277
电子版ISSN：2277-7970
出版年度：2013
卷号：3
期号：10
页码：72-78
出版社：Association of Computer Communication Education for National Triumph (ACCENT)
摘要：Discrete Fourier Transform is principal mathematical method for the frequency analysis and is having wide applications in Engineering and Sciences. Because the DFT is so ubiquitous, fast methods for computing DFT have been studied extensively, and continuous to be an active research. 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) [1] and the other one is the Grigoryan FFT based on the splitting by the paired transform [2]. We evaluate the performance of these algorithms by implementing them on the Xilinx Virtex-4 FPGAs [3], by developing our own FFT processor architectures. Finally we show that the Grigoryan FFT is working faster than Cooley-Tukey FFT, consequently it is useful for higher sampling rates. Operating at higher sampling rates is a challenge in DSP applications.
关键词：Frequency analysis; fast algorithms; DFT; FFT; paired transforms.
Loading...
