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

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

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

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

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

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

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

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

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

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

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

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

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

Computer Engineering 4TL4: Digital Signal Processing

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

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

Solutions. Number of Problems: 10

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

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

Problem Value Score No/Wrong Rec

Digital Signal Processing. Midterm 1 Solution

EEL3135: Homework #4

LTI Systems (Continuous & Discrete) - Basics

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

2A1H Time-Frequency Analysis II

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

CHAPTER 2 RANDOM PROCESSES IN DISCRETE TIME

Question Paper Code : AEC11T02

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

Chap 2. Discrete-Time Signals and Systems

ELEN 4810 Midterm Exam

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

University Question Paper Solution

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

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

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

Stability Condition in Terms of the Pole Locations

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

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

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING Final Examination - Fall 2015 EE 4601: Communication Systems

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

NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY DEPARTMENT OF ELECTRONICS AND TELECOMMUNICATIONS

GATE EE Topic wise Questions SIGNALS & SYSTEMS

Introduction to DSP Time Domain Representation of Signals and Systems

Problem Value

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

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

LOPE3202: Communication Systems 10/18/2017 2

Solutions. Number of Problems: 10

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

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

Lab 4: Quantization, Oversampling, and Noise Shaping

Problem Value Score No/Wrong Rec 3

Communications and Signal Processing Spring 2017 MSE Exam

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

3.2 Complex Sinusoids and Frequency Response of LTI Systems

ECE-314 Fall 2012 Review Questions for Midterm Examination II

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

ENSC327 Communications Systems 2: Fourier Representations. School of Engineering Science Simon Fraser University

2.161 Signal Processing: Continuous and Discrete Fall 2008

Final Exam January 31, Solutions

EE 224 Signals and Systems I Review 1/10

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

ENSC327 Communications Systems 2: Fourier Representations. Jie Liang School of Engineering Science Simon Fraser University

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

Massachusetts Institute of Technology

Signals and Spectra (1A) Young Won Lim 11/26/12

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.

Module 3. Convolution. Aim

EE482: Digital Signal Processing Applications

Q1 Q2 Q3 Q4 Q5 Total

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

Problem Value

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

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

Problem Value

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

Ch.11 The Discrete-Time Fourier Transform (DTFT)


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

E : Lecture 1 Introduction

UCSD ECE 153 Handout #46 Prof. Young-Han Kim Thursday, June 5, Solutions to Homework Set #8 (Prepared by TA Fatemeh Arbabjolfaei)

Communication Theory II

ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin

Module 1: Signals & System

EE482: Digital Signal Processing Applications

ECE 636: Systems identification

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

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

Interchange of Filtering and Downsampling/Upsampling

Good Luck. EE 637 Final May 4, Spring Name: Instructions: This is a 120 minute exam containing five problems.

The Discrete-Time Fourier

EE482: Digital Signal Processing Applications

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

Analog vs. discrete signals

Discrete Time Fourier Transform (DTFT)

Discussion Section #2, 31 Jan 2014

Chapter 7: The z-transform

Stochastic Processes. M. Sami Fadali Professor of Electrical Engineering University of Nevada, Reno

Solutions. Number of Problems: 10

Name of the Student: Problems on Discrete & Continuous R.Vs

Transcription:

EE538 Final Exam Fall 005 3:0 pm -5:0 pm PHYS 3 Dec. 17, 005 Cover Sheet Test Duration: 10 minutes. Open Book but Closed Notes. Calculators ARE 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 005 Problem 1. [0 points] Consider the transmission of a pulse amplitude-modulated signal x(t) = k= b[k]p(t kt o ) where b[n] is a zero-mean, stationary, discrete-time random process with Eb[n]b[n m]} = δ[m]. For any discrete-time n, b[n] is a random variable equal to either +1 or -1 with equal probability. 1/T o is the bit rate and p(t) is the pulse symbol waveform below p(t) = 1 T o T o t } u(t + T o ) u(t T o )} At the receiver, x(t) arrives by both a direct path and a multipath reflection having the same strength as the direct path but at a delay of T o and phase-shifted by θ. Denoting continuous time convolution as, the received signal, y(t), may be modeled as: y(t) = x(t) g(t) where g(t) is described below using δ(t) to denote the Dirac Delta function. g(t) = δ(t) + e j π δ (t To ) (1) Sampling y(t) at the bit rate, F s = 1 T o, it is easily shown that the resulting sequence y[n] = y(nt o ) may be modeled as having been generated by the following discrete-time system. symbol sequence b[n] h [n] y [n]= y (n T ) o Determine a closed-form expression for the autocorrelation sequence r yy [m] for y[n] = y(nt o ) AND plot the corresponding spectral density S yy (ω) = r yy [m]e jωm over π ω π. n= S yy (ω) will be exactly equal to zero for one specific value of ω. Determine this frequency.

GIVEN NOBLE s FIRST IDENTITY TO USE IN PROBLEM. If E(ω) in Figure 3(b) satsifies E(ω) = G(Mω), the I/O relationship of the system in Figure 3(b) is exactly the same as the I/O relationship of the system in Figure 3(a). You are GIVEN this as Noble s First Identity to use in Problem below. G (ω) M M E (ω) Figure 3(a). Figure 3(b). Problem. [0 points] υ[n] sin( h [n]= π n) π n LP n sin( π n) h [ n]= (-1) HP π n Figure 4(a). h [ n]= cos( π n) BP sin( π 8 n) π n x[n] 8 h [n]=?? a Figure 4(b). (a) Determine the impulse response h a [n] in Figure 4(b) so that the I/O relationship of the system in Figure 4(b) is exactly the same as the I/O relationship of the system in Figure 4(a). Plot the magnitude of the DTFT of h a [n] over π < ω < π. (b) Given that the input ν[n] is a zero-mean, stationary, discrete-time real-valued random process with Eν[n]ν[n m]} = δ[m]. Determine the autocorrelation sequence r xx [m] for the output random process x[n] and plot the corresponding spectral density S xx (ω) = r xx [m]e jωm over π ω π. n= (c) x[n] is predicted in terms of one past output value according to ˆx[n] = a 1 (1)x[n 1]. What is the value of a 1 (1) that minimizes the mean square value of the prediction error? What is the numerical value of the minimum mean-square prediction error? (d) x[n] is predicted in terms of two past values according to ˆx[n] = a (1)x[n 1] a ()x[n ]. What are the values of a (1) and a (1) that minimize the mean square value of the prediction error? What is the value of the minimum mean-square prediction error? NOTE: and π can be carried along as constants in your answer. 3

Problem 3. [0 pts] A discrete-time system of the form y[n] = a 1 y[n 1] a y[n ] b 0 x[n] b 1 x[n 1] has a corresponding impulse response of the form h[n] = c 1 (p 1 ) n u[n] + c (p ) n u[n] where u[n] is the discrete-time unit step sequence. You are given the first four values of this infinite length impulse response (IIR) below. (Note: h[n] is generally nonzero for n > 3.) h[0] = 35 h[1] = 13 h[] = 5 h[3] = (a) Determine the respective numerical values of the two poles p 1 and p. (b) Determine the numerical values of the two multiplicative constants c 1 and c. (c) Draw a block diagram of a linear time-invariant (LTI) discrete-time system whose impulse response is h[n]. You are only allowed to have TWO unit delay blocks. NOTE: Trying to set up four equations in four unknowns in the straightforward manner that first comes to mind leads to a system of equations involving a cubic equation in two unknowns. This is NOT the way to solve the problem and does not use any signal processing knowledge or background. You will not receive any points for taking this approach. 4

Problem 4. [0 pts] Consider a discrete-time random process composed of TWO complex sinewaves expressed as x[n] = A 1 e j(ω 1n+Φ 1 ) + A e j(ω n+φ ) where the amplitudes A 1 and A are unknown but deterministic constants, the frequencies ω 1 and ω are unknown but deterministic constants, and the respective phases Φ 1 and Φ are i.i.d. random variables with a uniform distribution over [0, π). The autocorrelation sequence is defined as r xx [m] = Ex[n]x [n m]} For a specific set of amplitudes and frequencies (unknown to you), you are given the values of the autocorrelation sequence for lag values m = 0, m = 1, and m =. (Note: r xx [m] is generally nonzero for m >.) r xx [0] = r xx [1] = j r xx [] = 0 r xx [3] =?? (a) Determine the respective numerical values of the two frequencies ω 1 and ω. (b) Determine the numerical value of r xx [3]. (c) The spectral density, S xx (ω), is the Discrete-Time Fourier Transform (DTFT) of r xx [m]. Plot S xx (ω) over π < ω < π. NOTE: Again, trying to set up four equations in four unknowns in the straightforward manner that first comes to mind is NOT the way to solve the problem. You will not receive any points for taking this approach. 5

Problem 5. [0 points] Consider the ARMA(,) process generated via the difference equation x[n] = 1 x[n ] + ν[n] 4ν[n ] 4 where ν[n] is a stationary white noise process with variance σ ν =. (a) Determine a simple, closed-form expression for the autocorrelation sequence r xx [m] = Ex[n]x[n m]} which holds for < m <. (b) 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]. Plot S xx (ω) for π < ω < π. (c) Consider that the power spectrum of the ARMA(,) process x[n] is estimated via AR spectral estimation according to S xx (ω) = E (1) min 1 + a 1 (1)e jω Determine the respective numerical values of the optimum first-order linear prediction coefficient a 1 (1) and the value of the corresponding minimum mean-square error E (1) min. (d) Consider that the power spectrum of the ARMA(,) process x[n] is estimated via AR spectral estimation according to S xx (ω) = E min () 1 + a (1)e jω + a ()e jω Determine the respective numerical values of the optimum second-order linear prediction coefficients a 1 () and a () and the value of the corresponding minimum meansquare error E () min. 6