Scribd
Upload
70 views

Problem Set 6: X (N) Z, If It Exists

This document is a problem set for a digital signal processing course at the University of Illinois at Urbana-Champaign. It contains two problems involving z-transforms and discrete-time Fourier transforms (DTFTs). Problem 1 asks students to determine the z-transform, region of convergence, and existence of the DTFT for 8 different sequences. Problem 2 asks students to sketch pole-zero plots, regions of convergence, and compute inverse z-transforms for 4 given z-transforms.

Uploaded by

n
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
70 views

Problem Set 6: X (N) Z, If It Exists

This document is a problem set for a digital signal processing course at the University of Illinois at Urbana-Champaign. It contains two problems involving z-transforms and discrete-time Fourier transforms (DTFTs). Problem 1 asks students to determine the z-transform, region of convergence, and existence of the DTFT for 8 different sequences. Problem 2 asks students to sketch pole-zero plots, regions of convergence, and compute inverse z-transforms for 4 given z-transforms.

Uploaded by

n
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

UNIVERSITY OF ILLINOIS AT URBANA-CHAMPAIGN

Department of Electrical and Computer Engineering


ECE 410 Digital Signal Processing
Problem Set 6
Fall 2010

Issued: 09/27/2010. Due: 10/04/2010


Prof. Bresler, Prof. Hasegawa-Johnson

Problem 1

For each of the following sequences:

∞ −n ,
(i) Determine the z-transform, X(z) = n=0 x[n]z if it exists.

(ii) Include with your answer the region of convergence of the z-transform in the z-plane.

(iii) Specify whether or not the DTFT of the sequence, Xd (ω) = ∞ n=−∞ x[n]e
−jωn , exists.

1. x[n] = 3n u[n]

2. x[n] = cos( n2 )u[n]

3. x[n] = sin( nπ
4 )u[n]
 1 n  1 n
4. x[n] = 4 u[n] + 8 u[n]

 1 n−1  4 n−1
5. x[n] = 2 u[n − 1] + 5 u[n − 2]

6. x[n] = 2n (u[n] − u[n − 10])

7. x[n] = (1/8)n u[n] + (1/2)n−1 u[n − 1] + (1/8)n−2 u[n − 2]

8. x[n] = n cos(n/2)u[n]

1
2
3
4
5
6
Problem 2

For each of the following z-transforms:

• Sketch the pole-zero plot.

• Assume the sequences are causal (i.e. zero for n < 0) and sketch the region of convergence (ROC).

• Compute the inverse z-transform, corresponding to the ROC you determined.

1.
z −1
X1 (z) =
1 + 2jz −1
2.
1 − 13 z −1
X2 (z) =
1 + 34 z −1 + 18 z −2

3.
1 + z −2
X3 (z) =
1 − 52 z −1 + z −2

4.
1 − 3z −1
X4 (z) =
1 + 0.5z −1 + 0.25z −2

7
8
9
10
11

You might also like