Knowledge-based FFT and convolution synthesis for any number of points
- 1 October 1989
- journal article
- Published by Elsevier in Mathematics and Computers in Simulation
- Vol. 31 (4-5) , 441-451
- https://doi.org/10.1016/0378-4754(89)90138-9
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Research on Knowledge-Based Software Environments at Kestrel InstituteIEEE Transactions on Software Engineering, 1985
- The design of optimal DFT algorithms using dynamic programmingIEEE Transactions on Acoustics, Speech, and Signal Processing, 1983
- Computation of Convolutions and Discrete Fourier Transforms by Polynomial TransformsIBM Journal of Research and Development, 1978
- On computing the discrete Fourier transformMathematics of Computation, 1978
- New algorithms for digital convolutionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- A prime factor FFT algorithm using high-speed convolutionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- 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
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965
- The Interaction Algorithm and Practical Fourier AnalysisJournal of the Royal Statistical Society Series B: Statistical Methodology, 1958