On computing the split-radix FFT
Authors:
- H. SorensenHSH. Sorensen
- M. HeidemanMHM. Heideman
- C. BurrusCBC. Burrus
- 1 February 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 34 (1) , 152-156
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Existence of a 2
n
FFT algorithm with a number of multiplications lower than 2
n
+1
Electronics Letters, 1984
- Simple FFT and DCT algorithms with reduced number of operationsSignal Processing, 1984
- Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1984
- ‘Split radix’ FFT algorithmElectronics Letters, 1984
- An in-place, in-order prime factor FFT algorithmIEEE Transactions on Acoustics, Speech, and Signal Processing, 1981
- Arithmetic Complexity of Computations1980
- On the multiplicative complexity of the Discrete Fourier TransformAdvances in Mathematics, 1979
- On Computing the Discrete Fourier TransformMathematics of Computation, 1978
- An economical method for calculating the discrete Fourier transform1968
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965