Bounds on the minimum number of data transfers in WFTA and FFT programs
- 1 August 1979
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 27 (4) , 394-398
- https://doi.org/10.1109/tassp.1979.1163272
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A comparative study of time efficient FFT and WFTA programs for general purpose computersIEEE Transactions on Acoustics, Speech, and Signal Processing, 1978
- On Computing the Discrete Fourier TransformMathematics of Computation, 1978
- A prime factor FFT algorithm using high-speed convolutionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- An introduction to programming the Winograd Fourier transform algorithm (WFTA)IEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- Automatic generation of time efficient digital signal processing softwareIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- On computing the Discrete Fourier TransformProceedings of the National Academy of Sciences, 1976