This preview shows page 1. Sign up to view the full content.
Unformatted text preview: X C ( j Ω ) which are separated by 100 Hz. N = 10 5 Hz 100 Hz/bin = 1000 bins 3. Consider computing an N = 500 point FFT. Give the name of an efficient algorithm to use for this, the number of stages it will have, and the radix used in each stage. Name: CooleyTukey Factored N . Number of stages: 5 Stage radii: (5) (5) (5) (2) (2) in any order. you would use, how many stages it would have, and the radix used for each stage. x [0] x [1] x [2] x [3] X [0] X [1] X [2] X [3] j e e W j j − = = = − − 2 4 2 9 ) 3 )( 3 ( 4 π1 j j 1 1 1 j...
View
Full
Document
This note was uploaded on 03/16/2012 for the course ECEN 487 taught by Professor Dr.brianjeffs during the Winter '12 term at BYU.
 Winter '12
 Dr.BrianJeffs

Click to edit the document details