Signal processing and complexity of computation
- 24 March 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5, 94-101
- https://doi.org/10.1109/icassp.1980.1171044
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- New algorithms for digital convolutionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Arithmetic Complexity of ComputationsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1980
- On multiplication in algebraic extension fieldsTheoretical Computer Science, 1979
- On the multiplicative complexity of the Discrete Fourier TransformAdvances in Mathematics, 1979
- On Computing the Discrete Fourier TransformMathematics of Computation, 1978
- Some bilinear forms whose multiplicative complexity depends on the field of constantsTheory of Computing Systems, 1976
- Discrete Fourier transforms when the number of data samples is primeProceedings of the IEEE, 1968