On computing the Discrete Fourier Transform
AUTOR(ES)
Winograd, Shmuel
RESUMO
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.
ACESSO AO ARTIGO
http://www.pubmedcentral.nih.gov/articlerender.fcgi?artid=430186Documentos Relacionados
- A fast algorithm for computing the Hartley/ Fourier spectrum
- Fourier-Transform Raman and Fourier-Transform Infrared Spectroscopy (An Investigation of Five Higher Plant Cell Walls and Their Components).
- A discrete Fourier analysis for evolutionary trees.
- Discrete and integral fourier transforms: analytical examples.
- Real-time premature ventricular contractions detection based on Redundant Discrete Wavelet Transform
