articleTop 1% cited
‘Split radix’ FFT algorithm
Electronics Letters · 1984 · Vol. 20(1) · pp. 14–16
Abstract
A new N = 2n fast Fourier transform algorithm is presented, which has fewer multiplications and additions than radix 2n, n = 1, 2, 3 algorithms, has the same number of multiplications as the Raderi-Brenner algorithm, but much fewer additions, and is numerically better conditioned, and is performed ‘in place’ by a repetitive use of a ‘butterfly’-type structure.
Digital Filter Design and ImplementationImage and Signal Denoising MethodsNumerical Methods and AlgorithmsFast Fourier transformRadix (gastropod)AlgorithmSplit-radix FFT algorithmArithmeticPrime-factor FFT algorithmComputer scienceRader's FFT algorithmMathematicsFourier transform
Citations
417
FWCI
11.51
field-weighted impact
References
8
Percentile
99%
vs. same field & year
Citations per year
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.