NASA NTRS · 19780020178
A new hybrid algorithm for computing a fast discrete Fourier transform
Abstract
For certain long transform lengths, Winograd's algorithm for computing the discrete Fourier transform is extended considerably. This is accomplished by performing the cyclic convolution, required by Winograd's method, with the Mersenne-prime number theoretic transform. This new algorithm requires fewer multiplications than either the standard fast Fourier transform or Winograd's more conventional algorithm.
Keep this discovery
Explore connections, maps & timelines
Reed, I. S., Truong, T. K.. 1978-06-15. A new hybrid algorithm for computing a fast discrete Fourier transform. https://searchnasa.com/record/nasa%3A19780020178/a-new-hybrid-algorithm-for-computing-a-fast-discrete-fourier-transform
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.