Lecture 21: Review Of Basic DFT Definitions

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

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.


It looked like this. You have a Discrete signal. So I'm using both the signal notation and vector notation here, and I'll continue to do that, sort of mix the two up, because I think they're both useful. So the idea is you have either an N-tuple of numbers or a Discrete signal whose value at the nth point is just the value here, FM. Okay? Oops, that doesn't look right. That's not much of a statement. So you can either consider it as a Discrete signal who's defined on the integers or the integers from zero to N minus one, or you can think of it as an N-tuple or as a vector. ...

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

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: