EECS 16A Designing Information Devices and Systems I Spring 2016 Elad Alon, Babak Ayazifar Final. Exam location: Solutions

Similar documents
EECS 16A Designing Information Devices and Systems I Spring 2016 Elad Alon, Babak Ayazifar Final. Exam location: RSF Back Left, last SID# 1, 4, + 5

Designing Information Devices and Systems I Fall 2015 Anant Sahai, Ali Niknejad Final Exam. Exam location: RSF Fieldhouse, Back Left, last SID 6, 8, 9

Designing Information Devices and Systems I Fall 2016 Babak Ayazifar, Vladimir Stojanovic Final Exam

Designing Information Devices and Systems I Spring 2016 Elad Alon, Babak Ayazifar Midterm 2. Exam location: 145 Dwinelle, last SID# 2

Designing Information Devices and Systems II Spring 2016 Anant Sahai and Michel Maharbiz Midterm 1. Exam location: 1 Pimentel (Odd SID + 61C)

Designing Information Devices and Systems I Fall 2015 Anant Sahai, Ali Niknejad Final Exam. Exam location: You re Done!!

Designing Information Devices and Systems II Spring 2016 Anant Sahai and Michel Maharbiz Midterm 2

Designing Information Devices and Systems I Spring 2017 Babak Ayazifar, Vladimir Stojanovic Midterm 2. Exam location: 145 Dwinelle, last SID# 2

Designing Information Devices and Systems I Spring 2016 Elad Alon, Babak Ayazifar Midterm 1

Designing Information Devices and Systems I Spring 2019 Homework 11

Designing Information Devices and Systems I Spring 2016 Elad Alon, Babak Ayazifar Midterm 1

Designing Information Devices and Systems I Fall 2017 Midterm 2. Exam Location: 150 Wheeler, Last Name: Nguyen - ZZZ

Designing Information Devices and Systems I Spring 2018 Homework 13

Designing Information Devices and Systems II Fall 2018 Elad Alon and Miki Lustig Homework 9

Designing Information Devices and Systems I Fall 2016 Babak Ayazifar, Vladimir Stojanovic Final Exam. Exam location: 145 Dwinelle, last SID# 2

Designing Information Devices and Systems I Spring 2017 Babak Ayazifar, Vladimir Stojanovic Midterm 1

Designing Information Devices and Systems I Fall 2016 Babak Ayazifar, Vladimir Stojanovic Midterm 1. Exam location: 145 Dwinelle, last SID# 2

Designing Information Devices and Systems I Fall 2018 Lecture Notes Note Introduction: Op-amps in Negative Feedback

Designing Information Devices and Systems I Summer 2017 D. Aranki, F. Maksimovic, V. Swamy Midterm 2. Exam Location: 100 Genetics & Plant Bio

Designing Information Devices and Systems I Spring 2019 Midterm 2. Exam Location: Cory 521 (DSP)

Designing Information Devices and Systems I Fall 2016 Babak Ayazifar, Vladimir Stojanovic Midterm 1. Exam location: 2050 VLSB, Last Name: Tong-Zzz

Designing Information Devices and Systems II Spring 2016 Anant Sahai and Michel Maharbiz Midterm 1

Designing Information Devices and Systems I Fall 2015 Anant Sahai, Ali Niknejad Midterm 1. Exam location: 60 Evans, last digit SID= 6

[Disclaimer: This is not a complete list of everything you need to know, just some of the topics that gave people difficulty.]

Designing Information Devices and Systems I Spring 2016 Elad Alon, Babak Ayazifar Homework 11

Designing Information Devices and Systems I Fall 2018 Homework 5

Designing Information Devices and Systems I Fall 2018 Homework 3

Designing Information Devices and Systems I Fall 2018 Lecture Notes Note Positioning Sytems: Trilateration and Correlation

Practice problems for Exam 3 A =

Designing Information Devices and Systems I Fall 2017 Homework 3

The value of a problem is not so much coming up with the answer as in the ideas and attempted ideas it forces on the would be solver I.N.

Designing Information Devices and Systems I Spring 2016 Elad Alon, Babak Ayazifar Homework 12

Midterm II Sample Problems

EE 40: Introduction to Microelectronic Circuits Spring 2008: Midterm 2

Designing Information Devices and Systems I Spring 2018 Midterm 1. Exam Location: 155 Dwinelle Last Name: Cheng - Lazich

Designing Information Devices and Systems I Spring 2017 Babak Ayazifar, Vladimir Stojanovic Homework 2

Designing Information Devices and Systems II Fall 2016 Murat Arcak and Michel Maharbiz Homework 0. This homework is due August 29th, 2016, at Noon.

Designing Information Devices and Systems II Spring 2016 Anant Sahai and Michel Maharbiz Midterm 1

Designing Information Devices and Systems II Fall 2018 Elad Alon and Miki Lustig Homework 7

Designing Information Devices and Systems I Fall 2017 Midterm 1. Exam Location: 155 Dwinelle

Math 18, Linear Algebra, Lecture C00, Spring 2017 Review and Practice Problems for Final Exam

Designing Information Devices and Systems I Babak Ayazifar, Vladimir Stojanovic. This homework is due October 25, 2016, at 1PM.

FINAL EXAM Ma (Eakin) Fall 2015 December 16, 2015

Designing Information Devices and Systems I Fall 2018 Lecture Notes Note Positioning Sytems: Trilateration and Correlation

Designing Information Devices and Systems I Spring 2018 Homework 7

Designing Information Devices and Systems I Fall 2015 Anant Sahai, Ali Niknejad Homework 10. This homework is due November 9, 2015, at Noon.

Designing Information Devices and Systems I Spring 2018 Homework 5

Topic 15 Notes Jeremy Orloff

Designing Information Devices and Systems I Spring 2018 Homework 10

Designing Information Devices and Systems I Spring 2018 Homework 11

Midterm Exam (closed book/notes) Tuesday, February 23, 2010

UNIVERSITY OF CALIFORNIA, BERKELEY College of Engineering Department of Electrical Engineering and Computer Sciences

POLYTECHNIC UNIVERSITY Electrical Engineering Department. EE SOPHOMORE LABORATORY Experiment 2 DC circuits and network theorems

Math 2B Spring 13 Final Exam Name Write all responses on separate paper. Show your work for credit.

Designing Information Devices and Systems I Spring 2017 Babak Ayazifar, Vladimir Stojanovic Homework 4

Homework 3 Solution. Due Friday (5pm), Feb. 14, 2013

Homework 2. Due Friday (5pm), Feb. 8, 2013

Designing Information Devices and Systems I Summer 2017 D. Aranki, F. Maksimovic, V. Swamy Midterm 1. Exam Location: 2050 VLSB

Physics Grading Sheet.

Discrete Mathematics and Probability Theory Summer 2014 James Cook Final Exam

Final Exam Practice Problems Answers Math 24 Winter 2012

Designing Information Devices and Systems I Fall 2016 Babak Ayazifar, Vladimir Stojanovic Homework 12

Designing Information Devices and Systems I Summer 2017 D. Aranki, F. Maksimovic, V. Swamy Homework 5

Designing Information Devices and Systems I Spring 2019 Homework 7

Conceptual Explanations: Simultaneous Equations Distance, rate, and time

Designing Information Devices and Systems I Fall 2015 Anant Sahai, Ali Niknejad Homework 8. This homework is due October 26, 2015, at Noon.

REVIEW FOR EXAM III SIMILARITY AND DIAGONALIZATION

Designing Information Devices and Systems II Fall 2018 Elad Alon and Miki Lustig Homework 8

MATH 1120 (LINEAR ALGEBRA 1), FINAL EXAM FALL 2011 SOLUTIONS TO PRACTICE VERSION

EXAM. Exam 1. Math 5316, Fall December 2, 2012

EECS 16A: SPRING 2015 MIDTERM 2

LINEAR ALGEBRA KNOWLEDGE SURVEY

Examples True or false: 3. Let A be a 3 3 matrix. Then there is a pattern in A with precisely 4 inversions.

Notes for course EE1.1 Circuit Analysis TOPIC 4 NODAL ANALYSIS

DEPARTMENT OF MATHEMATICS

DEPARTMENT OF MATHEMATICS

Math Computation Test 1 September 26 th, 2016 Debate: Computation vs. Theory Whatever wins, it ll be Huuuge!

18.06 Professor Johnson Quiz 1 October 3, 2007

Chapter 5. Department of Mechanical Engineering

Recitation 9: Probability Matrices and Real Symmetric Matrices. 3 Probability Matrices: Definitions and Examples

Designing Information Devices and Systems I Spring 2019 Midterm 2

Designing Information Devices and Systems I Spring 2018 Lecture Notes Note 20

Discrete Mathematics and Probability Theory Summer 2014 James Cook Midterm 1 (Version B)

MTH Linear Algebra. Study Guide. Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education

Final Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2

k is a product of elementary matrices.

Reduction to the associated homogeneous system via a particular solution

EECS 16B: FALL 2015 FINAL

Extreme Values and Positive/ Negative Definite Matrix Conditions

Chapter 1 Linear Equations. 1.1 Systems of Linear Equations

Essential Question: What is a complex number, and how can you add, subtract, and multiply complex numbers? Explore Exploring Operations Involving

MATH 310, REVIEW SHEET

Midterm Exam 2. Prof. Miloš Popović

Designing Information Devices and Systems II Fall 2018 Elad Alon and Miki Lustig Homework 12

c 1 v 1 + c 2 v 2 = 0 c 1 λ 1 v 1 + c 2 λ 1 v 2 = 0

Honors Advanced Mathematics Determinants page 1

No books, no notes, no calculators. You must show work, unless the question is a true/false, yes/no, or fill-in-the-blank question.

Math 224, Fall 2007 Exam 3 Thursday, December 6, 2007

'XNH8QLYHUVLW\ (GPXQG73UDWW-U6FKRRORI(QJLQHHULQJ. ECE 110 Fall Test II. Michael R. Gustafson II

20.2 Design Example: Countdown Timer

Transcription:

EECS 6A Designing Information Devices and Systems I Spring 06 Elad Alon, Babak Ayazifar Final Exam location: Solutions PRINT your student ID: PRINT AND SIGN your name:, (last) (first) (signature) PRINT your Unix account login: ee6a- PRINT your discussion section and GSI (the one you attend): PRINT your lab GSI (the one you attend): Name of the person to your left: Name of the person to your right: Name of the person in front of you: Name of the person behind you: Section 0: Pre-exam questions ( points). What are you looking forward to the most this summer? ( pt). What was your favorite lab/homework problem/discussion WS in 6A? What did you like the most about it? ( pts) EECS 6A, Spring 06, Final

Do not turn this page until the proctor tells you to do so. You can work on Section 0 above before time starts. Section : Context-free questions Unless told otherwise, you must show work to get credit. There will be very little partial credit given in this section.. DeterminAnts (5 pts) 6 Compute the determinant of A =. 6 Solutions: We row reduce the following matrix into upper triangular form: 6 6 6 0 0. Elementary row operation matrix: E = 0.5 ()() 6 Hence, we have giving us We have ()() 6 0 0 0 0 0 0 0.5 0 0 0 0 0. Elementary row operation matrix: E = 0 0 0 6 6 E E = 0 0 6 0 0 6 6 det(e ) det(e ) det( ) = det( 0 0 ) 6 0 0 6 det( ) = 6 6 det( ) =. 6 EECS 6A, Spring 06, Final

. Revenge of the Boxes (0 pts) Consider the following circuit: V R kω A V V V R kω 5kΩ V oc B (a) Find the open-circuit voltage V oc between nodes A and B. Solutions: For convenience, we choose B to be "0V" or ground. Using KVL on the left side: 0 = V V r V V r = V With this, we use KCL at A: V r kω V oc 5kΩ = 0 V oc = 0V V oc 5kΩ = V kω V oc = 0V EECS 6A, Spring 06, Final

(b) Find the short-circuit current I sc between the same two points. Solutions: Shorting the bottom 5kΩ resistor out attaches the dependent current source to ground, and so all the current from the current source travels through the shorted out branch in this case. I sc = V r kω = () ma I sc = ma Mind your orders of magnitude! EECS 6A, Spring 06, Final

(c) Now assume that V oc and I sc are as written in the boxes below. (Note that these may or may not be the correct answer to the previous parts.) If you attach a.5 kω resistor across nodes A and B (as shown below), what will be the value of the voltage V AB (also defined below)? V R kω A V V V R kω 5kΩ.5kΩ V AB B V oc 0V I sc ma Solutions: For now, we ll work symbolically with V oc and I sc. With V oc and I sc, you can find the Thevenin and Norton equivalents of the circuit: R T h V T h I N R T h where R T h = V oc I sc. Plugging in a resistor R at the appropriate location, you end up with a voltage or current divider for Thevenin and Norton equivalent circuits, respectively. For completeness, we ll solve for both: Thevenin equivalent: Norton equivalent: ( ) ( RAB V AB = V oc V R AB R AB = I sc ) T h R AB R T h Given V oc = I sc R T h, these come out to be equivalent expressions. Plugging in the numbers from above: R T h = 0V ma = 5kΩ ( V AB = 0V V R = V.5kΩ.5kΩ 5kΩ ) = V EECS 6A, Spring 06, Final 5

5. Full Bases (5 pts) Let the orthonormal vectors v, v, v be a basis B. Provide a simple (symbolic) expression for the vector x (given below) as coordinates in the basis B. x = Solutions: Let the matrix U be: U = v v v Since the columns are orthonormal, then U = U. Ux [B] = x x [B] = U x = U x EECS 6A, Spring 06, Final 6

6. Bulletproof (0 pts) (a) Let A and B be diagonalizable n x n matrices. Show that if A and B have the same set of eigenvectors, then AB = BA. Solutions: Use the eigendecomposition. Since A and B have the same eigenvectors, their cooresponding V matrices will be the same. A = V Λ a V B = V Λ b V Then through expansion: AB = V Λ a V V Λ b V = V Λ a Λ b V = V Λ b Λ a V = V Λ b V V Λ a V = BA Λ a Λ b and Λ b Λ a give the same result and V V = V V = I. Therefore, the multiplication is commutative. (b) Consider a symmetric n x n matrix A. Show that if x A x > 0 for all x 0, then all eigenvalues of A are positive. Fill in the blanks to complete the proof: Let x be a/an of A. A x = x Ax = = () We can rewrite () with a summation: (). Expression () is equivalent to x A x, and thus must be stricly positive. Explain in a single sentence why this means that any eigenvalue of A must be positive. Solutions: Let x be an eigenvector of A. A x = λ x EECS 6A, Spring 06, Final 7

x A x = x λ x = λ x x λ x x = λ x i The right hand side is strictly positive, i.e. always positive. Since the summation is always positive, then λ must always be positive. This holds true for all eigenpairs of A. EECS 6A, Spring 06, Final 8

PRINT your name and student ID: Section : Free-form Problems 7. EEcology ( pts) In this problem we will study the evolution of a hypothetical ecosystem. Within an ecosystem, one can have all sorts of classifications of life forms. For example, your model could initially include only Herbivores and Plants. We will use what s called a replacement model" to represent the dynamics of the ecosystem. Specifically, at every time step, some fraction of Plants is eaten by Herbivores, and the number of Herbivores increases by the number of Plants that were eaten. In addition, some fraction of Herbivores die, and, in the context of this problem, they become Plants. Finally, for both types of organisms, some fraction of the organisms remain in their current state. These same rules apply to new organisms introduced in the problem later on. Note that throughout this problem, the total number of organisms remains the same. In other words, no organism can leave or enter the system. (a) A new species of killer snake, the Baba Konstrictor, slithers its way into this peaceful environment. Babas are incredibly intelligent and hunt Herbivores. The new ecology network is depicted below. # of Herbivores[k] What is the state transition matrix for this new ecosystem where x[k] = # of Plants[k] # of Babas[k]? Babas Herbivores Plants Solutions: 0 0 EECS 6A, Spring 06, Final 9

(b) If we start with 00 of each organism in the new ecosystem, how many organisms of each type will there be after an infinite number of time steps? Solutions: The total number of organisms in the system will remain unchanged. We will always have 00 organisms in the system. After infinite steps, we should be in steady state. Remember that, for a steady state to occur, A x = x, and x is the steady state we are looking for. This corresponds to the eigenvector when λ = (i.e. the importance scores). Consider the previously found state transition matrix A and the steady state x. Solving for the nullspace: 0 0 (A I)x = 0 0 x = 0 0 0 0 0 0 0 0 0 0 0 0 0 x is free. x = Since we are solving for steady state fractions within the system, we have to normalize this eigenvector. Normalizing in this case means making the sum of the vector be, so we divide each element in the vector by the sum of the vector. The normalized steady-state fractions are x = Note that the total number of organisms in the system is 00, so the final number of each type of organism is a fraction of 00, not a fraction of the original 00. Therefore, the number of each organism at steady state will be: 75 lim x[n] = 75 n inf 50 EECS 6A, Spring 06, Final 0

(c) After a few million years, an aquatic-based lifeform, the Eladypus, evolves a set of legs and enters the ecosystem. Having spent many years feasting on eels and sea snakes, the Eladypus has a diet restricted to Babas in this new environment. The new ecosystem can be modeled by the diagram shown below. Note that we don t know yet know what fraction of the Babas is eaten by the Eladypi, but we will define that fraction as having a value of p BE (as indicated in the diagram). Given the rest of the constants indicated in the diagram below, as a function of p BE, what must be the value of p BB (i.e., at each time step, the fraction of Babas that remain in their current state)? P BB Babas P BE 6 Herbivores 6 Plants Eladypi Solutions: The sum of the transitions leaving Babas have to sum to. P BB P BE = P BB = P BE (d) It s "Eladypi Week" on the Discovery Channel and we re hooked to the television trying to learn as much as we can about this unique creature. We learn that an ideal ecosystem has 50 Eladypi. Currently, we observe 600 Plants, 600 Herbivores, 00 Babas, and 00 Eladypi in our ecosystem. What is the fraction of Babas that the Eladypi can eat in order for the ecosystem to reach the ideal state after one transition? That is, what is the value of p BE that enables the ecosystem to reach the ideal state (in terms of the number of Eladypi) from its current state in one time step? With this value of p BE, how many Herbivores, Plants, and Babas are there after this single time step? # of Herbivores[k] Solutions: Supposed our state is now x[k] = # of Plants[k] # of Babas[k]. Setting the state transition matrix, # of Eladypi[k] EECS 6A, Spring 06, Final

we get: 6 0 0 6 0 P BB 0 0 P BE 600 We also have our initial state x[0] = 600 00. We can isolate the last row to get the desired P BE. 00 00 P BE 00 = 50 P BE = Using the equation previously found, we can solve for P BB P BB = P BE = = 6 We can now solve for the next step 0 0 600 500 600 00 = 500 550 00 50 6 6 0 6 0 0 P BE =. In this state, there are 500 Herbivores, 500 Plants, 550 Babas EECS 6A, Spring 06, Final

(e) Given the value of p BE and the state (i.e., the number of Herbivores, Plants, Babas, and Eladypis after the single time step) you computed in part (d), will the number of Eladypi in the ecosystem remain constant after all future timesteps? You must mathematically justify your answer in order to receive credit for this problem. Solutions: Mathematically, the question is asking whether the new state is an eigenvector. We could solve for the steady state of this system and compare it to the state we found. However, it will be easier just to test the state that we have. Let s look at one more iteration in time. 0 0 500 6 500 550 = 5 5 50 50 6 6 0 6 0 0 This is an entirely different state, so the previous state was not stable. This should not be terribly surprising. Since we were only given one of the state values, we did not know enough information about the entire system to arrive stably at equilibrium. More specifically, a real eigenvector. EECS 6A, Spring 06, Final

8. Correlated Circuitry (0 pts) In labs and homeworks you have been implementing cross-correlation in ipython and using helpful numpy functions such as numpy.correlate to calculate cross-correlation. This problem instead will guide you through designing a circuit that implements cross-correlation of an unknown input signal with a known signal. (a) Compute the cross correlation of s = [ 7] with respect to s = [ -], where s and s are both periodic. Your output should be y = [y 0 y ] where y k corresponds to delaying s by k timesteps. Solutions: (-5,5) (b) Now let s start designing a circuit that outputs the cross-correlation of an input signal v in with a known signal s. Once again, the input signal v T in = [v 0 v ] and the given signal s T = [a b] are discrete signals with periods of. The values of a and b are known, fixed and given to you, while the values of the input voltages v 0 and v are unknown. Note that v 0 and v can be treated as indpenedent inputs to your design. Draw a block diagram of a circuit that cross-correlates the input signal v in with the given signal s and outputs the cross-correlation y T = [y 0,y ], with the outputs being defined the same way as they are in part (a). Example diagrams for multipliers and summers are shown below to clarify what we mean by a block diagram for this problem. Solutions: Solution sketch: Multiplier Summer EECS 6A, Spring 06, Final

(c) Design a circuit that outputs the cross-correlation of v T in = [v 0 v ] and s T = [a b] for a = - and b = - using only resistors and op amps. Be sure to label your components and provide their values; your design must be drawn within the box below and use v 0 and v as indicated. v y v 0 y 0 EECS 6A, Spring 06, Final 5

Solutions: Solution sketch EECS 6A, Spring 06, Final 6

(d) Design a circuit that outputs the cross-correlation of v T in = [v 0 v ] and s T = [a b] for a = and b = using only resistors and op amps. Be sure to label your components and provide their values; your design must be drawn within the box below and use v 0 and v as indicated. v y v 0 y 0 Solutions: EECS 6A, Spring 06, Final 7

EECS 6A, Spring 06, Final 8

(e) (BONUS: 5 pts) Now let s assume that we want to be able to correlate v in with respect to either s T = [ ] or s T = [- -], where the choice between the two options is made by some external control signal(s). Using switches, blocks representing correct implementations of parts (c) and (d), and any additional resistors, sources, and op amps, design a circuit that would achieve this functionality. Be sure to label your components and provide their values. Solutions: use swiches to switch between your solution for part (a) and (b), below is a general solution that applies to all values of a, and b. EECS 6A, Spring 06, Final 9

9. Track This (0 pts) In this question we will be working on a robot that must track an object moving along a straight path at an unknown but constant velocity. Specifically, the trajectory of the object is y(t) = α β t, where α is the unknown initial position of the object, and β is the unknown velocity of the object. In general, our robot measures the position of the object at M time instants t,t,...,t M. We denote our measurements by y,...,y M. Unfortunately, our measurements are prone to error, caused by imperfections in our measurement instruments. What we therefore get is the following set of M expressions in two unknowns: α t β y α t β y α t M β y M.. (a) Rewrite the measurement expressions in matrix-vector form A x y, where x T = [α β]. Solutions: Rewrite the original system equations: t y.. [ ] t m α. = β y ṃ.. }{{}. x t M y M }{{}}{{} A y () EECS 6A, Spring 06, Final 0

(b) We know the least-squares solution to part (a) for x is given by ( x = A A) T A T y. Determine a reasonably simple form for each of A T A and A T y. Each of your expressions should be in terms of an appropriate subset of M, t m, and y m, where m =,...,M. Note: Do NOT carry out the multiplication ( A T A) A T y. t [ ]... Solutions: A T t [ M A = t t... t m.. = m= M m= t ] m M m= t m M m= t m t m t m Note that A T A is symmetric as expected [ ]... A T y [ ] M y = t t... t m. = m= y m M m= t my m y m y [ = M M m= t m M m= t ] m M m= t m (c) Next we ll apply the Gram-Schmidt method to orthogonalize (but not orthonormalize) the columns of A. Take as your first orthogonal vector z = that is, a vector of size M whose entries are all equal to. (Note that z does not have unit length, and we won t bother normalizing its length.) Prove that each entry z,i of the second orthogonal vector z is given by z,i = t i - t, where t = M M t m. m= Specifically, you must be sure to prove that z is in fact orthogonal to z. EECS 6A, Spring 06, Final

Solutions: z = = The projection matrix onto spanz is P = z z T z T z... This, together with the fact that z T z = M = P = M T = M..... }{{} Allonesmatrix The second orthogonal vector is... t t z = a P a = t. M.. t. = t. M m= t m M. =. t m... t m t m t m t To prove z is orthogonal to z : z T z = T ( a P a ) = T a T P a = T a T T M a = T a T a = 0 Note that in the previous step, T M = Interpretation: The second orthogonal vector z is obtained by subtracting the arithmetic mean of the measurement from each measurement time. That is, we shift the origin of time to t. This corresponds to looking at y(τ) = ˆα ˆβτ, where τ = t t = y(t) = ( ˆα ˆβ t) ˆβt = α = ˆα ˆβ t and β = ˆβ EECS 6A, Spring 06, Final

(d) Suppose we measure using a noisy apparatus the positions of the moving object at time instants t = 0, t =, and t = 5 seconds, and that we ve registered the following position values: y(0) =, y() =, y(5) =. Using the orthognalization we developed in part (c), find the values of α and β that represent the line that best fits the measured data (in the least squared error sense). Solutions: First, given the measurement times, we figure out t = t t t = Let τ = t t = t = y(τ) = ˆα ˆβτ where τ =,, For the least square expression  x ˆ y: τ  = τ = τ [ ] Solve for x: ˆ A T A = = [ ] [ ]  T ŷ = 5 = 8 [ ][ ] [ ] ˆx T = ( T Â)  T y = 0 5 5 = 0 8 [ ] 0 0 From part (c), β = ˆβ =, α = ˆα ˆβ t = 5 = y(t) = t = ( T Â) = [ ] 0 0 EECS 6A, Spring 06, Final

PRINT your name and student ID: 0. Jumpbot Jumpbot Jumpbot ( pts) In this problem you will be designing circuits allowing a robot named Jumpbot to execute a set of commands that will be described below. Specifically, the output voltages produced by your circuits are interpretted by Jumpbot as setting its vertical position in meters. Note that throughout this problem you must label all circuit component values, and that if you use any switches in your circuit, you must explain/note what voltage in your circuit would set the state of the switch to be open or closed. (In other words, you can t assume that switches will just be set to the appropriate state by some external signal at the appropriate time. Instead, your circuit must produce the control voltage for the switches.) (a) The first command we will design a circuit for is to enable Jumpbot to climb a ramp at a constant vertical rate of 0 m s. Design a circuit that outputs a ramp voltage of slope 0V s. Label the output terminal V ramp. You can use only the following components in your design: Current Sources Voltage Sources Capacitors Resistors Solutions: Form a loop with just a current source I and capacitor C. Measurement terminal should be across C, with the to of measurement terminal in the same direction as flow of current. The relationship between I and C is as follows: I C = 0V s EECS 6A, Spring 06, Final

(b) Now we need to augment Jumpbot to perform the combination of two commands at once. Design a circuit that takes in two voltages (V and V ) and outputs V add = V V. Your design must be drawn within the box below, and use V and V as indicated. Your design for this circuit can use only op-amps and resistors. V V add V Solutions: a non-inverting summing amplifier with gain (or a circuit with equivalent behavior) EECS 6A, Spring 06, Final 5

(c) Due to an issue with Jumpbot s mechanical design, he must take three times as long to go down a ramp as he does to go up one. Design a circuit that outputs the periodic V hill (t) shown below (note that two periods are shown in the figure) and that reflects this constraint. For this design, you may use only the following components: Current Sources Voltage Sources Op-Amps Capacitors Resistors Switches Note: You can complete the rest of this problem without having a correct design for this sub-part. Solutions: see solution to part d EECS 6A, Spring 06, Final 6

(d) Now let s allow Jumpbot to actually jump. His jumps occur with a periodicity of seconds, and when he jumps, he immediately reaches a height of m for 0.5 seconds, after which he immediately returns to ground level. Design a circuit that implements this jump command (two periods of which are shown below). Label your output terminal V jump. You can use only the following components in your design: Current Sources Voltage Sources Op-Amps Capacitors Resistors Switches A voltage source producing V hill (t) from part (c) Solutions: Conceptually, if we could make a triangle wave, we can get a square wave out of it by using a comparator. Recalling that a constant current in to a capacitor gives a ramp voltage (i.e., one side of a triangle wave), we can start with the following initial implementation: reset S S C V hill S S V jump I I/ V 0V The idea in this circuit is that we use the current sources plus the capacitor to generate a triangle wave on V hill that swings between 0V and V; when V hill hits one of the two limits, we want the sign of both the current flowing in to the capacitor and the voltage at V jump to flip. Thus, the switches S and S should be on when V jump = V (to drive V hill towards V) and switches S and S should be on when V jump = 0V (to drive V hill back towards 0V). The relationship between I and C is the following: I C = V s. EECS 6A, Spring 06, Final 7

(e) (BONUS: 6 pts) Design a circuit that would allow Jumpbot to climb a hill with a slope of 0 m s while every seconds also jumping over rocks that are 0.5m high, and that require him to be in the air for 0.5 seconds to clear the rocks. You can use the following components for this design: Current Sources Voltage Sources Op-Amps Capacitors Resistors Switches A voltage source producing V ramp (t) A voltage source producing V jump (t) A correct implementation of the box from part (b) Solutions: Using a block diagram: sum V ramp (t) and V jump (t) with part(b) EECS 6A, Spring 06, Final 8

PRINT your name and student ID:. Of Greedy Pursuits and Multipath Signals ( pts) In wireless communications, multipath propagation is the phenomenon in which a transmitted signal arrives at a receiver through two or more transmission paths typically due to reflections from objects along the way. Imagine a beacon that transmits a periodic discrete-time signal x. Each period of the signal is given by the vector x[0] x[] x[] x = x[] = x[] x[5] x[6] In other words, the transmitted signal has period 7, so x[n 7] = x[n] for all integers n. Recall that the autocorrelation function for a periodic signal x is given by where S is the circular shift matrix: R xx [k] = x,s k x = x T S k x, 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 S = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 (a) Determine the numerical value of R xx [0] and R xx []. Solutions: R xx [0] = x, x = x because x is in R 7 and it has only or - entries R xx [] = x T,S x = [ ] = In fact, it turns out R xx [k] = for all k such that k mod 7 0. EECS 6A, Spring 06, Final 9

For the remainder of this problem assume that the received signal y is a linear combination of delayed and scaled versions of the transmitted signal x. In particular, the received signal in vector form y is given by: y = α L S L x α M S M x = α L z L α M z M, () where z k = S k x for k = L,M. Note that z k is the vector that represents one period of the k-sample delayed version of the transmitted signal x. Let s now explore how to use OMP to determine the values of L and M as well as α L and α M from the received vector y. (b) Assuming that R xx [0] R xx [k] for all k 0, suggest an appropriate dictionary of vectors to use for OMP that will allow us to directly find L, M, α L, and α M. Explain in one to two sentences why you picked this dictionary. Solutions: The appropriate dictionary consists of x and all possible shifted versions of it. That is, D = { x,s x,s x,...,s 6 x} EECS 6A, Spring 06, Final 0

Regardless of your answer to part (b), let s assume that you picked a dictionary of vectors consisting of the columns z i of the matrix Z = [ z 0 z z z z z 5 z 6 ] below: Z = To save you some time in doing mechanical calculations, it is worth noting that the inner product of z i with z j is equal to 7 for i = j, and equal to - for i j. Finally, the received signal in vector form y is: y[0] / y[] / y[] / y = y[] = /. y[] / y[5] / y[6] / (c) Now let s examine what happens during the first iteration of OMP. Assuming a Grunge-Fighting Oracle provides you with the information below, which column of Z (i.e., which z i ) will be selected? Given this choice, provide the expressions you would use to compute the residue signal at the end of the first iteration. y T Z = [ y, z 0 y, z y, z 6 ] [ = 5 ] Solutions: r [0] = y look at r [0], z k and select the vecotr z k for this this quantity is the largest. Clearly, z 0 yields the largest quantity. r [] = r [0] z 0 z T 0 z T 0 z r[0] = y zt 0 y 0 7 z 0 = y ()(7) z 0 r [] = = 7 7 7 7 7 7 7 EECS 6A, Spring 06, Final

(d) Now let s complete the second step of OMP, once again with the help of the Grunge-Fighting Oracle providing the information below. Note that the vector q T is the residue at the end of the first iteration. Which z i is selected in the second step? Finally, what are the values of L, M, α L, and α M? [ ] Z = [ q, z 0 q, z q, z 6 ] 7 7 7 7 7 7 7 }{{} q T [ = 0 7 7 7 7 7 7 ]. Solutions: In the next iteration, we look for the z k that produces the largest r [], z k. Clearly, this is produced by z. So r [] = r [] z z T z T z r[] = r [] (7)(7) z Since we are told that y consists only of two scaled and shifted versions of x, we need not compute r []. We have already identified z 0 = x and z = S x as those components. All we need to do now is to determine how much of [ each] is needed. his is where we do least squares: [ ] α0 z0 z = y = α = ( A }{{} α T A ) A T y A }{{} [ α A T z0, z A = 0 z 0, z ] [ ] 7 = = ( A z, z 0 z, z 7 T A ) = [ ] [ A T y = z0, y ] [ ][ = 5 = α = 7 ] [ ] z, y 8 5 = 7 = y = z 0 z = x S x 9 [ ] 7 = 7 8 [ ] 7 7 EECS 6A, Spring 06, Final

PRINT your name and student ID: [If you are want the work on this page be graded, please state CLEARLY which problem(s) this space is for. You can also draw us something if you want or give us suggestions or complaints. You can also use this page to report anything suspicious that you might have noticed.] EECS 6A, Spring 06, Final