Lecture 20: Review: Definition Of The DFT

author: Brad G. Osgood, Computer Science Department, Stanford University
published: May 21, 2010,   recorded: September 2007,   views: 217
released under terms of: Creative Commons Attribution Non-Commercial (CC-BY-NC)
Categories

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Bibliography

Description

And it’s defined by its nth component, so the nth component of the Fourier transform is the sum from say N equals zero to N minus one of the Nth component of F times E to the minus two pi I N M over N. All right? So everything is defined here in terms of the indices in the exponential, and these are the values of the discrete function at the index points, F of zero, F of one, F of two and so on. That’s the definition. They say you don’t see at all the fact that in our derivation this came from starting with a continuous signal, sampling it, sampling the Fourier transform, and then somehow ultimately leading to this definition. Here it’s just as an operation on one discrete signal producing another discrete signal. ...

See the whole transcript at The Fourier Transform and its Applications - Lecture 20

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: