Multiply/Add tradeoffs in length-2>sup/sup<FFT algorithms
- 23 March 2005
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 10, 780-783
- https://doi.org/10.1109/icassp.1985.1168331
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- 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
- Very fast computation of the radix-2 discrete Fourier transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1982
- On the number of active *-operations needed to compute the discrete Fourier transformActa Informatica, 1980
- Optimality of the Fast Fourier transformJournal of the ACM, 1979
- z-transform DFT filters and FFT'sIEEE Transactions on Acoustics, Speech, and Signal Processing, 1978
- The Linear Complexity of ComputationJournal of the ACM, 1975
- Note on a Lower Bound on the Linear Complexity of the Fast Fourier TransformJournal of the ACM, 1973