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

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

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

EEL3135: Homework #4

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

Responses of Digital Filters Chapter Intended Learning Outcomes:

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

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

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

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

Computer Engineering 4TL4: Digital Signal Processing

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

EECE 301 Signals & Systems Prof. Mark Fowler

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

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

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

Stability Condition in Terms of the Pole Locations

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

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

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

ECE503: Digital Signal Processing Lecture 5

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

CHAPTER 2 RANDOM PROCESSES IN DISCRETE TIME

Chap 2. Discrete-Time Signals and Systems

EE 3054: Signals, Systems, and Transforms Spring A causal discrete-time LTI system is described by the equation. y(n) = 1 4.

University Question Paper Solution

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

The Discrete-Time Fourier

Fourier Series Representation of

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

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

EE482: Digital Signal Processing Applications

Discrete-time Signals and Systems in

ECGR4124 Digital Signal Processing Midterm Spring 2010

Solutions. Number of Problems: 10

Module 3. Convolution. Aim

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

ECE-314 Fall 2012 Review Questions for Midterm Examination II

Final Exam January 31, Solutions

Solutions. Number of Problems: 10

EE 602 TERM PAPER PRESENTATION Richa Tripathi Mounika Boppudi FOURIER SERIES BASED MODEL FOR STATISTICAL SIGNAL PROCESSING - CHONG YUNG CHI

Advanced Digital Signal Processing -Introduction

ECGR4124 Digital Signal Processing Exam 2 Spring 2017

Digital Signal Processing. Midterm 1 Solution

EE482: Digital Signal Processing Applications

Digital Signal Processing

Advanced Signals and Systems

Problem Value

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

EECE 2150 Circuits and Signals Final Exam Fall 2016 Dec 12

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

( ) John A. Quinn Lecture. ESE 531: Digital Signal Processing. Lecture Outline. Frequency Response of LTI System. Example: Zero on Real Axis

Parametric Signal Modeling and Linear Prediction Theory 1. Discrete-time Stochastic Processes (cont d)

Linear Convolution Using FFT

Digital Signal Processing. Midterm 2 Solutions

Problem Value Score No/Wrong Rec

Digital Signal Processing Lecture 4

Lecture 11 FIR Filters

Introduction to DSP Time Domain Representation of Signals and Systems

EE482: Digital Signal Processing Applications

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

Problem Value

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

Lab 4: Quantization, Oversampling, and Noise Shaping

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

Chapter 5 Frequency Domain Analysis of Systems

Optimum Ordering and Pole-Zero Pairing of the Cascade Form IIR. Digital Filter

Wiener Filtering. EE264: Lecture 12

Multidimensional digital signal processing

Review of Fundamentals of Digital Signal Processing

Digital Signal Processing

Digital Filters Ying Sun

Massachusetts Institute of Technology

ECGR4124 Digital Signal Processing Final Spring 2009

ELEN 4810 Midterm Exam

Complement on Digital Spectral Analysis and Optimal Filtering: Theory and Exercises

ECE 636: Systems identification

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

ECE 413 Digital Signal Processing Midterm Exam, Spring Instructions:

Probability Space. J. McNames Portland State University ECE 538/638 Stochastic Signals Ver

Problem Value Score No/Wrong Rec 3

Test 2 Electrical Engineering Bachelor Module 8 Signal Processing and Communications

Review of Fundamentals of Digital Signal Processing

Linear Stochastic Models. Special Types of Random Processes: AR, MA, and ARMA. Digital Signal Processing

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

DISCRETE-TIME SIGNAL PROCESSING

Lecture 4: FT Pairs, Random Signals and z-transform

Digital Signal Processing Lecture 9 - Design of Digital Filters - FIR

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

DSP Laboratory (EELE 4110) Lab#3 Discrete Time Signals

DFT & Fast Fourier Transform PART-A. 7. Calculate the number of multiplications needed in the calculation of DFT and FFT with 64 point sequence.

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

UCSD ECE153 Handout #40 Prof. Young-Han Kim Thursday, May 29, Homework Set #8 Due: Thursday, June 5, 2011

Review of Discrete-Time System

Topics: Discrete transforms; 1 and 2D Filters, sampling, and scanning

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

EE123 Digital Signal Processing. M. Lustig, EECS UC Berkeley

Optimal Design of Real and Complex Minimum Phase Digital FIR Filters

Complement on Digital Spectral Analysis and Optimal Filtering: Theory and Exercises

HST.582J / 6.555J / J Biomedical Signal and Image Processing Spring 2007

ECE4270 Fundamentals of DSP Lecture 20. Fixed-Point Arithmetic in FIR and IIR Filters (part I) Overview of Lecture. Overflow. FIR Digital Filter

Transcription:

EE538 Final Exam Fall 2007 Mon, Dec 10, 8-10 am RHPH 127 Dec. 10, 2007 Cover Sheet Test Duration: 120 minutes. Open Book but Closed Notes. Calculators allowed!! This test contains five problems. Each of the five problems are equally weighted. All work should be done in the blue books provided. You must show all work for each problem to receive full credit. Do not return this test sheet, just return the blue books. 1

EE538 Digital Signal Processing I Final Exam Fall 2007 Problem 1. This problem deals with the properties of deterministic autocorrelation. (a) Consider the symmetric sequence below which is one for 2 m 2andzerofor m > 2. Is this is a valid autocorrelation sequence? Justify your answer. r xx [m] =u[m +2] u[m 3] (b) Consider the symmetric sequence below. Is this is a valid autocorrelation sequence? You need to explain your answer. r xx [m] =(3 m )(u[m +2] u[m 3]) (c) Let r xx [m] denote the autocorrelation sequence for the DT signal x[n]. Let y[n] = x[n n o ], where n o is an integer. Let r yy [m] denote the autocorrelation sequence for the DT signal y[n]. Derive an expression relating r yy [m] andr xx [m]. That is, how is r yy [m] related to r xx [m]? (d) Let r xx [m] denote the autocorrelation sequence for the DT signal x[n]. Let y[n] = e j(ω0n+θ) x[n], where ω o is some frequency and θ is some phase value. Let r yy [m] denote the autocorrelation sequence for the DT signal y[n]. Derive an expression relating r yy [m] andr xx [m]. That is, how is r yy [m] related to r xx [m]? (e) Consider that the signal x[n] below,wherea = 1, is the input to the LTI system 2 described by the difference equation in equation (2) below. x[n] =a n u[n] 1 a an 1 u[n 1] (1) y[n] = 1 y[n 1] + x[n] (2) 4 (i) Determine a closed-form analytical expression for the auto-correlation r xx [m] for x[n], when a = 1. (Hint: examine the Z-Transform of x[n].) 2 (ii) Determine a closed-form analytical expression for the cross-correlation r yx [m] between the input and output. (iii) Determine a closed-form analytical expression for the auto-correlation r yy [m] for the output y[n]. 2

Problem 2. [20 points] Consider the discrete-time complex-valued random process defined for all n: x[n] =A 1 e j(ω 1n+Θ 1 ) + A 2 e j(ω 2n+Θ 2 ) where the respective frequencies, ω 1 and ω 2, of the two complex sinewaves are deterministic but unknown constants. The amplitudes, A 1 and A 2, and the constant D are also deterministic but unknown constants. Θ 1 and Θ 2 are independent random variables with each uniformly distributed over a 2π interval. The values of the autocorrelation sequence for x[n], r xx [m] =E{x[n]x [n m]}, for three different lag values are given below. r xx [0] = 2, r xx [1] = 1 + j (1+ 2 1 ), r xx [2] = 1+j, (a) Determine the numerical values of ω 1 and ω 2. You have to use what you ve learned during the parametric spectral analysis portion of this course. You will be given no credit if you simply set up a system of equations to solve based on the form of r xx [m] = p i=1 A 2 i e jωim and solve this nonlinear system of equations. (b) Consider a first-order predictor ˆx[n] = a 1 (1)x[n 1] Determine the numerical values of the optimum predictor coefficient a 1 (1), and the numerical value of the corresponding minimum mean-square error E 1 min. (c) Consider a second-order predictor ˆx[n] = a 2 (1)x[n 1] a 2 (2)x[n 2] Determine the numerical values of the optimum predictor coefficients a 2 (1) and a 2 (2), and the numerical value of the corresponding minimum mean-square error E 2 min. (d) Consider a third-order predictor ˆx[n] = a 3 (1)x[n 1] a 3 (2)x[n 2] a 3 (3)x[n 3] Determine the numerical values of the optimum predictor coefficients a 3 (1), a 3 (2) and a 3 (3), and the numerical value of the corresponding minimum mean-square error E 3 min. 3

Problem 3. [20 pts] Consider an ARMA(1,1) process generated by passing the white noise random process ν[n], with r νν [m] =δ[m], through the LTI system described by the difference equation below having one pole and one zero. x[n] = a 1 x[n 1] + b 0 ν[n]+b 1 ν[n 1] You are given the first four values of the autocorrelation sqeuence for the output ARMA process x[n]. r xx [0] = 24 r xx [1] = 20 r xx [2] = 40/3 r xx [3] =?? (a) Determine the numerical value of the ARMA model parameter a 1 in the difference equation above. (b) Determine the numerical values of the optimum second-order linear prediction coefficients a 2 (1) and a 2 (2), and the value of the corresponding minimum mean-square error E (2) min. (c) Determine the numerical value of r xx [3]. (d) Determine the autocorrelation function r bb [m] for the sequence b[n] ={b 0,b 1 }. Even though you were not given the values of b 0 and b 1, you are given enough information to nonetheless determine the numerical values of r bb [ 1], r bb [0], and r bb [1]. Find these three values. (e) Determine a simple closed-form expression for the spectral density for x[n], S xx (ω), which may be expressed as the DTFT of r xx [m]: S xx (ω) = m= r xx [m]e jmω 4

Problem 4. [20 points] We wish to filter a data stream with a filter having the following impulse response h[n] =e j 2π N ln {u[n] u[n N]} where l is an integer between 0 and N 1. Convolution with this impulse response may be effected via the following difference equation y[n] = N 1 k=0 e j 2π N lk x[n k] This implementation requires N multiplications and N 1 additions per output point. (a) It can be shown that we can achieve exactly the same input-output (I/O) relationship via the following difference equation which requires only 1 multiplication and two additions per output point. y[n] =a 1 y[n 1] + x[n] x[n D] Determine the values of a 1 and D in terms of l and N so that this IIR system has exactly the same I/O relationship as the FIR filter above. (b) Consider the specific case of l =2andN =4: (i) State the numerical values of a 1 and D for this case so that the FIR filter and the IIR filter have the same I/O relationship. (ii) Plot the pole-zero diagram for the system. Show the region of convergence. (iii) Is this a lowpass, bandpass, or highpass filter? Briefly explain why. (iv) Plot the impulse response of the system (Stem plot). (c) Consider the difference equation below: y[n] = y[n 1] + x[n] x[n 4] Let the input x[n] be a stationary white noise process with variance σ 2 x =1. (i) Determine the autocorrelation sequence r yy [m] =E{y[n]y[n m]}. State the numerical values of r yy [m] form =0, 1, 2, 3 four answers needed. Is r yy [m] =0 for m>3? Why or why not? (ii) Determine the spectral density of y[n], S yy (ω), the DTFT of r yy [m] =E{y[n]y[n m]}. PlotS yy (ω) for π <ω<π. 5

Problem 5. [20 points] Consider the ARMA(1,1) process generated via the difference equation x[n] = a 1 x[n 1] + b 0 ν[n]+b 1 ν[n 1] where ν[n] is a stationary white noise process with variance σw 2 = 1. The autocorrelation sequence r xx [m] =E{x[n]x[n m]} is given by the following closed-form expression which holds for m from to : ( ) 2 m r xx [m] =30 6δ[m] 3 (a) Consider that the power spectrum of the ARMA(1,1) process x[n] is estimated via AR spectral estimation according to S xx (ω) = E (1) min 1+a (2) 1 e jω 2 Determine the respective numerical values of the optimum second-order linear prediction coefficient a (1) 1 and the value of the corresponding minimum mean-square error E (1) min. (b) Determine the numerical value of the coefficient a 1 in the difference equation above defining the LTI system that the white noise was passed through to generate the ARMA(1,1) process x[n]. (c) With the value of a 1 determined from part (b), determine the deterministic autocorrelation sequence r aa [m] for the length two sequence a[n] ={1,a 1 }. Determine the numerical values of the three nonzero values: r aa [ 1], r aa [0], and r aa [1]. (d) Convolve r aa [m] withr xx [m] toformr bb [m]. List the numerical values of r bb [m] = r xx [m] r aa [m] for all m. (e) Determine a simple closed-form expression for the spectral density for x[n], S xx (ω), which may be expressed as the DTFT of r xx [m]: S xx (ω) = m= r xx [m]e jmω 6