Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 38 (9) , 1504-1511
- https://doi.org/10.1109/29.60070
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Improved Fourier and Hartley transform algorithms: Application to cyclic convolution of real dataIEEE Transactions on Acoustics, Speech, and Signal Processing, 1987
- Implementation of "Split-radix" FFT algorithms for complex, real, and real-symmetric dataIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- Existence of a 2
n
FFT algorithm with a number of multiplications lower than 2
n
+1
Electronics Letters, 1984
- The multiplicative complexity of the Discrete Fourier TransformAdvances in Applied Mathematics, 1984
- The fast Hartley transformProceedings of the IEEE, 1984
- The multiplicative complexity of certain semilinear systems defined by PolynomialsAdvances in Applied Mathematics, 1980
- 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
- Numerical Analysis: A fast fourier transform algorithm for real-valued seriesCommunications of the ACM, 1968
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965