These operations on digitally sampled data are efficiently carried out with the Discrete Fourier Transform (DFT), and in particular with a fast version of the DFT called the Fast Fourier Transform ...

This implies that the Fourier transform, as it is, is not suitable for the processing of discrete-time signals in digital computers. As a consequence of (3.1), we need a transform depending on a ...

Tasche (Rostock), Zentralblatt fur Mathematik "The fast Fourier transform (FFT) is one of the truly great computational developments. As the author emphasizes in the preface, the central feature of ...