Solutions: Homework Set # 5

Similar documents
z-transform Chapter 6

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

Z Transform (Part - II)

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

Topic 4: The Z Transform

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

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

ECE503: Digital Signal Processing Lecture 4

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

Digital Signal Processing. Midterm 1 Solution

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

Very useful for designing and analyzing signal processing systems

Lecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE

EEL3135: Homework #4

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.

VI. Z Transform and DT System Analysis

ELEG 305: Digital Signal Processing

ESE 531: Digital Signal Processing

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

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

DIGITAL SIGNAL PROCESSING. Chapter 3 z-transform

Signals & Systems Handout #4

2. Typical Discrete-Time Systems All-Pass Systems (5.5) 2.2. Minimum-Phase Systems (5.6) 2.3. Generalized Linear-Phase Systems (5.

Stability Condition in Terms of the Pole Locations

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

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

ESE 531: Digital Signal Processing

Discrete-Time Fourier Transform (DTFT)

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

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

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ω

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

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

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

EE-210. Signals and Systems Homework 7 Solutions

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

Discrete Time Systems

Digital Control & Digital Filters. Lectures 1 & 2

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

The Z transform (2) 1

Review of Discrete-Time System

Transform Analysis of Linear Time-Invariant Systems

ECE503: Digital Signal Processing Lecture 5

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)

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

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

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

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

EE 521: Instrumentation and Measurements

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science. Fall Solutions for Problem Set 2

Signals and Systems Lecture 8: Z Transform

Digital Signal Processing:

Lecture 7 Discrete Systems

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.

ECE 438 Exam 2 Solutions, 11/08/2006.

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

Signal Analysis, Systems, Transforms

The Z transform (2) Alexandra Branzan Albu ELEC 310-Spring 2009-Lecture 28 1

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

Discrete Time Systems

6.003: Signals and Systems

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

If every Bounded Input produces Bounded Output, system is externally stable equivalently, system is BIBO stable

Chapter 7: The z-transform

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 )

GATE EE Topic wise Questions SIGNALS & 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.

Review of Fundamentals of Digital Signal Processing

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

2.161 Signal Processing: Continuous and Discrete Fall 2008

Digital Signal Processing Lecture 3 - Discrete-Time Systems

Need for transformation?

SIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals

Review of Fundamentals of Digital Signal Processing

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

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

Lecture 14: Minimum Phase Systems and Linear Phase

Digital Signal Processing

Digital Signal Processing, Homework 1, Spring 2013, Prof. C.D. Chung

Z-Transform. x (n) Sampler

Module 4 : Laplace and Z Transform Problem Set 4

Digital Filters Ying Sun

8. z-domain Analysis of Discrete-Time Signals and Systems

SEL4223 Digital Signal Processing. Inverse Z-Transform. Musa Mohd Mokji

3.1. Determine the z-transform, including the region of convergence, for each of the following sequences: N, N::: n.

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

Solutions. Number of Problems: 10

ELEN E4810: Digital Signal Processing Topic 4: The Z Transform. 1. The Z Transform. 2. Inverse Z Transform

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

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

ECGR4124 Digital Signal Processing Exam 2 Spring 2017

Lecture 18: Stability

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

Multidimensional digital signal processing


Chap 2. Discrete-Time Signals and Systems

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

University of Waterloo Department of Electrical and Computer Engineering ECE 413 Digital Signal Processing. Spring Home Assignment 2 Solutions

EECE 301 Signals & Systems Prof. Mark Fowler

Question Paper Code : AEC11T02

Transcription:

Signal Processing for Communications EPFL Winter Semester 2007/2008 Prof. Suhas Diggavi Handout # 22, Tuesday, November, 2007 Solutions: Homework Set # 5 Problem (a) Since h [n] = 0, we have (b) We can immediately write down h[n] = h 2 [n] (δ[n] + h [n]) = α n u[n] (δ[n] + βδ[n ]) = α n u[n] + βα n u[n ]. α n z n + β α n z n. n=0 The first term clearly converges to αz if αz <. The second term can be written as Hence, β α n z n n= and the ROC is z > α. (c) We know that = β n= α k z k k=0 = βz α k z k k=0 = βz αz, if αz <. + βz αz, Y (z) = X(z)H(z) Y (z) = X(z) + βz αz Y (z)( αz ) = X(z)( + βz ) y[n] αy[n ] = x[n] + βx[n ], where the last line follows from the fact that z X(z) is the Z-transform of x[n ] for any signal x[n]. (d) Yes, the system is causal, because h[n] = 0 for all n < 0.

(e) Note that the ROC of the system function is z > α. Since α <, we see that the ROC contains the unit circle, and therefore, the DTFT is summable and the system is stable. (f) Here, the functions h [n], h 2 [n] and h [n] are not the same as in parts (a) through (e). Since h [n] is non-zero, it is difficult to write down the transfer function h[n] directly. It is easier to derive the difference equation as follows. Thus, the difference equation is y[n] = (x[n] + 2x[n ] + y[n ]) h 2[n] = 2 x[n ] + x[n 2] + y[n 2]. y[n] y[n 2] = x[n ] + x[n 2]. 2 From this, we can easily find the Z-transform of h[n]: 2 z + z 2 z 2. Now all we need to do is take the inverse Z-transform of H(z) to find h[n]. To do this, we first note that the degree of the numerator and the denominator are equal. Hence, we can apply a long division to reduce the degree of the numerator: (z 2 + 2 z ) : ( z 2 + ) = + + 2 z z 2. To be able to take the inverse Z-transform, we need to simplify the degree-2 term in the denominator. We use partial fraction expansion to do so. The poles of H(z) are the zeros of z 2, which are p = and p 2 =. Hence, z 2 = ( p z )( p 2 z ) = ( z )( + z ). We then find A and B such that + 2 z ( z )( + z ) = A z + B + z + 2 z = A + A z + B B z. Comparing the constant terms and the coefficients of z separately, we obtain the two equations I: A + B = II: A B = 2. Solving this yields A = 4, B = 4. Thus, we can write 4 z + 4 +. z 2

Now, since both poles of H(z) have the same magnitude, we have only two choices of the ROC: z < or z >. If we look at the system diagram, we can see that an incoming signal is only delayed by δ[n ] functions, and hence, the system must be causal. If we want the resulting h[n] to be causal, we should choose the ROC z >, and we obtain h[n] = ( ( ) n ( ) n 4 ) u[n] + ( 4 ) u[n] δ[n]. Note that since <, we can even conclude that the system considered in part (f) is stable. Problem 2 (a) We have h[n] = nw[n] + w[n], and so, using the standard properties of the Z-transform, z dw(z) dz + W(z). The ROC of H(z) is the same as that of W(z): R H = R W. (b) The Z-transform of w[n] is W(z) = = (az ) n n= az = az az. W(z) has a single pole in z = a; since w[n] is causal, the ROC extends outwards, so R W = {z : z > a}. (c) The DTFT exists if the ROC contains the unit circle. This is the case here if a <. (d) From (a), h[n] = na n u[n ] + a n u[n ]. (e) G(z) can be seen as the concatenation of two systems G (z) and G 2 (z), where G (z) = /H(z) is the inversion of H(z) and G 2 (z) = z 2 adds a two-tap delay. Thus, G(z) = z 2 /H(z). (f) Let us compute H(z). We have W(z) z dw(z) dz = az az z d dz az az = az az + az ( az ) 2 = 2az ( 2 az ) ( az ) 2.

Thus, G(z) = z 2 z ( az ) 2 2a( 2 az ). We see that G(z) has a single pole at z = a/2. In theory, we have two choices for the ROC of G(z), leading to two different inverse Z-transforms (two different systems). The anticausal version would be to choose the ROC z < a 2. However, in that case, there is a problem. The combined system given in the Figure is a working system, with a transfer function of δ[n]. The system function in the Z domain is H(z)G(z), with a ROC which is the intersection of the ROC of H(z) and the ROC of G(z). But if we take the ROC of G(z) to be z < a 2, then the intersection is empty (draw a picture to see this). Therefore, we have to choose the other option for the ROC of G(z), namely z > a 2. In that case, the intersection is non-empty, and the overall ROC of H(z)G(z) is z > a. Hence, the overall system is causal, which makes sense. The system corresponding to G(z) alone has to be causal, too. Now, we see that G(z) can be stable if and only if a < 2. Let us determine g[n] (you didn t have to do this for the homework). Using long division, we find that a 2 G(z) = z 2 a 2 + 2 az. By inspection of the terms, we see that the inverse Z-transform is Problem g[n] = δ[n 2] a 2 δ[n] + a 2 (a/2) n u[n]. (a) A system is stable if the unit-circle lies inside the region of convergence (ROC). If we are given a pole-zero plot of a system function, we have at least two choices for the ROC. If we choose the ROC to be all complex numbers z such that z > p i, where p i is the pole with the largest absolute value, then the corresponding system is causal. If we choose the ROC to be all z such that z < p k, where p k is the pole with the smallest absolute value, then the corresponding system is anticausal. If, however, we choose the ROC to be all z such that p j < z < p l, then the corresponding system is two-sided. We can see that we have the following correspondences: (i): 2. (ii):. (iii):. (iv):. (b) Since the inverse system function is G(z) = H(z), we see that G(z) = ( p z )( p 2 z )( p z ) ( z z )( z 2 z, ) and it becomes clear that the poles of H(z) are the zeros of G(z) and vice versa. Hence, we argue as in part (a), but using the zeros instead of the poles. Hence, we are in case. 4

Problem 4 (a) 4z.5z +.5z 2 = z(z 4) z 2.5z +.5 Zeros are roots of nominator and poles are roots of denominator polynomials. Hence, the zeros are z = 0 and z 2 = 4 and the poles are p = 0.5 and p 2 =. (b) = = 4z.5z +.5z 2 4z ( 0.5z )( z ) 0.5z + 2 ( z ) (c) Since ROC does not contain any poles, there exists three possible ROC for H(z), which are the following: 0 z < 0.5, 0.5 < z < and z >. In a stable system, ROC contains the unit circle, therefore ROC is 0.5 < z <. In an anticausal system, ROC contains zero, therefore ROC is 0 z < 0.5. (d) Impulse response of any stable system is absolutely summable and absolutely summability is a necessary condition in existence of DTFT. In this case, for the sequence with ROC 0.5 < z <, DTFT is computable. Problem 5 (a) y [n] = 0.5y [n ] + x[n] x[n ] The system is causal (by zero initial condition assumption) and by Taking Z-transform for the above input-output relation, we have Y (z) = 0.5z Y (Z) + X(Z) z X(z). Y (z) X(z) = z 0.5z (b) H(z) has a pole at p = 0.5 and a zero at z =. The zero is outside of unit circle. z 0.5z = z 0.5z H min (z) = z 0.5z H ap (z) = 5 z z z z

(c) Since the system is causal the ROC is Z > 0.5 and because ROC contains the unit circle, the system is BIBO stable. (d) (d) Y (z) = H(z)X(z) X(z) = H(z) Y (z) R(z) = H(z) R(z) has a zero at z = 0.5 and a pole at p =. The inverse system cannot be both causal and stable. Because if the system is causal the ROC is z > which imply that system is not stable and if system is stable and the ROC contains the unit circle z <, the system is anticausal. G(z) = H(z) H min (z) = H min(z)h ap (z) H min (z) = H ap(z) The amplitude of an all-pass filter is one. G ap (z) z=e jω = arg(g(z)) z=e jω = arg(h ap (z)) z=e jω ( = arg ) e jω e jω ( ) = arg e jω ejω e jω ( ) = ω + arg ejω e jω ( ) = ω + 2arg ejω = ω + 2tan ( sin(ω) cos(ω) )