| (4 intermediate revisions by one other user not shown) | |||
| Line 3: | Line 3: | ||
Due in class, Friday October 15, 2010. | Due in class, Friday October 15, 2010. | ||
| − | The discussion page for this homework is [[ | + | The discussion page for this homework is [[Hw6ECE438_discussion|here]]. Feel free to share your answers/thoughts/questions on [[Hw6ECE438_discussion|that page]]. |
---- | ---- | ||
| Line 11: | Line 11: | ||
Consider the signal | Consider the signal | ||
| − | < | + | <math>x[n]=\cos \left( \omega_1 n \right)+ k \cos \left( \omega_2 n \right) </math> |
| − | where k is a real valued constant. | + | where k is a real-valued constant. |
a) Write a program that will | a) Write a program that will | ||
| Line 25: | Line 25: | ||
b) Run your program and generate outputs for the cases shown below. | b) Run your program and generate outputs for the cases shown below. | ||
| − | {| width="200" border="1" cellpadding=" | + | {| width="200" border="1" cellpadding="5" cellspacing="1" |
|- | |- | ||
! scope="col" | Case | ! scope="col" | Case | ||
| Line 35: | Line 35: | ||
| 1 | | 1 | ||
| 20 | | 20 | ||
| − | | | + | | 0.62831853 |
| | | | ||
| | | | ||
| Line 41: | Line 41: | ||
| 2 | | 2 | ||
| 200 | | 200 | ||
| − | | | + | | 0.62831853 |
| − | | | + | | 0 |
| − | | | + | | N/A |
|- | |- | ||
| 3 | | 3 | ||
| 20 | | 20 | ||
| − | | | + | | 0.64402649 |
| − | | | + | | 0 |
| − | | | + | | N/A |
|- | |- | ||
| 4 | | 4 | ||
| 200 | | 200 | ||
| − | | | + | | 0.64402649 |
| − | | | + | | 0 |
| − | | | + | | N/A |
|- | |- | ||
| 5 | | 5 | ||
| 200 | | 200 | ||
| − | | | + | | 0.64402649 |
| − | | | + | | 0.2 |
| − | | | + | | 1.27234502 |
|- | |- | ||
| 6 | | 6 | ||
| 200 | | 200 | ||
| − | | | + | | 0.64402649 |
| − | | | + | | 0.2 |
| − | | | + | | 0.79168135 |
|} | |} | ||
<br> | <br> | ||
| − | + | ||
| − | + | ||
| − | + | ||
---- | ---- | ||
== Question 2 == | == Question 2 == | ||
| + | Draw a complete flow diagram for a decimation-in-time FFT algorithm for an 8 point FFT. How many complex operations does your algorithm take? How many operations would this DFT computation take if you were using the summation formula (i.e., the definition of the DFT) instead? | ||
---- | ---- | ||
== Question 3 == | == Question 3 == | ||
| + | a) Draw a complete flow diagram for a decimation-in-time FFT algorithm for an 6 point FFT beginning with two three-point DFTs. How many complex operations does your algorithm take? How many operations would this DFT computation take if you were using the summation formula (i.e., the definition of the DFT) instead? | ||
| + | b) Draw a complete flow diagram for a decimation-in-time FFT algorithm for an 6 point FFT beginning with three two-point DFTs. How many complex operations does your algorithm take? Compare with your answers in part a). | ||
---- | ---- | ||
| + | == Question 4 == | ||
| + | You want to exactly compute an exact 5120-point DFT. You have a radix 2 FFT subroutine that computes the DFT for <math>N=2^M</math> points for any integer value of M. | ||
| + | |||
| + | a) Show how to use this subroutine to efficiently compute a 5120-point DFT. | ||
| + | b) Draw a block diagram for your algorithm, showing the radix 2 FFT subroutine as a black box with no detail regarding what is inside it. | ||
| + | |||
| + | c) Calculate the approximate number of complex operations required to compute the 5120-point DFT using your efficient approach, and compare with the | ||
| + | number of complex operations required to compute the 5120-point DFT directly. | ||
| + | ---- | ||
| + | == Question 5 == | ||
| + | Under which circumstances can one explicitly reconstruct the DTFT of a finite duration signal from its DFT? Explain. | ||
| + | ---- | ||
| + | == Question 6 == | ||
| + | Obtain the "Duality property" for the DFT. | ||
| + | ---- | ||
| + | == Question 7 == | ||
| + | Are the following systems LTI? Answer yes/no and prove your answer. | ||
| + | |||
| + | a) y[n]= x[n+1]+x[n-1] | ||
| + | |||
| + | b) y[n]= x[n-1]+x[1-n] | ||
| + | |||
| + | c) y[n]= x[n]* (u[n+3]-u[n-3]) ('*' means convolution) | ||
| + | ---- | ||
[[2010 Fall ECE 438 Boutin|Back to ECE438, Fall 2010, Prof. Boutin]] | [[2010 Fall ECE 438 Boutin|Back to ECE438, Fall 2010, Prof. Boutin]] | ||
Latest revision as of 10:29, 20 October 2010
Contents
Homework 6, ECE438, Fall 2010, Prof. Boutin
Due in class, Friday October 15, 2010.
The discussion page for this homework is here. Feel free to share your answers/thoughts/questions on that page.
Question 1
Consider the signal
$ x[n]=\cos \left( \omega_1 n \right)+ k \cos \left( \omega_2 n \right) $
where k is a real-valued constant.
a) Write a program that will
- Plot x[n].
- Compute the N point DFT X[k]. (Yes, you may use FFT routines.)
- Plot the magnitude of X[k].
Turn in a print out of your code.
b) Run your program and generate outputs for the cases shown below.
| Case | N | $ \omega_1 $ | k | $ \omega_2 $ |
|---|---|---|---|---|
| 1 | 20 | 0.62831853 | ||
| 2 | 200 | 0.62831853 | 0 | N/A |
| 3 | 20 | 0.64402649 | 0 | N/A |
| 4 | 200 | 0.64402649 | 0 | N/A |
| 5 | 200 | 0.64402649 | 0.2 | 1.27234502 |
| 6 | 200 | 0.64402649 | 0.2 | 0.79168135 |
Question 2
Draw a complete flow diagram for a decimation-in-time FFT algorithm for an 8 point FFT. How many complex operations does your algorithm take? How many operations would this DFT computation take if you were using the summation formula (i.e., the definition of the DFT) instead?
Question 3
a) Draw a complete flow diagram for a decimation-in-time FFT algorithm for an 6 point FFT beginning with two three-point DFTs. How many complex operations does your algorithm take? How many operations would this DFT computation take if you were using the summation formula (i.e., the definition of the DFT) instead?
b) Draw a complete flow diagram for a decimation-in-time FFT algorithm for an 6 point FFT beginning with three two-point DFTs. How many complex operations does your algorithm take? Compare with your answers in part a).
Question 4
You want to exactly compute an exact 5120-point DFT. You have a radix 2 FFT subroutine that computes the DFT for $ N=2^M $ points for any integer value of M.
a) Show how to use this subroutine to efficiently compute a 5120-point DFT.
b) Draw a block diagram for your algorithm, showing the radix 2 FFT subroutine as a black box with no detail regarding what is inside it.
c) Calculate the approximate number of complex operations required to compute the 5120-point DFT using your efficient approach, and compare with the number of complex operations required to compute the 5120-point DFT directly.
Question 5
Under which circumstances can one explicitly reconstruct the DTFT of a finite duration signal from its DFT? Explain.
Question 6
Obtain the "Duality property" for the DFT.
Question 7
Are the following systems LTI? Answer yes/no and prove your answer.
a) y[n]= x[n+1]+x[n-1]
b) y[n]= x[n-1]+x[1-n]
c) y[n]= x[n]* (u[n+3]-u[n-3]) ('*' means convolution)
