Fast computation of discrete Fourier transforms using polynomial transforms
- 1 April 1979
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 27 (2) , 169-181
- https://doi.org/10.1109/tassp.1979.1163216
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- A new method for computing DFTPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- 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
- Index mappings for multidimensional formulation of the DFT and 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
- Some bilinear forms whose multiplicative complexity depends on the field of constantsTheory of Computing Systems, 1976
- On computing the Discrete Fourier TransformProceedings of the National Academy of Sciences, 1976
- The Relationship Between Two Fast Fourier TransformsIEEE Transactions on Computers, 1971
- Discrete Fourier transforms when the number of data samples is primeProceedings of the IEEE, 1968