{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

mws_gen_fft_spe_pptfastfourierdevl

# mws_gen_fft_spe_pptfastfourierdevl - Numerical Methods Fast...

This preview shows pages 1–11. Sign up to view the full content.

Numerical Methods Fast Fourier Transform Part: Informal Development of Fast Fourier Transform http://numericalmethods.eng.usf.edu

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
For more details on this topic Go to http://numericalmethods.eng.usf.edu Click on Keyword Click on Fast Fourier Transform
You are free to Share – to copy, distribute, display and perform the work to Remix – to make derivative works

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Under the following conditions Attribution — You must attribute the work in the manner specified by the author or licensor (but not in any way that suggests that they endorse you or your use of the work). Noncommercial — You may not use this work for commercial purposes. Share Alike — If you alter, transform, or build upon this work, you may distribute the resulting work only under the same or similar license to this one.
Chapter 11.05: Informal Development of Fast Fourier Transform Major: All Engineering Majors Authors: Duc Nguyen http://numericalmethods.eng.usf.edu Numerical Methods for STEM undergraduates http://numericalmethods.eng.usf.edu 9/4/2010 5 Lecture # 11

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Informal Development of Fast Fourier Transform Recall the DFT pairs of Equations (20) and (21) of Chapter 11.04 and swapping the indexes , one obtains n k = = = 1 0 2 0 ) ( ~ N k k N w in n e k f C π = = = 1 0 2 0 ~ 1 ) ( N n k N w in n e C N k f π (1) (2) where 1 ,..., 3 , 2 , 1 , 0 , = N k n (3) N i e W π 2 = ( ) 1 2 = = π i N e W hence Let (4) 6 http://numericalmethods.eng.usf.edu