Performance Evaluations of Grigoryan FFT and Cooley-Tukey FFT Onto Xilinx Virtex-II Pro and Virtex-5 FPGAs

Provided by: International Journal of Scientific and Research Publication (IJSRP)
Topic: Hardware
Format: PDF
In the recent decades, fast orthogonal transforms have been widely used in areas of data compression, pattern recognition, image reconstruction, interpolation, linear filtering and spectral analysis. The suitability of unitary transforms in each of the above applications depends on the properties of their basis functions as well as on the existence of fast algorithms, including parallel ones. Since the introduction of the Fast Fourier Transform (FFT), Fourier analysis has become one of the most frequently used tool in signal/image processing and communication systems; the main problem when calculating the transform relates to construction of the decomposition, namely, the transition to the short DFT's with minimal computational complexity.

Find By Topic