2011Korean Journal of MathematicsOpen access

A COOLEY-TUKEY MODIFIED ALGORITHM IN FAST FOURIER TRANSFORM

Hwajoon Kim, Somchai Lekcharoen

Open full text 1 citations

Abstract

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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

Related papers

Back to paper searchBrowse research topicsOriginal source
A COOLEY-TUKEY MODIFIED ALGORITHM IN FAST FOURIER TRANSFORM — Research Paper | ScholarLens