Citation
Abstract
In this article Winograd’s algorithm for computing the discrete Fourier transform (DFT) is extended considerably for certain large transform lengths. This is accomplished by performing the cyclic convolution, required by Winograd’s method, by a fast transform over certain complex integer fields developed previously by the authors. This new algorithm requires fewer multiplications than either the standard fast Fourier transform (FFT) or Winograd’s more conventional algorithm.
Details
- Volume
- 42-43
- Published
- February 15, 1978
- Pages
- 134–140
- File Size
- 492.1 KB