A COOLEY-TUKEY MODIFIED ALGORITHM IN FAST FOURIER TRANSFORM
Hwajoon Kim, Somchai Lekcharoen
Abstract
Open-access reader
Hwajoon Kim, Somchai Lekcharoen
Abstract
Open-access reader
We would like to propose a Cooley-Tukey modied algorithm 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.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We would like to propose a Cooley-Tukey modied algorithm 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.
Key concepts: Twiddle factor, Fast Fourier transform, Prime-factor FFT algorithm, Cooley–Tukey FFT algorithm, Split-radix FFT algorithm, Mathematics, Rader's FFT algorithm, Algorithm