Abelian semi-simple algebras and algorithms for the Discrete Fourier Transform
- 31 March 1984
- journal article
- Published by Elsevier in Advances in Applied Mathematics
- Vol. 5 (1) , 31-55
- https://doi.org/10.1016/0196-8858(84)90003-4
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- The multiplicative complexity of the Discrete Fourier TransformAdvances in Applied Mathematics, 1984
- Fast computation of discrete Fourier transforms using polynomial transformsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1979
- Is computing with the finite Fourier transform pure or applied mathematics?Bulletin of the American Mathematical Society, 1979
- On computing the discrete Fourier transformMathematics of Computation, 1978
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965