The effect of the field of constants on the number of multiplications

@article{Winograd1975TheEO,
  title={The effect of the field of constants on the number of multiplications},
  author={S. Winograd},
  journal={16th Annual Symposium on Foundations of Computer Science (sfcs 1975)},
  year={1975},
  pages={1-2}
}
  • S. Winograd
  • Published 1975
  • Mathematics, Computer Science
  • 16th Annual Symposium on Foundations of Computer Science (sfcs 1975)
New algorithms for computing the Discrete Fourier Transform of n points are described. For n in the range of a few tens to a few thousands these algorithms use substantially fewer multiplications than the best algorithm previously known, and about the same number of additions. Computing the Discrete Fourier Transform (DFT) of n points: n-1 2vt Aj = wiiai, j ... ,n -1, w= e [1] 
17 Citations

Tables and Topics from this paper

On computing the Discrete Fourier Transform.
  • S. Winograd
  • Mathematics, Medicine
  • Proceedings of the National Academy of Sciences of the United States of America
  • 1976
  • 685
  • PDF
On the number of active *-operations needed to compute the discrete Fourier transform
  • B. Mescheder
  • Mathematics, Computer Science
  • Acta Informatica
  • 2004
  • 2
Faster fourier transformation: The algorithm of S. Winograd
  • 2
  • PDF
Winograd's Discrete Fourier Transform Algorithm
  • 6
Rectangular Transforms for Digital Convolution on the Research Signal Processor
  • J. Cooley
  • Computer Science
  • IBM J. Res. Dev.
  • 1982
  • 3
Complexity of combinatorial algorithms
  • 52
...
1
2
...

References

SHOWING 1-10 OF 13 REFERENCES
METHODS OF COMPUTING VALUES OF POLYNOMIALS
  • 101
ZALCSTEIN, Algebras Having Linear Multiplicative Complexities
  • Technical Report 46, Dept. of Computer Science,
  • 1975
TOOM, "The complexity of a scheme of functional elements simulating the multiplication of integers,
  • Dokl Akad. Nauk SSSR, v
  • 1963
TUKEY, "An algorithm for the machine calculation of complex
  • Fourier series," Math. Comp., v
  • 1965
The complexity of a scheme of functional elements simulating the multiplication of integers
  • Dokl Akad. Nauk SSSR
  • 1963
  • 1958
GOOD, "The interaction of algorithm and practical Fourier series,"
  • Roy. Statist. Soc. Ser. B, v
  • 1958
...
1
2
...