A COOLEY-TUKEY MODIFIED ALGORITHM IN FAST FOURIER TRANSFORM
Main Article Content
Abstract
We would like to propose a Cooley-Tukey modified al-
gorithm in fast Fourier transform(FFT). Of course, this is a kind of
Cooley-Tukey twiddle factor algorithm and we focused on the choice
of integers. The proposed algorithm is better than existing ones in
speeding up the calculation of the FFT.
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial 3.0 Unported License.