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

Similar documents
ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

Discrete-Time Fourier Transform (DTFT)

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

Review of Fundamentals of Digital Signal Processing

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

Discrete Time Systems

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

Review of Discrete-Time System

Discrete Time Fourier Transform

Discrete Time Systems

EEL3135: Homework #4

EC Signals and Systems

Solutions: Homework Set # 5

Discrete-Time Signals and Systems. The z-transform and Its Application. The Direct z-transform. Region of Convergence. Reference: Sections

Chap 2. Discrete-Time Signals and Systems

Digital Control & Digital Filters. Lectures 1 & 2

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

ECE503: Digital Signal Processing Lecture 4

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

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

Review of Fundamentals of Digital Signal Processing

Digital Signal Processing Lecture 3 - Discrete-Time Systems

Digital Signal Processing. Midterm 1 Solution

UNIVERSITY OF OSLO. Faculty of mathematics and natural sciences. Forslag til fasit, versjon-01: Problem 1 Signals and systems.

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

EE 521: Instrumentation and Measurements

Z-TRANSFORMS. Solution: Using the definition (5.1.2), we find: for case (b). y(n)= h(n) x(n) Y(z)= H(z)X(z) (convolution) (5.1.

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

Lecture 04: Discrete Frequency Domain Analysis (z-transform)

ECGR4124 Digital Signal Processing Exam 2 Spring 2017

ESE 531: Digital Signal Processing

Lecture 7 Discrete Systems

EECE 301 Signals & Systems Prof. Mark Fowler

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

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) =

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

VI. Z Transform and DT System Analysis

Signals and Systems Lecture 8: Z Transform

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

6.003: Signals and Systems

ECE503: Digital Signal Processing Lecture 5

Very useful for designing and analyzing signal processing systems

Analog vs. discrete signals

ECGR4124 Digital Signal Processing Final Spring 2009

ESE 531: Digital Signal Processing

Signals & Systems Handout #4

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

Multidimensional digital signal processing

log dx a u = log a e du

ECE-314 Fall 2012 Review Questions for Midterm Examination II

Transform Analysis of Linear Time-Invariant Systems

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

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

X (z) = n= 1. Ã! X (z) x [n] X (z) = Z fx [n]g x [n] = Z 1 fx (z)g. r n x [n] ª e jnω

Solutions. Number of Problems: 10

Digital Filters Ying Sun

EE 224 Signals and Systems I Review 1/10

Discrete-Time David Johns and Ken Martin University of Toronto

Lecture 14: Windowing

Discrete-Time Signals and Systems. Frequency Domain Analysis of LTI Systems. The Frequency Response Function. The Frequency Response Function

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

Z Transform (Part - II)

Discrete-time signals and systems

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

Solutions. Number of Problems: 10

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

ECGR4124 Digital Signal Processing Midterm Spring 2010

EE482: Digital Signal Processing Applications

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

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

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

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

Discrete Time Fourier Transform (DTFT)

Multimedia Signals and Systems - Audio and Video. Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2

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

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

Stability Condition in Terms of the Pole Locations

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

Overview of Discrete-Time Fourier Transform Topics Handy Equations Handy Limits Orthogonality Defined orthogonal

Digital Signal Processing Lecture 4

Complex symmetry Signals and Systems Fall 2015

EE102B Signal Processing and Linear Systems II. Solutions to Problem Set Nine Spring Quarter

ECE 8440 Unit 13 Sec0on Effects of Round- Off Noise in Digital Filters

z-transform Chapter 6

EE 438 Essential Definitions and Relations

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

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

x[n] = x a (nt ) x a (t)e jωt dt while the discrete time signal x[n] has the discrete-time Fourier transform x[n]e jωn

Use: Analysis of systems, simple convolution, shorthand for e jw, stability. Motivation easier to write. Or X(z) = Z {x(n)}

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

# FIR. [ ] = b k. # [ ]x[ n " k] [ ] = h k. x[ n] = Ae j" e j# ˆ n Complex exponential input. [ ]Ae j" e j ˆ. ˆ )Ae j# e j ˆ. y n. y n.

Discrete Fourier Transform

Problem Value

Solutions. Number of Problems: 10

6.003 Signal Processing

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

LECTURE NOTES DIGITAL SIGNAL PROCESSING III B.TECH II SEMESTER (JNTUK R 13)

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

Frequency-Domain C/S of LTI Systems

6.003 Signal Processing

Transcription:

ECE-486 Test 2, Feb 23, 2017 2 Hours; Closed book; Allowed calculator models: (a) Casio fx-115 models (b) HP33s and HP 35s (c) TI-30X and TI-36X models. Calculators not included in this list are not permitted. Your solutions for time-domain waveforms should all be expressed as real-valued functions. Name : 1. (10%) A continuous-time signal x c (t) is given by x c (t) = 5 cos(2π(10 3 )t) + 2 cos(2π(8 10 3 )t) The signal is sampled at 10 ksps to give a discrete-time signal x[n] (a) Give the equation of x[n]: (b) List all discrete-time frequencies between 0.5 and +0.5 that are present in x[n]: A different signal y[n] is formed by sampling a continuous-time sinusoidal signal y c (t) (still at 10 ksps). The sampled sequence is given by y[n] = 3 cos(0.4πn) (c) Considering the possibility of aliasing, find all of the possible frequencies of the signal y c (t).

2. (25%) A causal discrete-time system is described by y[n] + 2y[n 1] + 3 y[n 2] = 2x[n] + 4x[n 1] 4 (a) Find Y (z) if x[n] = (0.1) n u[n] and y[ 1] = 12, y[ 2] = 8. (No need to evaluate y[n].) (b) Find the system gain H(z), and plot the pole-zero diagram for the system. Shade the appropriate region of convergence on your plot. (c) Find the impulse response of the system. (Please provide a closed-form equation for your result.) (d) Is this a stable system? (justify) (e) Evaluate the DC gain of the system.

Work space for Problem 2

3. (15%) The system of problem 2 is repeated here: y[n] + 2y[n 1] + 3 y[n 2] = 2x[n] + 4x[n 1] 4 (a) By direct substitution into the difference equation, evaluate the first three samples of the impulse response (n = 0, 1, 2). (Hopefully, your result agrees with problem 2c.) (b) Draw a block diagram of the Direct-Form II implementation of this system. (c) Draw a block diagram of the Direct-Form II Transposed implementation of this system.

4. (15%) Find x[n] for the given z-transform. X(z) = 3z z 0.5 + 4 z 3 + z 2 + z z 2 + z + 0.9 0.9 < z < 3

5. (15%) Design a real, causal second-order IIR filter which meets all of the following constraints. Provide a list of the (real-valued) a 0, a 1, a 2, b 0, b 1, b 2 coefficients for your filter. Causal and Stable. Completely rejects f =.375 cycles/sample. Provides a clear frequency-response peak at f = 0.25 cycles/sample. Has a DC gain of 1.0 (0 db).

6. (20%) A time-invariant discrete-time system has transfer function H(z) = (z + 1)(z 1 + 1), z 0 (a) Find the system impulse response. (b) Give a difference equation description of the system. (c) Is this an FIR or an IIR system? (Justify) (d) Is this a stable system? (Justify) (e) Is this a causal system? (Justify) (f) Find and plot H(f) for 0.5 < f < 0.5. (g) Using H(f), find the system output y[n] when the input signal is x[n] = 3 sin(2π(0.1)n).

General Definitions X(z) = x[n] = 1 2πj X + (z) = x[n] = 1 2πj Linear Systems y[n] = x[n] h[n] = X(ω) = x[n] = 1 2π k= Y (z) = X(z)H(z) Transform Properties n= x[n]z n X(z)z n 1 dz x[n]z n n=0 X + (z)z n 1 dz, n 0 n= π π Double-Sided Z-Transforms x[n]e jωn X(ω)e jωn dω x[k]h[n k] = k= Y (ω) = X(ω)H(ω) h[k]x[n k] Transform Pairs Double-Sided Z-Transforms δ[n] 1 a n u[n] z z a = 1, z > a 1 az 1 a n u[ n 1] z z a = 1, z < a 1 az 1 na n u[n] na n u[ n 1] a n cos(ω 0 n) u[n] a n sin(ω 0 n) u[n] DTFT ( in the limit ) u[n] e jω0n az (z a) 2 = az 1 (1 az 1, z > a ) 2 az (z a) 2 = az 1 (1 az 1, z < a ) 2 1 az 1 cos(ω 0 ) 1 2az 1 cos(ω 0 ) + a 2, z > a z 2 az 1 sin(ω 0 ) 1 2az 1 cos(ω 0 ) + a 2, z > a z 2 ejω e jω 1 + k= k= πδ(ω 2πk) 2πδ(ω ω 0 2πk) a 1 x 1 [n] + a 2 x 2 [n] a 1 X 1 (z) + a 2 X 2 (z) x[n k] z k X(z) a n x[n] X(z/a) x[n] h[n] X(z)H(z) Single-Sided Z-Transforms Power Series n=0 n=0 x n = 1 1 x x < 1 x n n! = ex x < x[n k] z k X + (z)+x[ k]+x[ k+1]z 1 + +x[ 1]z k+1 x[n + k] z k X + (z) x[k 1]z x[k 2]z 2 x[0]z k DTFT x 1 [n]x 2 [n] 1 2π e jω0n x[n] X(ω ω 0 ) π π X 1 (λ)x 2 (ω λ)dλ General (Standard Trig Identities will be furnished on request) θ 0 π/6 π/4 π/3 π/2 sin(θ) 0 1/2 1/ 2 3/2 1 cos(θ) 1 3/2 1/ 2 1/2 0 tan(θ) 0 1/ 3 1 3 ax 2 + bx + c = 0 = x = b ± b 2 4ac 2a