quiz 7 - X C ( j Ω ) which are separated by 100 Hz. N = 10...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
ECEN 487 QUIZ 7 NAME:_________________ 1. Draw the detailed flow diagram for a radix 4 FFT butterfly. Except for multiplies by 1, label all the branch multiply coefficients explicitly. 2. Consider a signal x C ( t ) which is sampled at 100 ksamp/sec to produce discrete-time sequence x [ n ]. You wish to use an FFT to compute frequency values for successive N- sample-long windows of x [ n ]. What should the value of N be so that each frequency bin output X [ k ] represents (spans) 100 Hz of the original x C ( t ) signal? In other words, we want the separation between successive frequency bins X [ k ] and X [ k+ 1] to correspond to frequency samples of
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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: Cooley-Tukey 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.

Ask a homework question - tutors are online