discrete Fourier transform

Show Summary Details

Quick Reference

The discrete Fourier transform of a vector x=(x0, x1,…, xn−1) is the vector y=(y0, y1,…, yn−1) obtained by calculating for each k=0, 1,…, n−1 where This involves a large number of calculations, but the number can be reduced by using the fast Fourier transform.

http://www.see.ed.ac.uk/~mjj/dspDemos/EE4/tutDFT.html A discrete Fourier transform tool in which choosing different options from the signal menu illustrates a number of signals and their Fourier transforms.

Subjects: Mathematics.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.