Flexibility in the length of convolutions computed using Fourier-like fast transform algorithms
- 1 January 1980
- journal article
- Published by Elsevier in Signal Processing
- Vol. 2 (1) , 31-38
- https://doi.org/10.1016/0165-1684(80)90060-2
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Multidimensional fast-Fourier-transform algorithmElectronics Letters, 1979
- Efficient transforms for multidimensional convolutionsElectronics Letters, 1979
- 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
- Digital filtering using polynomial transformsElectronics Letters, 1977
- On computing the Discrete Fourier TransformProceedings of the National Academy of Sciences, 1976
- Fast Convolution using fermat number transforms with applications to digital filteringIEEE Transactions on Acoustics, Speech, and Signal Processing, 1974
- The fast Fourier transform in a finite fieldMathematics of Computation, 1971
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965