Solutions. Number of Problems: 10

Similar documents
Final Exam January 31, Solutions

Solutions. Number of Problems: 10

Solutions. Number of Problems: 10

Quiz. Good luck! Signals & Systems ( ) Number of Problems: 19. Number of Points: 19. Permitted aids:

ECE 350 Signals and Systems Spring 2011 Final Exam - Solutions. Three 8 ½ x 11 sheets of notes, and a calculator are allowed during the exam.

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

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

EE538 Final Exam Fall :20 pm -5:20 pm PHYS 223 Dec. 17, Cover Sheet

NAME: 11 December 2013 Digital Signal Processing I Final Exam Fall Cover Sheet

Solution 10 July 2015 ECE301 Signals and Systems: Midterm. Cover Sheet

Review of Discrete-Time System

ECE538 Final Exam Fall 2017 Digital Signal Processing I 14 December Cover Sheet

Each problem is worth 25 points, and you may solve the problems in any order.

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

Discrete-time signals and systems

Your solutions for time-domain waveforms should all be expressed as real-valued functions.

UNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything.

Final Exam 14 May LAST Name FIRST Name Lab Time

ELEN 4810 Midterm Exam

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

ECGR4124 Digital Signal Processing Midterm Spring 2010

EEL3135: Homework #4

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

Discrete Time Systems

Frequency-Domain C/S of LTI Systems

Q1 Q2 Q3 Q4 Q5 Total

Problem Value Score No/Wrong Rec

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

Z Transform (Part - II)

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

Final Exam of ECE301, Prof. Wang s section 1 3pm Tuesday, December 11, 2012, Lily 1105.

Problem Value

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

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

NAME: 20 February 2014 EE301 Signals and Systems Exam 1 Cover Sheet

EE538 Final Exam Fall 2007 Mon, Dec 10, 8-10 am RHPH 127 Dec. 10, Cover Sheet

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

Massachusetts Institute of Technology

Multidimensional digital signal processing

Problem Value

EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 20, Cover Sheet

University of Illinois at Urbana-Champaign ECE 310: Digital Signal Processing

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

Lecture 13: Discrete Time Fourier Transform (DTFT)

2A1H Time-Frequency Analysis II

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

Definition. A signal is a sequence of numbers. sequence is also referred to as being in l 1 (Z), or just in l 1. A sequence {x(n)} satisfying

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

Digital Signal Processing Lecture 3 - Discrete-Time Systems

Digital Signal Processing. Midterm 1 Solution

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

/ (2π) X(e jω ) dω. 4. An 8 point sequence is given by x(n) = {2,2,2,2,1,1,1,1}. Compute 8 point DFT of x(n) by

Like bilateral Laplace transforms, ROC must be used to determine a unique inverse z-transform.

Review of Fundamentals of Digital Signal Processing

EE 521: Instrumentation and Measurements

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

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

Lecture 7 Discrete Systems

Digital Signal Processing I Final Exam Fall 2008 ECE Dec Cover Sheet

ELEG 305: Digital Signal Processing

Review of Fundamentals of Digital Signal Processing

EEM 409. Random Signals. Problem Set-2: (Power Spectral Density, LTI Systems with Random Inputs) Problem 1: Problem 2:

Chapter 5. Fourier Analysis for Discrete-Time Signals and Systems Chapter

Lecture 9 Infinite Impulse Response Filters

Massachusetts Institute of Technology

NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY DEPARTMENT OF ELECTRONICS AND TELECOMMUNICATIONS

Discrete Time Fourier Transform

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

2A1H Time-Frequency Analysis II Bugs/queries to HT 2011 For hints and answers visit dwm/courses/2tf

ESE 531: Digital Signal Processing

ESE 531: Digital Signal Processing

ECE 438 Exam 2 Solutions, 11/08/2006.

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

Chap 2. Discrete-Time Signals and Systems

Signals & Systems Handout #4

Final Exam of ECE301, Prof. Wang s section 8 10am Tuesday, May 6, 2014, EE 129.

ECE503: Digital Signal Processing Lecture 4

EE 225D LECTURE ON DIGITAL FILTERS. University of California Berkeley

Very useful for designing and analyzing signal processing systems

The Z transform (2) 1

Lecture 10. Digital Signal Processing. Chapter 7. Discrete Fourier transform DFT. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev.

School of Information Technology and Electrical Engineering EXAMINATION. ELEC3004 Signals, Systems & Control

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

Lecture 3 January 23

EE-210. Signals and Systems Homework 7 Solutions

EEE4001F EXAM DIGITAL SIGNAL PROCESSING. University of Cape Town Department of Electrical Engineering PART A. June hours.

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

Lecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE

ECE 636: Systems identification

Question Paper Code : AEC11T02

ELC 4351: Digital Signal Processing

EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 19, Cover Sheet

Advanced Signals and Systems

Solution 7 August 2015 ECE301 Signals and Systems: Final Exam. Cover Sheet

! z-transform. " Tie up loose ends. " Regions of convergence properties. ! Inverse z-transform. " Inspection. " Partial fraction

Digital Signal Processing. Lecture Notes and Exam Questions DRAFT

Recursive, Infinite Impulse Response (IIR) Digital Filters:

! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals

MEDE2500 Tutorial Nov-7

ECE503: Digital Signal Processing Lecture 5

Transcription:

Final Exam February 9th, 2 Signals & Systems (5-575-) Prof. R. D Andrea Solutions Exam Duration: 5 minutes Number of Problems: Permitted aids: One double-sided A4 sheet. Questions can be answered in English or German. Use only the prepared sheets for your solutions. Additional paper is available from the supervisors.

Problem A linear, time invariant system with input x[n] and output y[n] has the transfer function H(z) = Y(z) X(z) = 2z a 2 +2az +z 2 a) For what real values of a is the system causal and stable? (3 points) b) Write down a causal difference equation of the above system of the following form: ( y[n] = M ) N b k x[n k] a k y[n k] a k= k= (2 points) Solution a) The poles of the system are at = a 2 +2az +z 2 = (a+z ) 2 z = a z = a For the system to be causal and stable, the poles must lie within the unit circle. It follows that a > must hold. b) Y(z) X(z) = 2z a 2 +2az +z 2 Y(z)(a 2 +2az +z 2 ) = X(z)( 2z ) a 2 y[n]+2ay[n ]+y[n 2] = x[n] 2x[n ] y[n] = a 2(x[n] 2x[n ] 2ay[n ] y[n 2])

Problem 2 A system is governed by the difference equation ( y[n] = x[n]x[n ]+cos 3πn π ), 3 where x[n] is the input and y[n] is the output. Is the system a) linear? Yes No b) time invariant? Yes No c) bounded input bounded output (BIBO) stable? Yes No d) memoryless? Yes No e) causal? Yes No Please circle either Yes or No. If you change your mind, please cross out both Yes and No and write either Yes or No alongside, or leave it blank. It is not necessary to justify choices. You can get a maximum of and a minimum of points for this problem. For each subproblem you get: + for a correct answer, - for an incorrect answer and for no answer. Solution 2 a) No b) No c) Yes d) No e) Yes

Problem 3 The output of a system T is y[n] = T{x[n]}. T is a causal, linear, time invariant system. Given the input and output below, calculate the impulse response h[n] of the system T for all n. n < 2 3 4 5 > 5 x[n] 2 y[n] 3 2 2 5 2 4 Solution 3 Because the system is given to be causal, h[n] = for all n <. One can see from the input output behavior that the system has a finite impulse response (the output goes to zero a finite number of steps after the input goes to zero). The input is zero for n > 2, and the output is zero for n > 5; therefore the impulse response must be zero for n > 3. n = : n = : n = 2: y[] = h[]x[] h[] = y[] x[] = 3 y[] = h[]x[] + h[]x[] h[] = y[] h[]x[] x[] = y[2] = h[]x[2] + h[]x[] + h[2]x[] h[2] = y[2] h[]x[2] h[]x[] x[] = 5

n = 3: y[3] = h[]x[3]+h[]x[2]+h[2]x[]+h[3]x[] h[3] = y[3] h[]x[3] h[]x[2] h[2]x[] x[] = 2

Problem 4 The transfer function of a filter is H(z) = Y(z) X(z) = b +a z. Calculate the coefficients b and a such that the filter is stable and causal, and such that the frequency response H(Ω) of the filter fulfills the two criteria H(Ω = ) =, and ( H Ω = π ) = 2. 2 Solution 4 The first criterion yields = b +a e j = b +a, +a = b. From the second criterion, we obtain = b 2 ja = b. +a 2 Combining the two criteria, we obtain = +a. 2 +a 2 It follows that = (+a ) 2 +a 2 2. = a 2 +4a +.

Solving the quadratic equation for a, we obtain the two solutions a = 2± 3. Since the filter needs to be stable, causal, and has a pole at z = a, the only possible solution is a = 2+ 3, from which follows b = + 3.

Problem 5 Associate the following impulse responses ((a) to (e)) and frequency responses (() to (5)) with the corresponding difference equation by filling out the following table. It is not necessary to justify choices. Difference equation y[n] = 3 (x[n]+x[n ]+x[n 2]) y[n] = 2 (x[n] x[n ]) y[n] =.8x[n]+.2y[n ] y[n] = 3 (x[n+]+x[n]+x[n ]) y[n] =.2x[n]+.8y[n ] Impulse Response Frequency Response (a) to (e) () to (5) Impulse response h[n].5.5 2 2 4 6 Time index n Impulse response h[n].5.5 2 2 4 6 Time index n (a) (b) Impulse response h[n].5.5 2 2 4 6 Time index n Impulse response h[n].5.5 2 2 4 6 Time index n (c) (d) Impulse response h[n].5.5 2 2 4 6 Time index n (e)

Amplitude.5 2 3 Amplitude.5 2 3 Phase ( ) 9 9 Phase ( ) 9 9 2 3 2 3 Frequency Ω Frequency Ω () (2) Amplitude.5 2 3 Amplitude.5 2 3 Phase ( ) 9 9 Phase ( ) 9 9 2 3 2 3 Frequency Ω Frequency Ω (3) (4) Amplitude.5 2 3 Phase ( ) 9 9 2 3 Frequency Ω (5)

Solution 5 Difference equation Impulse Response Frequency Response (a) to (e) () to (5) y[n] = 3 (x[n]+x[n ]+x[n 2]) d y[n] = 2 (x[n] x[n ]) c 5 y[n] =.8x[n]+.2y[n ] e 4 y[n] = 3 (x[n+]+x[n]+x[n ]) b 3 y[n] =.2x[n]+.8y[n ] a 2

Problem 6 For a zero mean signal x[n], R xx [] = σ 2 x, where R xx is the autocorrelation function and σ 2 x is the variance of the signal x[n]. The autocorrelation function is defined as R xx [k] := E(x[n]x[n k]), where E( ) is the expected value operator. Let x[n] be white noise with varianceσ 2 x = 2. Thesignalx[n]isappliedtoalineartimeinvariantsystem T to generate the output y[n] = T{x[n]}. The frequency response H(Ω) of T can be approximated by { H(Ω) = 2 e jω, Ω Ω c, Ω c < Ω π. Calculate the frequency Ω c such that the variance of the output signal y[n] is σ 2 y =.4. Solution 6 The power spectral density function of y[n] is { S yy (Ω) = H(Ω) 2 S xx (Ω) = 4 σ2 x = 2, Ω Ω c, Ω c < Ω π. The system T is linear, therefore the zero mean input x[n] results in a zero mean output y[n]. We calculate the variance of y[n] using the inverse Fourier transform σy 2 = R yy [k = ] = π S yy (Ω)e jω dω 2π = π Ωc 2 dω = Ω c 2π. Solving for Ω c with σ 2 y =.4, we obtain π Ω c = 4π 5.

Problem 7 Consider the continuous time signal ( x(t) = 4cos 6πt+ π ) +2cos(8πt+π) 2. 3 a) Determine the largest possible sampling time T s in seconds to sample the signal without aliasing effects. b) Sample the given continuous time signal with the sampling time you obtained in a), starting at t = : ( point) ( point) x[] = x(), x[] = x(t s ),..., x[n] = x(nt s ). Determine the fundamental period N of the discrete time signal x[n]. c) State the Fourier series coefficients c k given by (3 points) c k = N N n= x[n]e j2πk N n, k =,,...,N. Solution 7 a) The largest possible sampling time is T s = /8s. b) The sampled signal is x[n] = 4cos ( 3 4 πn+ π ) +2cos(πn+π) 2. 3 The fundamental period of the signal is N = 8. c) The coefficients are k 2 3 4 5 6 7 c k -2 2e jπ 3-2 2e jπ 3. For a detailed solution, please refer to the solution of problem 4 of the 29 final exam or the recitation notes posted on Nov. 5 on the class website.

Problem 8 A continuous time, linear, time invariant system with input x(t) and output y(t) is given by the state space description q(t) = Aq(t) + Bx(t) y(t) = Cq(t) + Dx(t), where the state vector has two elements q(t) = {q (t),q 2 (t)} T and the matrices are [ ] [ ] A = B = C = [ ] D = [.5] Assume the input x(t) is piece-wise constant x(t) = x[k] kt s t < (k +)T s with sampling time T s. Compute A d,b d,c d,d d of a discrete time state space description of the system when the output y[k] is defined as q[k +] = A d q[k]+b d x[k] y[k] = C d q[k]+d d x[k], y[k] := y(t = kt s ). Solution 8 We solve this problem using the matrix exponential (see lecture notes for derivation). We define: [ ] A B M := =. The discrete time matrices A d,b d are then obtained by calculating [ ] Ad B d = e MT s.

Since the matrix M is nilpotent, i.e. M 3 =, it is straightforward to calculate the matrix exponential: [ ] Ad B d = I +MT s + 2 M2 Ts, 2 where I is the identity matrix. The matrices are therefore [ ] [ ] Ts A d = B d = 2 T2 s T s. C d = C D d = D

Problem 9 You are given the state space description of a system: [ ] [ ] 2 q[n+] = 4 2 q[n]+ x[n] 25 3 y[n] = [ ] q[n]+ [ 4 ] x[n] a) Is the system bounded input bounded output stable? (2 points) b) Is the system controllable? ( point) c) Calculate the step response of the system for n =,,2. ( point) d) Consider the second system ( point) [ ] [ ] q[n+] = 4 2 q[n]+ x[n] 3 25 2 y[n] = [ ] q[n]+ [ 3 ] x[n] is the input output behavior of this system identical to the first one? Solution 9 a) The eigenvalues of the matrix A are λ = λ 2 = 2. The system is therefore stable. [ ] 2 7 b) The controllability matrix is [B AB] = 4. The matrix has full 53 row rank and the system is therefore controllable. c) n = : [ ][ ] [ ] 2 q[] = 4 2 + 25 3 [ ] 2 = y[] = [ ][ ] + [ 4 ] = 4

n = : [ ][ ] [ ] 2 q[2] = 4 2 2 + 25 3 [ 25 ] = 4 52 y[] = [ ][ ] 2 + [ 4 ] = n = 2: y[2] = [ ][ ] 25 4 + [ 4 ] 52 = 99 4 d) No. An easy way to see this is [ the ] first value of the step response: The state of both systems is q[] =. The output of the first system is therefore y[] = 4, while the output of the second system is y[] = 3.

Problem Assume that you are identifying a linear time invariant system T with input x[n] and output y[n]: y[n] = T{x[n]} You applied the input x[n] and measured the output y[n] for samples, i.e. n, as shown below: Input signal x[n] Output signal y[n].5.5 2 3 4 5 6 7 8 9.5.5 2 3 4 5 6 7 8 9 Time Index n You want to use this data to identify a model of the form in the frequency domain. Ĥ(z) = b +b z +b 2 z 2 + +b M z M +a z +a 2 z 2 + +a N z N a) Let Y(Ω) be the Discrete Fourier Transform of the measured output y[n]. How many frequency points will the Transform have in the range Ω π? Now assume that you have calculated the system transfer function at each frequency point Ω k. H(Ω k ) = Y(Ω k) X(Ω k ) b) When fitting a model to the system transfer function, what are the highest possible model orders N and M that you can identify using only the given measurement data? ( point) (2 points)

c) A colleague has identified a model from the given measurement data. A plot of the frequency response of his estimated model Ĥ(z) is shown below. Is this result plausible, and why? (2 points) Amplitude 3 2.5.5 2 2.5 3 Phase ( ) 9 9.5.5 2 2.5 3 Frequency Ω Solution a) There will be. The Discrete Fourier Transform will result in frequency domain points in a 2π interval. This means that the spacing between frequency points will be Ω = 2π. There will be one point at Ω =. There will be 5 more points in the interval, because 5 Ω < π and 5 Ω > π. b) There are pieces of information (the point at Ω = is real, and all points at Ω are complex.). Therefore, N +M + N +M. c) No. The system has a phase of 9 at Ω =, which means that the system has a complex gain. This is clearly not the case, as the inputoutput data is real.