Professor Fearing EECS120/Problem Set 2 v 1.01 Fall 2016 Due at 4 pm, Fri. Sep. 9 in HW box under stairs (1st floor Cory) Reading: O&W Ch 1, Ch2.

Similar documents
EE 210. Signals and Systems Solutions of homework 2

Discussion Section #2, 31 Jan 2014

EE 224 Signals and Systems I Review 1/10

Properties of LTI Systems

Analog vs. discrete signals

The Convolution Sum for Discrete-Time LTI Systems

x(t) = t[u(t 1) u(t 2)] + 1[u(t 2) u(t 3)]

New Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Fall 2015 Final Exam

Homework 4. May An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt

EC Signals and Systems

Digital Signal Processing Lecture 3 - Discrete-Time Systems

06/12/ rws/jMc- modif SuFY10 (MPF) - Textbook Section IX 1

Lecture 2 Discrete-Time LTI Systems: Introduction

NAME: ht () 1 2π. Hj0 ( ) dω Find the value of BW for the system having the following impulse response.

ECE 301 Division 1 Exam 1 Solutions, 10/6/2011, 8-9:45pm in ME 1061.

LTI Systems (Continuous & Discrete) - Basics

New Mexico State University Klipsch School of Electrical Engineering. EE312 - Signals and Systems I Spring 2018 Exam #1

2. CONVOLUTION. Convolution sum. Response of d.t. LTI systems at a certain input signal

Homework 6 Solutions

ECE 301 Fall 2011 Division 1 Homework 5 Solutions

Signals and Systems Spring 2004 Lecture #9

Signals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions

Chap 2. Discrete-Time Signals and Systems

ELEG 305: Digital Signal Processing

Chapter 1: Classification of Signal and System

Frequency-Domain C/S of LTI Systems

The Johns Hopkins University Department of Electrical and Computer Engineering Introduction to Linear Systems Fall 2002.

ECE-314 Fall 2012 Review Questions for Midterm Examination II

Final Exam of ECE301, Section 1 (Prof. Chih-Chun Wang) 1 3pm, Friday, December 13, 2016, EE 129.

CH.3 Continuous-Time Linear Time-Invariant System

NAME: 13 February 2013 EE301 Signals and Systems Exam 1 Cover Sheet

Differential and Difference LTI systems

Cosc 3451 Signals and Systems. What is a system? Systems Terminology and Properties of Systems

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING FINAL EXAM. COURSE: ECE 3084A (Prof. Michaels)

New Mexico State University Klipsch School of Electrical Engineering. EE312 - Signals and Systems I Fall 2017 Exam #1

ECE 301 Division 1, Fall 2006 Instructor: Mimi Boutin Final Examination

ECEN 420 LINEAR CONTROL SYSTEMS. Lecture 2 Laplace Transform I 1/52

Fourier series for continuous and discrete time signals

Classification of Discrete-Time Systems. System Properties. Terminology: Implication. Terminology: Equivalence

EECE 3620: Linear Time-Invariant Systems: Chapter 2

EE 3054: Signals, Systems, and Transforms Summer It is observed of some continuous-time LTI system that the input signal.

Lecture 3 January 23

Module 4. Related web links and videos. 1. FT and ZT

ECE 301 Division 1 Final Exam Solutions, 12/12/2011, 3:20-5:20pm in PHYS 114.

ECE 3620: Laplace Transforms: Chapter 3:

NAME: 23 February 2017 EE301 Signals and Systems Exam 1 Cover Sheet

ESE 531: Digital Signal Processing

Chapter 3 Convolution Representation

Frequency Response (III) Lecture 26:

4 The Continuous Time Fourier Transform

Final Exam of ECE301, Section 3 (CRN ) 8 10am, Wednesday, December 13, 2017, Hiler Thtr.

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

ECE 301 Division 1, Fall 2008 Instructor: Mimi Boutin Final Examination Instructions:

MAE143 A - Signals and Systems - Winter 11 Midterm, February 2nd

Digital Signal Processing Lecture 4

DIGITAL SIGNAL PROCESSING LECTURE 1

VU Signal and Image Processing

2 Classification of Continuous-Time Systems

ECE 301. Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3

Problem 1. Suppose we calculate the response of an LTI system to an input signal x(n), using the convolution sum:

Review of Frequency Domain Fourier Series: Continuous periodic frequency components

Review of Discrete-Time System

University Question Paper Solution

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

Discrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz

III. Time Domain Analysis of systems

Discrete and continuous dynamic systems

ECE 301: Signals and Systems. Course Notes. Prof. Shreyas Sundaram. School of Electrical and Computer Engineering Purdue University

e jωt y (t) = ω 2 Ke jωt K =

Z-Transform. The Z-transform is the Discrete-Time counterpart of the Laplace Transform. Laplace : G(s) = g(t)e st dt. Z : G(z) =

Interconnection of LTI Systems

Final Exam ECE301 Signals and Systems Friday, May 3, Cover Sheet

信號與系統 Signals and Systems

Discrete Time Systems

Convolution. Define a mathematical operation on discrete-time signals called convolution, represented by *. Given two discrete-time signals x 1, x 2,

2.161 Signal Processing: Continuous and Discrete

Lecture 8: Signal Reconstruction, DT vs CT Processing. 8.1 Reconstruction of a Band-limited Signal from its Samples

6.003 (Fall 2011) Quiz #3 November 16, 2011

Grades will be determined by the correctness of your answers (explanations are not required).

A system that is both linear and time-invariant is called linear time-invariant (LTI).

EE 637 Final April 30, Spring Each problem is worth 20 points for a total score of 100 points

ELEN 4810 Midterm Exam

Lecture 1 From Continuous-Time to Discrete-Time

Chapter 2 Time-Domain Representations of LTI Systems

Solutions of Chapter 3 Part 1/2

Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is

15 n=0. zz = re jθ re jθ = r 2. (b) For division and multiplication, it is handy to use the polar representation: z = rejθ. = z 1z 2.

Grades will be determined by the correctness of your answers (explanations are not required).

Mathematical Foundations of Signal Processing

6.003 Homework #10 Solutions

Review of Fundamentals of Digital Signal Processing

Signals and Systems. Problem Set: The z-transform and DT Fourier Transform

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING FINAL EXAM. COURSE: ECE 3084A (Prof. Michaels)

CH.6 Laplace Transform

Aspects of Continuous- and Discrete-Time Signals and Systems

Digital Signal Processing. Midterm 1 Solution

Laplace Transforms and use in Automatic Control

ESE 531: Digital Signal Processing

1 Signals and systems

E2.5 Signals & Linear Systems. Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & 2)

Transcription:

Professor Fearing EECS120/Problem Set 2 v 1.01 Fall 20 Due at 4 pm, Fri. Sep. 9 in HW box under stairs (1st floor Cory) Reading: O&W Ch 1, Ch2. Note: Π(t) = u(t + 1) u(t 1 ), and r(t) = tu(t) where u(t) is the unit step. 2 2 1. (10 pts) What are signals and systems? (Lec 1) For each example below, identify the input x, system H{}, and output y. Which of (x, H, y) are known a priori, which would need to be calculated or designed? Example: NASDAQ market manipulation. Answer: Input: buy and sell orders. System: security dealer network plus investor behavior plus stock order book, e.g. limit orders. Output: share price. System known, output directly measured, design input to control price. a) atomic force microscope b) a heart pacemaker c) a prosthetic arm reaching for a cup d) a voice synthesizer a) input: force between probe and sample system: laser beam, photon detector output: imaging of a surface b) input: electrical activity of the heart system: computer, doctor analysis output: electrical impulse c) input: user input, toggling system: arm hardware/software output: movement of arm from previous position d) input: text from user system: dictionary of phonemes, computer output: audio reading of text 2. (12 pts) algebra review For f(t) = [u(t + 1) r(t + 1) + r(t 1)]u(3 t), sketch: a) f(t) b) f( t 2 ) c) f( 3 2 t + 1) d) f( 3 2 t + 1) e) f(t) f( t) f) f(t) + f( t) In each graph, red/green represents the respective components of f, blue is the graph of f a) u(t + 1) starts at t = 1 r(t + 1) = (t + 1)u(t + 1) also starts at t = 1 r(t 1) = (t 1)u(t 1) also starts at t = 1 u(3 t) ends at t = 3 1

b) f( t ) starts at t = 2 2 ) ends at t = 6 f( t 2 c) f( 3t 2 + 1) starts at t = 4 3 f( 3t 2 + 1) ends at t = 4 3 d) f( 3t 2 + 1) starts at t = 4 3 f( 3t 2 + 1) ends at t = 4 3 2

Graph below for both e) and f): f(t) from a), f( t) : starts at t = 1 f( t) ends at t = 3 e) 3

f) 3. (20 pts) DT and CT Convolution (Lec 2, OW 2.1, 2.2, Arcak Lec 1) Consider a DT or CT linear time invariant operator H{}. Assume that in discrete time H{δ[n]} = h[n]. In continuous time, H{δ(t)} = h(t). Given x[n] = δ[n] + 1δ[n 1] + 1 δ[n 2], let y[n] = H{x[n]}. Also, x(t) = δ(t) + 1δ(t 1) + 1 δ(t 2), and let y(t) = H{x(t)}. a. Using LTI properties directly of H{x[n]}, find y[n] in terms of h[n]. b. Explicitly using x 1 [n] = k= x[k]δ[n k], and LTI properties, find H{x 1[n]}. c. Using LTI properties directly of H{x(t)}, find y(t) in terms of h(t). d. Explicitly using x 1 (t) = x(τ)δ(t τ)dτ and LTI properties, find y τ= 1(t) = H{x 1 (t)}. e. Repeat part d. above, but now use h(t) = e t u(t), and sketch y 1 (t). a) y[n] = H{x[n]} y[n] = H{δ[n] + 1δ[n 1] + 1 δ[n 2]} Because LTI systems are linear, we can rewrite y[n] as: y[n] = H{δ[n]} + 1H{δ[n 1]} + 1 H{δ[n 2]} From the definition given in the problem along with the time invariance property of LTI systems: y[n] = h[n] + 1h[n 1] + 1 h[n 2] b) y 1 [n] = H{x 1 [n]} y 1 [n] = H{ k= x[k]δ[n k]} y 1 [n] = H{... + x[ 1]δ[n + 1] + x[0]δ[n 0] + x[1]δ[n 1] +...} We can apply the linear property: y 1 [n] =... + H{x[ 1]δ[n + 1]} + H{x[0]δ[n 0]} + H{x[1]δ[n 1]} +... Each x[k] is a constant, so we can move them outside of the system: y 1 [n] =... + x[ 1]H{δ[n + 1]} + x[0]h{δ[n 0]} + x[1]h{δ[n 1] +... Applying time invariance: y 1 [n] =... + x[ 1]h[n + 1] + x[0]h[n 0] + x[1]h[n 1] +... 4

y 1 [n] = k= x[k]h[n k] y 1 [n] = k= (δ[k] + 1δ[k 1] + 1 δ[k 2])h[n k] y 1 [n] = h[n] + 1h[n 1] + 1 h[n 2] c) y(t) = H{x(t)} y(t) = H{δ(t) + 1δ(t 1) + 1 δ(t 2)} Applying linear property of LTI systems: y(t) = H{δ(t)} + 1H{δ(t 1)} + 1 H{δ(t 2)} Applying time invariance property of LTI systems: y(t) = h(t) + 1h(t 1) + 1 h(t 2) d) y 1 (t) = H{x 1 (t)} y 1 (t) = H{ x(τ)δ(t τ)dτ} τ= y 1 (t) = x(τ)h{δ(t τ)dτ} τ= Applying the time invariance property of LTI systems: y 1 (t) = x(τ)h(t τ)dτ τ= y 1 (t) = (δ(τ) + 1δ(τ 1) + 1 δ(τ 2))h(t τ)dτ τ= y 1 (t) = (δ(τ) + 1δ(τ 1) + 1 δ(τ 2))h(t τ)dτ τ= y 1 (t) = h(t) + 1h(t 1) + 1 h(t 2) e) Given that h(t) = e t u(t), y 1 (t) = e t u(t) + 1 2 e (t 1) u(t 1) + 1 4 e (t 2) u(t 2) 4. (18 pts) BIBO Stability (Lec 2, OW 2.3, Arcak Lec 1) For each of the following impulse responses, determine whether the system is BIBO stable. If the system is not BIBO stable, find a bounded input x(t) or x[n] which gives an unbounded output, and show that the output is unbounded for this input. (Here u(t) is unit step.) 5

a. h(t) = n= Π(t 6n) b. h(t) = u(t 1) c. h(t) = t 1 u(t 1) d. h[n] = e n u[n + 4] e. h(t) = sin(2πt)u(t) f. h[n] = k= δ[n 2k] a) h(t) = n= u(t 6n + 1) u(t 6n 1) 2 2 To test for stability, we first check that: h(t) dt < t= = t= n= u(t 6n + 1) u(t 6n 1) dt 2 2 = n= u(t 6n + 1) u(t 6n 1)dt t= 2 2 = n= 1dt t= The system is not B.I.B.O. stable. For example, with an input x(t) = 1, which is bounded by B = 1 we can see that: x(τ) τ= n= u(t τ 6n + 1) u(t τ 6n 1) dτ 2 2 τ= n= u(t τ 6n + 1) u(t τ 6n 1) dτ 2 2 b) h(t) = u(t 1) To test for stability, we first check that: h(t) dt < t= = u(t 1) dt t= = 1dt t=1 The system is not B.I.B.O. stable. For example, with an input x(t) = 1, which is bounded by B = 1 we can see that: x(τ)u(t τ 1)dτ τ= u(t τ 1)dτ τ= c) h(t) = 1 u(t 1) t To test for stability, we first check that: h(t) dt < t= = u(t 1) dt 1 t= t 1 dt t=1 t = = ln(t)] t=1 The system is not B.I.B.O. stable. For example, with an input x(t) = 1, which is bounded by B = 1 we can see that: x(τ) 1 τ= t τ 1 τ= t τ u(t τ 1)dτ u(t τ 1)dτ > d) h[n] = e n u[n + 4] To test for stability, we first check that: n= h[n] < = n= e n u[n + 4] = n= 4y e n Applying the infinte geometric sum formula, since e 1 < 1 6

= e4 1 e 1 < The system is B.I.B.O. stable e) h(t) = sin(2πt)u(t) To test for stability, we first check that: h(t) dt < t= = sin(2πt)u(t) dt t= = sin(2πt) dt t=0 The system is not B.I.B.O. stable For example, with an input x(t) = sin(2πt), which is bounded by B = 1 we can see that: x(τ)sin(2π(t τ))u(t τ)dτ τ= sin(2πτ)u(τ)sin(2π(t τ))u(t τ)dτ τ= sin(2πτ)sin(2π(t τ))u(t τ)dτ τ= sin(2πτ)sin(2π(t τ))u(t τ)dτ τ= (cos(2πτ)sin(2πt)sin(2πτ) τ= sin2 (2πτ)cos(2πt))u(t τ)dτ due to the sin 2 term f) h[n] = k= δ[n 2k] To test for stability, we first check that: n= h[n] < = n= k= δ[n 2k] = n=... + δ[n + 2] + δ[n] + δ[n 2] +... The system is not B.I.B.O. stable For example, with an input x[n] = 1, which is bounded by B = 1 we can see that: k= x[k] m= δ[n k 2m] = k= m= δ[n k 2m] = k=... + δ[n k + 2] + δ[n k] + δ[n k 2] +... 5. (20 pts) LDE CT and Block Diag (Lec 3, OW 3.2, Arcak Lec 2) An LTI system with input x(t) and output y(t) is described by the LDE: d 2 y(t) dt 2 + 2 dy(t) dt + 101y(t) = 100 dx(t) dt a. Draw a block diagram realization of this system using multiply by constant, summation blocks, and the minimum number of integration blocks. b. What is the steady state response of the system (i.e. the response after all transients have died away) described by the LDE in eq.( 1) to a complex exponential input x(t) = e jωt? (Hint: e jωt is an eigenfunction, and thus you can assume y(t) = He jωt where H is a complex constant for a given ω.) c. What are the eigenvalues (determined from H)? Is the system B.I.B.O. stable? (1) 7

a) First we get the equation in the form: d 2 y(t) dt 2 = 100 dx(t) dt 2 dy(t) dt 101y(t) and then integrate both sides: = 100x(t) 2y(t) 101 y(t) dy(t) dt b) x(t) = e jωt y(t) = Hx(t) = He jωt ω 2 He jωt + 2jωHe jωt + 101He jωt = 100jωe jωt H = 100jω ω 2 2jω 101 c) To find the eigenvalues, we set y = e λt and x = 0. From there, we can get the characteristic equation: λ 2 e λt + 2λe λt + 101e λt = 0 Solving for this equation: λ = 2+ 804, 2 804 2 2 λ = 1 + j 201, 1 j 201 Both have real components which are less than zero, so the system is B.I.B.O. stable. 6. (20 pts) LDE DT and Block Diag (Lec 3, OW 3.2, Arcak Lec 2) An LTI system with input u[n] (here u[] is not the unit step) and output y[n] is described by the LDE: y[n] 9 y[n 2] = u[n] + 10u[n 1] + 25u[n 2] (2) a. Draw a block diagram realization of this system using multiply by constant, summation blocks, and the minimum number of delay blocks. b. What is the steady state response of the system (i.e. the response after all transients have died away) described by the LDE in eq.( 2) to a complex exponential input u[n] = e jωn? (Hint: e jωn is an eigenfunction and thus you can assume y[n] = He jωn where H is a complex constant for a given ω.) 8

c. Re-write the linear difference equation in state space form: x[n + 1] = Ax[n]+ Bu[n] Bu[n] and output equation y[n] = Cx[n] + Du[n], specifying the 4 matrices A, B, C, D. Note that A is 3x3, x is 3x1, u is scalar, C is 1x3, and D is 1x1. Note u[n] = [u[n 2] u[n 1] u[n]] T. Also, use A of the form: A = 0 1 0 0 0 1??? where the botton row needs to be determined. (This is controller canonical form). a) b) u[n] = e jωn y[n] = He jωn He jωn 9 Hejωn = e jωn + 10e jω(n 1) + 25e jω(n 2) H(e jωn 9 ejωn ) = e jωn + 10e jω(n 1) + 25e jω(n 2) H = 1+10e jω +25e 2jω 1 9 e 2jω 0 1 0 c) Since A has the form 0 0 1 and x[n] has the form [ x[n 3] x[n 2] x[n 1] ] T,??? we can see that we need to find x[n] in terms of x[n 1], x[n 2], x[n 3], u[n]. We also know that y[n] needs to be in terms of x[n 1], x[n 2], x[n 3], u[n]. Based on A, we know that x[n 3] is x[n 2] passed through a delay block and that x[n 2] is x[n 1] passed through a delay block. Looking at our block diagram, we can set where the different x signals will be: 9

We can set the topmost red dot to be x[n], and as we go down the delay chain, x[n 1], x[n 2]. From the block diagram, we can see that x[n] is the sum of the input u[n] and 9 x[n 1]. 0 1 0 0 This means A = 0 0 1 and B = 0. 9 0 0 1 From the block diagram, we can see y[n] is the sum of x[n], x[n 1], x[n 2]: y[n] = x[n] + 10x[n 1] + 25x[n 2] y[n] = u[n] + 9 x[n 2] + 10x[n 1] + 25x[n 2] y[n] = u[n] + 10x[n 1] + 25 9 x[n 2] From this, we can get C = [ 0 25 9 10 ] and D = 1 Note: A 2x2 matrix solution was also accepted and is the minimal solution in this [ case, ] but a solution [ ] can be obtained [ from ] the given constraints above : 0 1 0 x[n 2] A = 9, B =, given that x = 0 1 x[n 1] From there, we can obtain y[n] = x[n] + 10x[n 1] + 25x[n 2] y[n] = u[n] + 9 x[n 2] + 10x[n 1] + 25x[n 2] y[n] = u[n] + 10x[n 1] + 25 9 x[n 2] From this, we can get C = [ 25 9 10 ] and D = 1 10