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

Similar documents
Q1 Q2 Q3 Q4 Q5 Total

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

ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization

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

Problem Value

Digital Signal Processing. Midterm 1 Solution

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

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

Problem Value

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

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

ELEN 4810 Midterm Exam

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

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

ECE 413 Digital Signal Processing Midterm Exam, Spring Instructions:

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

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.

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

Final Exam 14 May LAST Name FIRST Name Lab Time

Massachusetts Institute of Technology

EE 224 Signals and Systems I Review 1/10

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

2A1H Time-Frequency Analysis II

DEPARTMENT OF ELECTRICAL AND ELECTRONIC ENGINEERING EXAMINATIONS 2010

Chapter 2: Problem Solutions

/ (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

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

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

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

LTI Systems (Continuous & Discrete) - Basics

Final Exam January 31, Solutions

ESE 531: Digital Signal Processing

Massachusetts Institute of Technology

Chapter 5 Frequency Domain Analysis of Systems

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

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

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

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

The Z transform (2) 1

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

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

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

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

EC Signals and Systems

GATE EE Topic wise Questions SIGNALS & SYSTEMS

Lecture 3 January 23

Solutions. Number of Problems: 10

Chapter 7: The z-transform

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

The goal of the Wiener filter is to filter out noise that has corrupted a signal. It is based on a statistical approach.

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

The Cooper Union Department of Electrical Engineering ECE111 Signal Processing & Systems Analysis Final May 4, 2012

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

ESE 531: Digital Signal Processing

Review of Discrete-Time System

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

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL and COMPUTER ENGINEERING

ECGR4124 Digital Signal Processing Midterm Spring 2010

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science Discrete-Time Signal Processing Fall 2005

ESE 531: Digital Signal Processing

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science : Discrete-Time Signal Processing

Fourier Methods in Digital Signal Processing Final Exam ME 579, Spring 2015 NAME

2.161 Signal Processing: Continuous and Discrete Fall 2008

EE123 Digital Signal Processing

E : Lecture 1 Introduction

Question Paper Code : AEC11T02

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

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

CHAPTER 2 RANDOM PROCESSES IN DISCRETE TIME

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

Computer Engineering 4TL4: Digital Signal Processing

Core Concepts Review. Orthogonality of Complex Sinusoids Consider two (possibly non-harmonic) complex sinusoids

University Question Paper Solution

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

EE301 Signals and Systems Spring 2016 Exam 2 Thursday, Mar. 31, Cover Sheet

Massachusetts Institute of Technology

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

Solutions. Number of Problems: 10

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

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

Chapter 5 Frequency Domain Analysis of Systems

Problem Value

EE538 Digital Signal Processing I Session 13 Exam 1 Live: Wed., Sept. 18, Cover Sheet

FINAL EXAM. Problem Value Score No/Wrong Rec 3

Aspects of Continuous- and Discrete-Time Signals and Systems

Problem Value Score No/Wrong Rec

EE5356 Digital Image Processing

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

SAMPLE EXAMINATION PAPER (with numerical answers)

ECE 301 Fall 2010 Division 2 Homework 10 Solutions. { 1, if 2n t < 2n + 1, for any integer n, x(t) = 0, if 2n 1 t < 2n, for any integer n.

Review: Continuous Fourier Transform

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

EECS 20N: Structure and Interpretation of Signals and Systems Final Exam Department of Electrical Engineering and Computer Sciences 13 December 2005

Stability Condition in Terms of the Pole Locations

Signals & Systems. Chapter 7: Sampling. Adapted from: Lecture notes from MIT, Binghamton University, and Purdue. Dr. Hamid R.

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

Lab 4: Quantization, Oversampling, and Noise Shaping

ECE-314 Fall 2012 Review Questions for Midterm Examination II

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

Chap 4. Sampling of Continuous-Time Signals

Transcription:

EE 120: Signals & Systems Department of Electrical Engineering and Computer Sciences University of California, Berkeley Midterm Exam #2 April 11, 2016, 2:10-4:00pm Instructions: There are four questions on this midterm. Answer each question in the space provided, and clearly label the parts of your answer. You can use the additional blank pages at the end for scratch paper if necessary. Do NOT write answers on the back of any sheet or in the additional blank pages. Any such writing will NOT be graded. Each problem is worth 25 points, and you may solve the problems in any order. Show all work. If you are asked to prove something specific, you must give a derivation and not quote a fact from your notes sheet. Otherwise, you may freely use facts and properties derived in class; just be clear about what you are doing! None of the questions requires a very long answer, so avoid writing too much! Unclear or long-winded solutions may be penalized. You may use one double-sided sheet of notes. No calculators are allowed (or needed). Your Name: Your Student ID: Name of Student on Your Left: Name of Student on Your Right: For official use do not write below this line! Q1 Q2 Q3 Q4 Total 1

Problem 1. (DT Processing of a CT Signal) A bandlimited continuous time signal is known to contain a 60-Hz component, which we want to remove by processing with the system shown below. a) Assuming T = 10 4 s, what is the highest frequency that the continuous time input signal can contain if aliasing is to be avoided? b) Draw the frequency responses of the ideal anti-aliasing and ideal reconstruction filters assuming T = 10 4 s. You may assume the ADC produces samples x[n] = x(nt ) for integer values of n, and the DAC generates the weighted impulse train y(t) = n= y[n]δ(t nt ). c) The discrete-time system to be used has frequency response H(e jω ) = (1 e j(ω ω 0 ))(1 e j(ω+ω 0) ) (1 0.9e j(ω ω 0) )(1 0.9e j(ω+ω 0) ). Compute the filter gain H(e jω ) 2, and make a rough sketch of it. (1.8 1.8 cos(ω ω (Hint: 0 )) (1.81 1.8 cos(ω ω 0 )) 1 unless ω is very close to ω 0...) d) What value should be chosen for ω 0 in order to eliminate the 60-Hz component? e) In words, why might it be preferable to perform the signal processing in discrete time, instead of continuous time? Give a real-life example where this might apply. 1

(Additional space for Problem 1) 2

Problem 2. (Laplace Transform) Consider the causal LTI system describe by the differential equation y (t) + 6y (t) + 9y(t) = x (t) + 3x (t) + 2x(t). a) Find the transfer function H(s) corresponding to this system, and determine whether the system is stable. b) Find the impulse response h(t) corresponding to this system. c) The inverse of this system (taking y(t) back to x(t)) can also be described by a causal LTI system in differential equation form. Find the differential equation describing the inverse and its transfer function G(s). d) What is the impulse response g(t) corresponding to the inverse system you found in part (c)? e) Suppose a rational function X(s) has a pole-zero diagram as shown below. If you integrate the function X(s)e st over the variable s along the illustrated paths (in the vertical direction indicated by the arrows), what type of time domain signal will you obtain? For each path labeled (i)-(iii), respond with left-sided, right-sided or two-sided. 3

(Additional space for Problem 2) 4

(Additional space for Problem 2) 5

Problem 3. (DFT) a) Consider a 20-point finite duration signal x[n] such that x[n] = 0 outside 0 n 19, and let X(e jω ) denote the DTFT of x[n]. You have a computer program that can compute a DFT, but not the DTFT. However, you want to evaluate X(e jω ) at ω = 4π/5. Give a method for doing so. b) Two eight-point sequences are shown below. Signal x 1 [n] has 8-point DFT X 1 [k], and signal x 2 [n] has 8-point DFT X 2 [k]. Determine the relationship between X 1 [k] and X 2 [k]. c) Suppose x c (t) is a periodic continuous-time signal with period 10 3 s and for which the Fourier series is x c (t) = 9 k= 9 a k e j2πkt/10 3. The Fourier series coefficients are zero for k > 9. The signal x c (t) is sampled with a sampling period T = 1 6 10 3 s to form x[n]. That is, x[n] = x c ( n10 3 i) Is x[n] periodic and, if so, what is the period? ii) Is the sampling rate large enough to avoid aliasing? iii) Compute the 6-point DFT of {x[0],..., x[5]} in terms of the a k s. 6 ). 6

(Additional space for Problem 3) 7

(Additional space for Problem 3) 8

Problem 4. (Overcoming Quantization Noise) Let x c (t) be a power signal with (continuous time) autocorrelation function 1 C xcxc (τ) := lim T 2T T T x c (t)x c (t + τ)dt = sin(2πbτ). πτ Suppose x c (t) is sampled according to x[n] = x c (nt s ), where the sampling period T s satisfies T s < 1 2B. We will assume that x[n] is a power signal with C xx [k] = C xcx c (kt s ). (1) a) Give an intuitive (non-mathematical) explanation for why (1) should hold, and compute S xx (e jω ). b) In practice, analog-to-digital converters cannot perfectly sample x[n] = x c (nt s ), since doing so would require an infinite number of bits. Instead, they quantize the number x c (nt s ) to an interval of length, which corresponds to the resolution of the analog-to-digital converter. In this manner, we model the quantized samples, denoted by y[n], as y[n] = x[n] + e[n], where e[n] is the quantization error, and is assumed to be a random number between /2 and /2, uncorrelated from one sample to the next. Stated another way, e[n] is uncorrelated with x[n] and has autocorrelation function Compute S xy (e jω ) and S yy (e jω ). C ee [k] = 2 12 δ[k]. c) Specify the optimal filter h[n] (i.e., the Wiener filter) for estimating the true sample values x[n] from the quantized samples y[n]. d) For ˆx[n] = y[n] h[n], the mean square error (MSE) satisfies lim N 1 2N N n= N (x[n] ˆx[n]) 2 = 1 π 2π π (S xx (e jω ) S xy(e jω ) 2 S yy (e jω ) ) dω. (2) Use (2) to find the MSE in estimating x[n] from y[n] in terms of T s, B and. e) Prove that (2) holds. (Note: this relationship holds in general for the Wiener filter, and is not specific to this problem.) 9

(Additional space for Problem 4) 10

(Additional space for Problem 4) 11

(this page left intentionally blank) 12

(this page left intentionally blank) 13

(this page left intentionally blank) 14