Skip to main content
Proceedings of the National Academy of Sciences of the United States of America logoLink to Proceedings of the National Academy of Sciences of the United States of America
. 1976 Apr;73(4):1005–1006. doi: 10.1073/pnas.73.4.1005

On computing the Discrete Fourier Transform

Shmuel Winograd 1
PMCID: PMC430186  PMID: 16592303

Abstract

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.

Keywords: algorithm, computational complexity

Full text

PDF
1005

Articles from Proceedings of the National Academy of Sciences of the United States of America are provided here courtesy of National Academy of Sciences

RESOURCES