IEEE Signal Processing Letters · 2001 · 86 citations · 5 references
ComputingComputer EngineeringComputer ScienceAlgorithmsParallel ComputingAlgorithm AnalysisDigital Signal ProcessingFourier AnalysisArithmetic Circuit ComplexityDiscrete Fourier TransformFast Fourier TransformFrequency Domain Processing
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.
5