2001•IEEE Signal Processing LettersRequires access

An extended split-radix FFT algorithm

Daisuke Takahashi

Abstract

An extended split-radix fast Fourier transform (FFT) algorithm is proposed. The extended split-radix FFT algorithm has the same asymptotic arithmetic complexity as the conventional split-radix FFT algorithm. Moreover, this algorithm has the advantage of fewer loads and stores than either the conventional split-radix FFT algorithm or the radix-4 FFT algorithm.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 87 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

Key concepts: Fast Fourier transform, Split-radix FFT algorithm, Prime-factor FFT algorithm, Rader's FFT algorithm, Radix (gastropod), Twiddle factor, Algorithm, Cooley–Tukey FFT algorithm