Education For All

Text size
  • Increase font size
  • Default font size
  • Decrease font size

Lectures (Video)

Course Home

Fourier Transform and its Applications - Lecture 22

Get the Flash Player to view video.
Lecture 22 - FFT Algorithm

FFT Algorithm: Setup: DFT Matrix Notation, One Intuition Behind FFT: Factoring Matrix, Our Approach: Split Order N Into Two Order N/2, Iterate, Notation (To Keep Track Of Powers Of Complex Exponentials), Plugging New Notation Into DFT; Split Into Even And Odd Indices, Result For Indices 0 To N/2-1, Result For Indices N/2 To N-1, Summary Of Results (DFT As Combination Of 2 Half Order Dfts)

Prof. Brad G Osgood
The Fourier Transform and its Applications EE261
(Stanford University: Stanford Engineering Everywhere)
Date accessed: 2009-09-24
License: Creative Commons Attribution 3.0

Lecture Material

Not Available.



Chinese (Simplified) French German Italian Japanese Korean Portuguese Russian Spanish
More educational resources: