Publication
Mathematics of Computation
Paper

On computing the discrete fourier transform

Download paper

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. © 1978 American Mathematical Society.

Date

01 Jan 1978

Publication

Mathematics of Computation

Authors

Topics

Resources

Share