Indexed metadata
On computing the discrete Fourier transform
S. Winograd
Source record
Source: Crossref
Published: Jan 1, 1978
DOI: 10.1090/s0025-5718-1978-0468306-4
Open original source ↗Source abstract
A new algorithm for computing the Discrete Fourier Transform is described. The algorithm is based on a recent result in complexity theory which enables us to derive efficient algorithms for convolution. These algorithms are then used to obtain the new Discrete Fourier Transform algorithm.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.