Open AccessOn computing the Discrete Fourier Transform
Author(s) -
S. Winograd
Publication year - 1976
Publication title -
proceedings of the national academy of sciences of the united states of america
Language(s) - English
Resource type - Journals
eISSN - 1091-6490
pISSN - 0027-8424
DOI - 10.1073/pnas.73.4.1005
Subject(s) - discrete fourier transform (general) , range (aeronautics) , fourier transform , discrete hartley transform , discrete sine transform , discrete time fourier transform , non uniform discrete fourier transform , computer science , fast fourier transform , algorithm , cyclotomic fast fourier transform , fourier analysis , mathematics , fractional fourier transform , mathematical analysis , materials science , composite material
New algorithms for computing the Discrete Fourier Transform ofn points are described. Forn 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.