‘Split radix’ FFT algorithm
- 5 January 1984
- journal article
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 20 (1) , 14-16
- https://doi.org/10.1049/el:19840012
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.Keywords
This publication has 2 references indexed in Scilit:
- Fast Fourier Transform and Convolution AlgorithmsPublished by Springer Nature ,1981
- On the multiplicative complexity of the Discrete Fourier TransformAdvances in Mathematics, 1979