On computing the split-radix FFT
- 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
- https://doi.org/10.1109/tassp.1986.1164804
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Implementation of "Split-radix" FFT algorithms for complex, real, and real symmetric dataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Multiply/Add tradeoffs in length-2>sup/sup<FFT algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- 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
- Existence of a 2n FFT algorithm with a number of multiplications lower than 2n+1Electronics Letters, 1984
- An in-place, in-order prime factor FFT algorithmIEEE Transactions on Acoustics, Speech, and Signal Processing, 1981
- 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 transformPublished by Association for Computing Machinery (ACM) ,1968