This preview shows page 1. Sign up to view the full content.
Unformatted text preview: EEL3135 Fall 2011 Quiz 5 BJ Trivedi , Christopher Wilson and Mayank Devam Name:__________________________
Quiz A _____ ______________________ UFID:________________ Last First Score: _____/10
Consider the following signal
. In order to compute the 3pt DFT of
the signal we apply the definition for k=0,1,2 where N=3. Calculate the DFT Coefficients as specified
below.
1. (2pt) Calculate the Coefficient X[0] 2. (2pt) Calculate the Coefficient X[1] 3. (2pt) Calculate the Coefficient X[2] 4. (2pt) Short Answer: The limits for summation in calculating the coefficients of the DFT are evaluated
over N frequencies. Sometimes we will have a sequence x[n] with length L, where L < N. In such cases,
what must be done to x[n] to carry out the computation?
Pad the signal with NL zeroes. 5. (2pt) Short Answer: What is the algorithm that can evaluate the DFT reducing the number of
computations needed for N points from 2N2 to
?
FFT. EEL3135 Fall 2011 Quiz 5 BJ Trivedi , Christopher Wilson and Mayank Devam Name:__________________________ _____ ______________________ UFID:________________ Last Quiz B First Score: _____/10
Consider the following signal
. In order to compute the 3pt DFT of
the signal we apply the definition for k=0,1,2 where N=3. Calculate the DFT Coefficients as specified
below.
1. (2pt) Calculate the Coefficient X[0] 2. (2pt) Calculate the Coefficient X[1] 3. (2pt) Calculate the Coefficient X[2] 4. (2pt) Short Answer: The limits for summation in calculating the coefficients of the DFT are evaluated
over N frequencies. Sometimes we will have a sequence x[n] with length L, where L < N. In such cases,
what must be done to x[n] to carry out the computation?
Pad the signal with NL zeroes. 5. (2pt) Short Answer: What is the algorithm that can evaluate the DFT reducing the number of
computations needed for N points from 2N2 to
?
FFT. EEL3135 Fall 2011 Quiz 5 BJ Trivedi , Christopher Wilson and Mayank Devam Name:__________________________
Quiz C _____ ______________________ UFID:________________ Last First Score: _____/10
Consider the following signal
. In order to compute the 3pt DFT of
the signal we apply the definition for k=0,1,2 where N=3. Calculate the DFT Coefficients as specified
below.
1. (2pt) Calculate the Coefficient X[0] 2. (2pt) Calculate the Coefficient X[1] 3. (2pt) Calculate the Coefficient X[2] 4. (2pt) Short Answer: The limits for summation in calculating the coefficients of the DFT are evaluated
over N frequencies. Sometimes we will have a sequence x[n] with lengt h L, where L < N. In such cases,
what must be done to x[n] to carry out the computation?
Pad the signal with NL zeroes. 5. (2pt) Short Answer: What is the algorithm that can evaluate the DFT reducing the number of
computations needed for N points from 2N2 to
?
FFT. ...
View
Full
Document
This note was uploaded on 01/03/2012 for the course EEL 3135 taught by Professor ? during the Fall '08 term at University of Florida.
 Fall '08
 ?

Click to edit the document details