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

Similar documents
Solutions: Homework Set # 5

EEL3135: Homework #4

z-transform Chapter 6

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

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

Lecture 18: Stability

ELEG 305: Digital Signal Processing

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

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.

Stability Condition in Terms of the Pole Locations

Digital Signal Processing

# 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.

The Z transform (2) 1

Let H(z) = P(z)/Q(z) be the system function of a rational form. Let us represent both P(z) and Q(z) as polynomials of z (not z -1 )

Lecture 16: Zeros and Poles

SIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals

Z Transform (Part - II)

ECE-314 Fall 2012 Review Questions for Midterm Examination II

Signals and Systems. Spring Room 324, Geology Palace, ,

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

ECGR4124 Digital Signal Processing Exam 2 Spring 2017

ESE 531: Digital Signal Processing

EE482: Digital Signal Processing Applications

Chapter Intended Learning Outcomes: (i) Understanding the relationship between transform and the Fourier transform for discrete-time signals

Digital Signal Processing

Chap 2. Discrete-Time Signals and Systems

Ch. 7: Z-transform Reading

Digital Signal Processing:

Review of Fundamentals of Digital Signal Processing

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

Very useful for designing and analyzing signal processing systems

EECE 301 Signals & Systems Prof. Mark Fowler

UNIT-II Z-TRANSFORM. This expression is also called a one sided z-transform. This non causal sequence produces positive powers of z in X (z).

(i) Represent discrete-time signals using transform. (ii) Understand the relationship between transform and discrete-time Fourier transform

Z-Transform. 清大電機系林嘉文 Original PowerPoint slides prepared by S. K. Mitra 4-1-1

ECE503: Digital Signal Processing Lecture 5

DSP-I DSP-I DSP-I DSP-I

ESE 531: Digital Signal Processing

Responses of Digital Filters Chapter Intended Learning Outcomes:

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

Chapter 7: The z-transform

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

Course and Wavelets and Filter Banks. Filter Banks (contd.): perfect reconstruction; halfband filters and possible factorizations.

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

PROBLEM SET 3. Note: This problem set is a little shorter than usual because we have not covered inverse z-transforms yet.

Discrete Time Systems

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

Lecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE

ECE503: Digital Signal Processing Lecture 4

Discrete-Time Fourier Transform (DTFT)

Signals and Systems Lecture 8: Z Transform

Discrete-time signals and systems

7.17. Determine the z-transform and ROC for the following time signals: Sketch the ROC, poles, and zeros in the z-plane. X(z) = x[n]z n.

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

Damped Oscillators (revisited)

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

ECGR4124 Digital Signal Processing Final Spring 2009

6.003: Signals and Systems

Transform Analysis of Linear Time-Invariant Systems

Solutions. Number of Problems: 10

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

Discrete-time Signals and Systems in

ECE-S Introduction to Digital Signal Processing Lecture 4 Part A The Z-Transform and LTI Systems

Digital Signal Processing Lecture 8 - Filter Design - IIR

Signal Processing First Lab 11: PeZ - The z, n, and ˆω Domains

EECE 301 Signals & Systems Prof. Mark Fowler

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

Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.

Module 4 : Laplace and Z Transform Problem Set 4

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ω

Determine the Z transform (including the region of convergence) for each of the following signals:

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

VI. Z Transform and DT System Analysis

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.

Frequency Response of Discrete-Time Systems

y[n] = = h[k]x[n k] h[k]z n k k= 0 h[k]z k ) = H(z)z n h[k]z h (7.1)

Review of Fundamentals of Digital Signal Processing

Module 4 : Laplace and Z Transform Lecture 36 : Analysis of LTI Systems with Rational System Functions

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

Need for transformation?

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

Digital Control & Digital Filters. Lectures 1 & 2

Computer Engineering 4TL4: Digital Signal Processing

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

ENGG1015 Homework 3 Question 1. ENGG1015: Homework 3

Digital Signal Processing. Midterm 1 Solution

summable Necessary and sufficient for BIBO stability of an LTI system. Also see poles.

Multidimensional digital signal processing

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

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

Review of Discrete-Time System

EE-210. Signals and Systems Homework 7 Solutions

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

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

Z-Transform. x (n) Sampler

EC Signals and Systems

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

The Z-Transform. Fall 2012, EE123 Digital Signal Processing. Eigen Functions of LTI System. Eigen Functions of LTI System

Topic 4: The Z Transform

DIGITAL SIGNAL PROCESSING. Chapter 3 z-transform

Transcription:

EE02B Signal Processing and Linear Systems II Solutions to Problem Set Nine 202-203 Spring Quarter Problem 9. (25 points) (a) 0.5( + 4z + 6z 2 + 4z 3 + z 4 ) + 0.2z 0.4z 2 + 0.8z 3 x[n] 0.5 y[n] -0.2 Z - 2.0 0.4 Z - 3.0-0.8 Z - 2.0 Z - 0.5 (b) ( + z 2 )( 0.8z 2 ) ( 0.64z 2 )( + z + 0.8z 2 ) x[n] y[n] Z - Z - -.0 Z - Z - 0.64 Z - Z - -0.8-0.8

Problem 9.2 (25 points) (a) y[n] = y[n 5] + x[n] y[n] + y[n 5] = x[n] (b) Y (z) + z 5 Y (z) = X(z) + z 5 Poles are values of z such that + z 5 = 0, or z 5 = e jπ. Therefore the poles are z k = e jπ(2k+)/5 for k = 0,, 2, 3, 4. Also note e j9π/5 = e jπ/5 and e j7π/5 = e j3π/5, so the poles can be simplified to z = e ±jπ/5, e ±j3π/5, e jπ. We can therefore express H(z) as: ( e jπ/5 z )( e jπ/5 z )( e j3π/5 z )( e j3π/5 z )( e jπ z, ROC: z > ) Since all of these poles are on the unit circle, the two possible regions of convergence are the areas inside and ouside the unit circle. Since the system is causal, the area outside the unit circle is the correct ROC. There are 5 zeros at z = 0. 0.8 0.6 0.4 Imaginary Part 0.2 0 0.2 0.4 0.6 0.8 0.5 0 0.5 Real Part 5 The white region is the ROC and the gray region is outside the ROC. (c) The system is not stable since the ROC does not contain the unit circle. 2

(d) This can be solved using the difference equation: y[n] = y[n 5] + x[n] By repeatedly using the formula above on x[n] we see that: y[n] = ( ) k (δ[n 5k] + δ[n 5k]) k=0 Alternatively, we can solve this in the z-domain using the formula for a geometric series: + z 5 = ( ) k z 5k z > h[n] = y[n] = h[n] x[n] = k=0 ( ) k δ[n 5k] k=0 ( ) k (δ[n 5k] + δ[n 5k]) k=0 n = 0:20; yy = filter(,[,0,0,0,0,],[, zeros(,20)]); stem(n,yy); 0.8 0.6 0.4 0.2 y[n] 0 0.2 0.4 0.6 0.8 0 5 0 5 20 n (e) From the above formula, the period is 0 samples. 3

Problem 9.3 (25 points) (a) h[n] = r n cos(ˆω 0 n + θ)u[n] h[n] = 2 rn (e j ˆω 0n+jθ + e j ˆω 0n jθ )u[n] h[n] = 2 ejθ r n e j ˆω 0n u[n] + 2 e jθ r n e j ˆω 0n u[n] (b) 2 ejθ re j ˆω 0 z + 2 e jθ re j ˆω 0 z ROC: z > r 2 ejθ ( re j ˆω 0 z ) + 2 e jθ ( re j ˆω 0 z ) ( re j ˆω 0 z )( re j ˆω 0 z ) cos(θ) r cos(ˆω 0 θ)z ( re j ˆω 0 z )( re j ˆω 0 z ) ROC: z > r ROC: z > r The poles are at z = re ±j ˆω 0 and the zeroes are at z = r cos(ˆω 0 θ) cos(θ), z = 0. r = 0.8, ˆω 0 = 2π/3, θ = 0 in the figure below: 0.8 0.6 0.4 Imaginary Part 0.2 0 0.2 0.4 0.6 0.8 0.5 0 0.5 Real Part The white region is the ROC and the gray region is outside the ROC. 4

(c) The DTFT exists if the time-domain sequence is absolute summable: sufficient condition is when r <. (d) n= x[n] <. A Since the system is causal, for the system to be stable the poles must be within the unit circle, so the sufficient and necessary condition is r <. (e) cos(θ) r cos(ˆω 0 θ)z 2r cos(ˆω 0 )z + r 2 ROC: z > r z 2 y[n] = 2r cos(ˆω 0 )y[n ] r 2 y[n 2] + cos(θ)x[n] r cos(ˆω 0 θ)x[n ] y[n] = 0.8y[n ] 0.64y[n 2] 0.5x[n] + 0.4x[n ] 5

Problem 9.4 (25 points) PZ- looks approximately like: h[n] = z ( re j ˆω 0 z )( re j ˆω 0 z ) r(e j ˆω 0 e j ˆω 0) (r n e jnˆω 0 u[n] r n e jnˆω 0 u[n]) h[n] = rn sin(nˆω 0 ) u[n] sin(ˆω 0 ) h[n] will oscillate and die out slowly. The oscillation frequency is approximately ˆω 0 = π/3, therefore the period of the oscillation should be around 6. Thus PZ- matches IR-N PZ-2 looks approximately like: + z rz h[n] = r δ[n] + ( + r )rn u[n] Since there is only one pole, h[n] decays but does not oscillate. The zero at z = means h[n] is not just an exponential decay, so PZ-3 does not match IR-L. Thus PZ-2 matches IR-M PZ-3 looks approximately like: z ( r)z h[n] = r δ[n] + ( + r )( r)n u[n] Since there is only one pole, h[n] decays but does not oscillate. However, it does alternate in sign because the pole is at negative z. Thus PZ-3 matches IR-J PZ-4 looks approximately like: rz h[n] = r n u[n] This decays but does not oscillate, so PZ-4 matches IR-L 6

Problem 9.5 (25 points) PZ- is a highpass filter, so PZ- matches FR-D PZ-2 has a pole at around z = 0.5, which gives a slight peak at ˆω = 0 and then falls off slowly. Thus PZ-2 matches FR-B PZ-3 has a pole at approximately z = 0.9 and a zero at z =. This should give a lowpass frequency response with H(e jπ ) = 0, so PZ-3 matches FR-A PZ-4 is a bandpass filter. Since the poles have angles less than π/4, PZ-4 matches FR-E (and not FR-C) 7

Problem 9.6 (0 points) (a) We use approach #2: Step #: Find X(z) Step #2: Find H(z) Step #3: Find Y (z) = X(z)H(z) Step #4: Find y[n] Y (z) = Y (z) = X(z) = ROC: z > z + z 2 ROC: z > 0.8 0.8z + z 2 ( 0.8z )( z ) + z 2 (.8z + 0.8z 2 ) ROC: z > ROC: z > To have a lower order of numerator than denominator in z, we do polynomial long division: 0.8z 2.8z + 0.8 z 2 +0z + z 2 2.25z +.25 +2.25z 0.25 Thus: Y (z) =.25 + 0.25 + 2.25z ( 0.8z )( z ) ROC: z > Y (z) =.25 + 0.25 0 + ROC: z > 0.8z z y[n] =.25δ[n] 0.25 0.8 n u[n] + 0u[n] 8

(b) We use a special approach using an identity that we have: Step #: FindH(e j ˆω ) Step #2: Use identity y[n] = H(e j ˆω 0 ) cos(ˆω 0 n + θ + H(e j ˆω 0 )) when x[n] = cos(ˆω 0 n + θ),0 ˆω 0 < π + e 2j0.25π 0.8e j0.25π H(e j ˆω ) = + e 2j ˆω 0.8e j ˆω + e 2j0.5π 0.8e j0.5π = 0 + e 2j0.5π =.98, = 0.542π 0.8e j0.5π y[n] = 0 +.98 cos(0.25πn π 0.542π) (c) Since x[n] is so short and y[n] only depends on one previous y[n], we use approach #: Step #: Compute successive y[n] by hand until we see a pattern. Step #2: Write a formula for the remaining y[n]. y[n] = 0.8y[n ] + x[n] + x[n 2] By inspection: y[n] = 0 n < 5 y[n] = 0 + 0 + 0 n = 5 y[n] = 8 + 0 + 0 n = 6 y[n] = 6.4 + 0 + 0 n = 7 y[n] = 0.8 (n 7) 6.4 n > 7 (d) We use approach #, which has O(N) complexity (where N is the length of the input signal). Step #: Compute y[n] from x[n] using MATLAB s filter() function. yy=filter([,0,],[,-0.8],xx); 9