On the number of multiplications necessary to compute a length-2nDFT
- 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) , 91-95
- https://doi.org/10.1109/tassp.1986.1164785
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Signal processing and complexity of computationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Existence of a 2
n
FFT algorithm with a number of multiplications lower than 2
n
+1
Electronics Letters, 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
- Application of Complexity of Computations to Signal ProcessingPublished by Springer Nature ,1981
- On the number of active *-operations needed to compute the discrete Fourier transformActa Informatica, 1980
- Arithmetic Complexity of ComputationsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1980
- On the multiplicative complexity of the Discrete Fourier TransformAdvances in Mathematics, 1979
- On Computing the Discrete Fourier TransformMathematics of Computation, 1978
- On computing the Discrete Fourier TransformProceedings of the National Academy of Sciences, 1976