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 ...

we notice that such a characterization in the frequency domain depends on the continuous variable ?. This implies that the Fourier transform, as it is, is not suitable for the processing of ...

Hubbard, Computing Reviews 'This comprehensive book contains many examples, problems, notes and hints to the literature ... As the author emphasizes in the preface, the central feature of the FFT is ...