Lecture 22: FFT Algorithm: Setup: DFT Matrix Notation

author: Brad G. Osgood, Computer Science Department, Stanford University
published: May 21, 2010,   recorded: September 2007,   views: 4901
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

Now, what this means in particular, I have to give you a little caution on this, is that there’s sort of one more general topic on this fast Fourier transform that I would ordinarily talk about and that is convolution, circular convolution, so I’m not going to do that. I will leave that up to you to read. There’s not much. There wouldn’t be much to do other than talk about the formulas and basic applications. The applications we’ll do in the context of linear systems coming up, so you’ll see some of that later. ...

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

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: