SlideShare a Scribd company logo
z-Transforms
1

Definitions
• Given an input signal x[n], the two-sided z-transform is given by
∞

X(z) =

x[n]z −n .

(1)

k=−∞

• Given an input signal x[n], the one-sided z-transform is given by
∞

X(z) =

x[n]z −n .

(2)

k=0

• By default, the term z-transform means the two-sided z-transform, i.e.,
if we simply say z-transform without explicitly specifying if it is a onesided z-transform or a two-sided z-transform, then we mean a two-sided
z-transform.
• A series of the form (1) is called a Laurent series.
• Notation: The two-sided z-transform of a signal x[n] is denoted by
z{x[n]}.

2

Basic Properties of the z-transform
• If x[n] is a causal signal, then the two-sided z-transform of x[n] is equal
to the one-sided z-transform of x[n], i.e., if x[n] is a causal signal, then
the z-transform of x[n] contains only negative powers of z.
• If x[n] is of finite length and is zero for n > N2 and n < −N1 , then the
limits of summation in (1) reduce to −N1 and N2 , i.e., the two-sided
z-transform of such a signal x[n] is
N2

X(z) =

x[n]z −n .
k=−N1

1

(3)
• Linearity: z{αx1 [n] + βx2 [n]} = αz{x1 [n]} + βz{x2 [n]}
• z{x[n − n0 ]} = z −n0 z{x[n]} ... time shift by n0 is equivalent to multiplication of the z-transform by z −n0 .

3

Examples
• z{δ[n]} = 1
• z{δ[n − n0 ]} = z −n0 for any constant n0 .
• z{αn u[n]} =

1
1−αz −1

for any constant α.

• z{−αn u[−n − 1]} =

4

1
1−αz −1

for any constant α.

More Properties of the z-transform
• z{x1 [n] ∗ x2 [n]} = z{x1 [n]}z{x2 [n]} ... convolution in the time domain is equivalent to multiplication in the z domain, i.e., convolution
is mathematically equivalent to polynomial multiplication.
Proof: Let x[n] = x1 [n] ∗ x2 [n], i.e., x[n] =

∞
k=−∞

x1 [k]x2 [n − k]. Then,

∞

z{x[n]} =

x[n]z −n
n=−∞
∞

∞

x1 [k]x2 [n − k]z −n

=
n=−∞ k=−∞
∞

∞

x2 [n − k]z −n

x1 [k]

=

n=−∞

k=−∞
∞

=

∞

x1 [k]z

x2 [n − k]z −(n−k)

−k
n=−∞
∞

k=−∞
∞

x1 [k]z −k

=

x2 [n1 ]z −n1
n1 =−∞

k=−∞

2

(4)
where n1 = n − k. Hence,
∞

∞

x1 [k]z −k

z{x[n]} =

x2 [n1 ]z −n1
n1 =−∞

k=−∞

= z{x1 [n]}z{x2 [n]}.

(5)

• If z{x[n]} = X(z), then z{an x[n]} = X(a−1 z).
Proof:
∞

z{an x[n]} =

an x[n]z −n
n=−∞
∞

=

x[n](a−1 z)−n
n=−∞
−1

= X(a z).

(6)

• If z{x[n]} = X(z), then z{nx[n]} = −z dX(z) .
dz
Proof: Note that
∞

d
dX(z)
=
dz
dz

x[n]z −n

n=−∞
∞

(−n)x[n]z −n−1

=
n=−∞

∞

= −z

nx[n]z −n .

−1

(7)

n=−∞

Hence,
∞

z{nx[n]} =

nx[n]z −n = −z
n=−∞

dX(z)
.
dz

(8)

• If x[n] is a causal signal, then x[0] = limz→∞ X(z).
Proof: If x[n] is a causal signal, then x[n] = 0 for n < 0 so that X(z)
contains only negative powers of z, i.e., X(z) is of the form
X(z) = x[0] + x[1]z −1 + x[2]z −2 + x[3]z −3 + . . .

(9)

Taking z → ∞, only the first term in (9) remains so that
lim X(z) = x[0].

z→∞

3

(10)
• If z{x[n]} = X(z), then z{x[−n]} = X(z −1 ).
Proof:
∞

z{x[−n]} =

x[−n]z −n
n=−∞
−∞

x[n1 ]z n1

=

(11)

n1 =∞

where n1 = −n. Hence,
∞

z{x[−n]} =

x[n1 ](z −1 )−n1
n1 =−∞
−1

= X(z ).

(12)

• If z{x[n]} = X(z), then z{x∗ [n]} = X ∗ (z ∗ ).
Proof: Note that
∞

X ∗ (z ∗ ) =

x[n](z ∗ )−n

∗

n=−∞
∞

=

x∗ [n]z −n

(13)

n=−∞

since (z ∗ )∗ = z. Hence,
∞

x∗ [n]z −n = X ∗ (z ∗ ).

z{x∗ [n]} =

(14)

n=−∞
1
• If z{x[n]} = X(z), then z{Re(x[n])} = 2 [X(z) + X ∗ (z ∗ )].

Proof: From the property proved above, we know that z{x∗ [n]} =
X ∗ (z ∗ ). Noting that
1
(x[n] + x∗ [n]),
(15)
Re(x[n]) =
2
the result follows.
• If z{x[n]} = X(z), then z{Im(x[n])} =

1
[X(z)
2j

− X ∗ (z ∗ )].

Proof: We know that z{x∗ [n]} = X ∗ (z ∗ ). Noting that
1
(x[n] − x∗ [n]),
Im(x[n]) =
2j
the result follows.
4

(16)
5

Region of Convergence
• The set of values of z for which the summation in the definition of the
z-transform (1) converges is called the Region of Convergence (ROC).
The ROC is a subset of the complex plane.
• The ROC of the z-transform of a finite length signal is the entire complex plane. Since the z-transform of a finite length signal has only a
finite number of terms in the summation, the z-transform converges for
all z.
• From the theory of complex analysis, it is known that the ROC of the
z-transform of any signal is a connected set and is bounded by circles
(with the centers of the circles being at the origin of the complex plane).
Hence, there are three possibilities for the ROC as shown in Figure 1:
– Interior of a circle
– Exterior of a circle
– Annular region between two circles
−n −jωn
• If z = rejω , then X(z) = ∞
e
. It can be shown that
n=−∞ x[n]r
X(z) converges if and only if
∞

|x[n]r −n | < ∞.

(17)

n=−∞

Example: If x[n] = u[n], then (17) reduces to ∞ |r−n | < ∞ which
n=0
holds if |r −1 | < 1, i.e., if |r| > 1. Hence, the ROC of the z-transform
of u[n] is 1 < |z| < ∞, i.e., the exterior of a circle with radius 1.
Example: If x[n] = αn u[n], then (17) reduces to ∞ |αn r−n | < ∞
n=0
which holds if |αr −1 | < 1, i.e., if |r| > |α|. Hence, the ROC of the
z-transform of αn u[n] is |α| < |z| < ∞, i.e., the exterior of a circle with
radius |α|.
Example: If x[n] = −αn u[−n−1], then (17) reduces to −∞ |αn r−n | <
n=−1
∞ which holds if |α−1 r| < 1, i.e., if |r| < |α|. Hence, the ROC of the
z-transform of −αn u[−n−1] is 0 ≤ |z| < |α|, i.e., the interior of a circle
with radius |α|.
5
Figure 1: Possibilities for the region of convergence: (a) interior of a circle;
(b) exterior of a circle; (c) annular region between two circles.
• From the above examples, it can be generalized that the ROC of the
z-transform of a causal signal is the exterior of a circle and the ROC
of the z-transform of an anti-causal signal (i.e., a signal which is zero
for n > 0) is the interior of a circle.
• The above statement can be generalized to right-sided and left-sided
signals. A right-sided signal is a signal which is zero for all n smaller
than some constant n1 . A left-sided signal is a signal which is zero
for all n greater than some constant n1 . The ROC of the z-transform
of a right-sided signal is the exterior of a circle while the ROC of the
z-transform of a left-sided signal is the interior of a circle (possibly not
including the origin).
• Example: Consider the signal
αn for n ≥ 0
β n for n ≤ −1.

x[n] =

(18)

The signal x[n] in (18) is a two-sided signal. If |α| < |β|, then the ROC
6
of the z-transform of the signal x[n] is the annular region |α| < |z| < |β|.
If |α| ≥ |β|, then the z-transform of x[n] does not converge for any z.
• Special Case: If X(z) is a rational function (i.e., a ratio of polynomials), then the ROC is bounded by the poles of X(z), i.e., the values of
z for which X(z) is infinity.
Example: For the signal in (18), the z-transform is
∞

−∞

αn z −n +

X(z) =
n=0
∞

β n z −n
n=−1
∞

β −n z n

αn z −n +

=

n=1

n=0

1
1
+
−1
=
−1
1 − αz
1 − β −1 z
β −1 z
1
+
=
1 − αz −1 1 − β −1 z
1
1
=
−
.
−1
1 − αz
1 − βz −1

(19)

From (19), the poles of X(z) are z = α and z = β. As seen above, if
|α| < |β| the ROC of X(z) is the annular region |α| < |z| < |β|.
Example: If X(z) is a rational function, then the ROC of X(z) is
always bounded by poles. This means that the boundaries of the ROC
have poles on them. It does not mean that if X(z) has two poles, then
the ROC is the annular region between the poles. For example, consider
the signal x[n] = αn u[n] + β n u[n]. It can be shown that the ROC of
the z-transform of X(z) is max(|α|, |β|) < |z| < ∞, i.e., the exterior
of a circle with radius max(|α|, |β|). The boundary of this ROC is the
circle with radius max(|α|, |β|) which has a pole on it (the pole being
the larger of α and β). Note that the poles of X(z) are α and β.

7

More Related Content

PDF
boyd 3.1
Koki Isokawa
 
PDF
Contour
Enchalew Gashaye
 
PPT
Newton-Raphson Method
Jigisha Dabhi
 
DOC
Line integrals
Tarun Gehlot
 
PPTX
3.2 Derivative as a Function
gregcross22
 
PPT
Vector calculus
raghu ram
 
PPTX
32 divergence theorem
math267
 
PPT
3.1 derivative of a function
btmathematics
 
boyd 3.1
Koki Isokawa
 
Newton-Raphson Method
Jigisha Dabhi
 
Line integrals
Tarun Gehlot
 
3.2 Derivative as a Function
gregcross22
 
Vector calculus
raghu ram
 
32 divergence theorem
math267
 
3.1 derivative of a function
btmathematics
 

What's hot (18)

PDF
Linear approximations and_differentials
Tarun Gehlot
 
PPTX
32 divergence theorem
math267
 
PDF
Lesson 17: The Method of Lagrange Multipliers
Matthew Leingang
 
PPTX
32 divergence theorem
math267
 
PPTX
Applied Calculus Chapter 3 partial derivatives
J C
 
PPTX
Pseudo and Quasi Random Number Generation
Ashwin Rao
 
PDF
IVR - Chapter 6 - Sparsity, shrinkage and wavelets
Charles Deledalle
 
PPT
25 surface area
math267
 
PPTX
Gradient , Directional Derivative , Divergence , Curl
VishalVishwakarma59
 
PDF
Multiple integrals
Tarun Gehlot
 
PPTX
Fuzzy rules and fuzzy reasoning
Veni7
 
PPT
1523 double integrals
Dr Fereidoun Dejahang
 
PPTX
30 surface integrals
math267
 
PPT
30 green's theorem
math267
 
PDF
Directional derivative and gradient
Jhonatan Gerardo Soto Puelles
 
PPTX
Double Integral Powerpoint
oaishnosaj
 
PDF
Fractional Calculus A Commutative Method on Real Analytic Functions
Matt Parker
 
PPTX
30 surface integrals
math267
 
Linear approximations and_differentials
Tarun Gehlot
 
32 divergence theorem
math267
 
Lesson 17: The Method of Lagrange Multipliers
Matthew Leingang
 
32 divergence theorem
math267
 
Applied Calculus Chapter 3 partial derivatives
J C
 
Pseudo and Quasi Random Number Generation
Ashwin Rao
 
IVR - Chapter 6 - Sparsity, shrinkage and wavelets
Charles Deledalle
 
25 surface area
math267
 
Gradient , Directional Derivative , Divergence , Curl
VishalVishwakarma59
 
Multiple integrals
Tarun Gehlot
 
Fuzzy rules and fuzzy reasoning
Veni7
 
1523 double integrals
Dr Fereidoun Dejahang
 
30 surface integrals
math267
 
30 green's theorem
math267
 
Directional derivative and gradient
Jhonatan Gerardo Soto Puelles
 
Double Integral Powerpoint
oaishnosaj
 
Fractional Calculus A Commutative Method on Real Analytic Functions
Matt Parker
 
30 surface integrals
math267
 
Ad

Viewers also liked (20)

PDF
Why digital signage screen for hotels
Salem Abu Salem
 
PDF
Content strategy: Getting your content to work for you
Content That Clicks
 
PPTX
The White Legacy--Generation 2, Chapter 2
Keika20
 
PPSX
Ppt about guru
Ramya Janakiraman
 
PPTX
The White Legacy--Generation 4, Chapter 1
Keika20
 
PDF
プログラミング勉強会0721
nallpo
 
PPTX
The White Legacy--Generation 8, Chapter 2
Keika20
 
PPTX
My biography fabricio
fabricio agurto
 
PPTX
The White Legacy--Generation 6, Chapter 3
Keika20
 
PPTX
Interactive Minds Summit 2013 Event Coverage
Michael Grierson
 
PPTX
Wynter Wonderland: Chapter 8
Keika20
 
PPTX
The White Legacy--Generation 5, College (Part 2)
Keika20
 
PPTX
Financial statements 3
FaBEducation
 
PPTX
123
meetrajput
 
PDF
Hopping towards a bright future in the United States. Schools in the United S...
La'Brenia Jordan
 
PPTX
Generation Five Par-Tae!!
Keika20
 
PPTX
Presentation1
meetrajput
 
PPTX
Práctica 12 diapos
Joel Vera
 
PPTX
Presentation1
meetrajput
 
PPTX
金華36!真幸福!金滿意
Pen Ling Huang
 
Why digital signage screen for hotels
Salem Abu Salem
 
Content strategy: Getting your content to work for you
Content That Clicks
 
The White Legacy--Generation 2, Chapter 2
Keika20
 
Ppt about guru
Ramya Janakiraman
 
The White Legacy--Generation 4, Chapter 1
Keika20
 
プログラミング勉強会0721
nallpo
 
The White Legacy--Generation 8, Chapter 2
Keika20
 
My biography fabricio
fabricio agurto
 
The White Legacy--Generation 6, Chapter 3
Keika20
 
Interactive Minds Summit 2013 Event Coverage
Michael Grierson
 
Wynter Wonderland: Chapter 8
Keika20
 
The White Legacy--Generation 5, College (Part 2)
Keika20
 
Financial statements 3
FaBEducation
 
Hopping towards a bright future in the United States. Schools in the United S...
La'Brenia Jordan
 
Generation Five Par-Tae!!
Keika20
 
Presentation1
meetrajput
 
Práctica 12 diapos
Joel Vera
 
Presentation1
meetrajput
 
金華36!真幸福!金滿意
Pen Ling Huang
 
Ad

Similar to Signal3 (20)

PPT
Z Transform Digital Signal Processing NIT DURGAPUR
HrikdiptaKundu
 
PDF
Dsp U Lec05 The Z Transform
taha25
 
PPT
lec z-transform.ppt
MohammadRefai6
 
PPT
Z transform and Properties of Z Transform
AnujKumar734472
 
PPT
Digital signal processing part2
Vaagdevi College of Engineering
 
PDF
Unit 7 &amp; 8 z-transform
Ramesh Rangaswamy
 
PDF
Ch3_Z-transform.pdf
shannlevia123
 
PDF
Z transform
Taram Nabeel
 
PDF
DSP_2018_FOEHU - Lec 04 - The z-Transform
Amr E. Mohamed
 
PPTX
Lecture 3 Fourier series coefficients .pptx
MonaSayed27
 
PPTX
Chapter 6 frequency domain transformation.pptx
Eyob Adugnaw
 
PPTX
Lect_Z_Transform_Main_digital_image_processing.pptx
MonirHossain707319
 
PPT
Z transfrm ppt
SWATI MISHRA
 
PPT
Best to be presented z-transform
Karansinh Parmar
 
PPT
Z transform ROC eng.Math
Adhana Hary Wibowo
 
PPT
dsp dsp by Dr. k Udaya kumar power point
AnujKumar734472
 
PPT
Digital Signal Processing and the z-transform
RowenaDulay1
 
PPTX
Frequency Analysis using Z Transform.pptx
DrPVIngole
 
PDF
signalsandsystemsztransformEEEmaterial.pdf
Nityasrisumathi
 
Z Transform Digital Signal Processing NIT DURGAPUR
HrikdiptaKundu
 
Dsp U Lec05 The Z Transform
taha25
 
lec z-transform.ppt
MohammadRefai6
 
Z transform and Properties of Z Transform
AnujKumar734472
 
Digital signal processing part2
Vaagdevi College of Engineering
 
Unit 7 &amp; 8 z-transform
Ramesh Rangaswamy
 
Ch3_Z-transform.pdf
shannlevia123
 
Z transform
Taram Nabeel
 
DSP_2018_FOEHU - Lec 04 - The z-Transform
Amr E. Mohamed
 
Lecture 3 Fourier series coefficients .pptx
MonaSayed27
 
Chapter 6 frequency domain transformation.pptx
Eyob Adugnaw
 
Lect_Z_Transform_Main_digital_image_processing.pptx
MonirHossain707319
 
Z transfrm ppt
SWATI MISHRA
 
Best to be presented z-transform
Karansinh Parmar
 
Z transform ROC eng.Math
Adhana Hary Wibowo
 
dsp dsp by Dr. k Udaya kumar power point
AnujKumar734472
 
Digital Signal Processing and the z-transform
RowenaDulay1
 
Frequency Analysis using Z Transform.pptx
DrPVIngole
 
signalsandsystemsztransformEEEmaterial.pdf
Nityasrisumathi
 

Recently uploaded (20)

PDF
The Future of Artificial Intelligence (AI)
Mukul
 
PDF
GDG Cloud Munich - Intro - Luiz Carneiro - #BuildWithAI - July - Abdel.pdf
Luiz Carneiro
 
PDF
Responsible AI and AI Ethics - By Sylvester Ebhonu
Sylvester Ebhonu
 
PDF
Peak of Data & AI Encore - Real-Time Insights & Scalable Editing with ArcGIS
Safe Software
 
PDF
MASTERDECK GRAPHSUMMIT SYDNEY (Public).pdf
Neo4j
 
PDF
Research-Fundamentals-and-Topic-Development.pdf
ayesha butalia
 
PDF
Software Development Methodologies in 2025
KodekX
 
PDF
Security features in Dell, HP, and Lenovo PC systems: A research-based compar...
Principled Technologies
 
PDF
Using Anchore and DefectDojo to Stand Up Your DevSecOps Function
Anchore
 
PDF
Accelerating Oracle Database 23ai Troubleshooting with Oracle AHF Fleet Insig...
Sandesh Rao
 
PPTX
The Future of AI & Machine Learning.pptx
pritsen4700
 
PDF
OFFOFFBOX™ – A New Era for African Film | Startup Presentation
ambaicciwalkerbrian
 
PDF
SparkLabs Primer on Artificial Intelligence 2025
SparkLabs Group
 
PDF
Economic Impact of Data Centres to the Malaysian Economy
flintglobalapac
 
PPTX
What-is-the-World-Wide-Web -- Introduction
tonifi9488
 
PDF
Doc9.....................................
SofiaCollazos
 
PDF
Orbitly Pitch Deck|A Mission-Driven Platform for Side Project Collaboration (...
zz41354899
 
PPTX
New ThousandEyes Product Innovations: Cisco Live June 2025
ThousandEyes
 
PPTX
Dev Dives: Automate, test, and deploy in one place—with Unified Developer Exp...
AndreeaTom
 
PPTX
Agile Chennai 18-19 July 2025 Ideathon | AI Powered Microfinance Literacy Gui...
AgileNetwork
 
The Future of Artificial Intelligence (AI)
Mukul
 
GDG Cloud Munich - Intro - Luiz Carneiro - #BuildWithAI - July - Abdel.pdf
Luiz Carneiro
 
Responsible AI and AI Ethics - By Sylvester Ebhonu
Sylvester Ebhonu
 
Peak of Data & AI Encore - Real-Time Insights & Scalable Editing with ArcGIS
Safe Software
 
MASTERDECK GRAPHSUMMIT SYDNEY (Public).pdf
Neo4j
 
Research-Fundamentals-and-Topic-Development.pdf
ayesha butalia
 
Software Development Methodologies in 2025
KodekX
 
Security features in Dell, HP, and Lenovo PC systems: A research-based compar...
Principled Technologies
 
Using Anchore and DefectDojo to Stand Up Your DevSecOps Function
Anchore
 
Accelerating Oracle Database 23ai Troubleshooting with Oracle AHF Fleet Insig...
Sandesh Rao
 
The Future of AI & Machine Learning.pptx
pritsen4700
 
OFFOFFBOX™ – A New Era for African Film | Startup Presentation
ambaicciwalkerbrian
 
SparkLabs Primer on Artificial Intelligence 2025
SparkLabs Group
 
Economic Impact of Data Centres to the Malaysian Economy
flintglobalapac
 
What-is-the-World-Wide-Web -- Introduction
tonifi9488
 
Doc9.....................................
SofiaCollazos
 
Orbitly Pitch Deck|A Mission-Driven Platform for Side Project Collaboration (...
zz41354899
 
New ThousandEyes Product Innovations: Cisco Live June 2025
ThousandEyes
 
Dev Dives: Automate, test, and deploy in one place—with Unified Developer Exp...
AndreeaTom
 
Agile Chennai 18-19 July 2025 Ideathon | AI Powered Microfinance Literacy Gui...
AgileNetwork
 

Signal3

  • 1. z-Transforms 1 Definitions • Given an input signal x[n], the two-sided z-transform is given by ∞ X(z) = x[n]z −n . (1) k=−∞ • Given an input signal x[n], the one-sided z-transform is given by ∞ X(z) = x[n]z −n . (2) k=0 • By default, the term z-transform means the two-sided z-transform, i.e., if we simply say z-transform without explicitly specifying if it is a onesided z-transform or a two-sided z-transform, then we mean a two-sided z-transform. • A series of the form (1) is called a Laurent series. • Notation: The two-sided z-transform of a signal x[n] is denoted by z{x[n]}. 2 Basic Properties of the z-transform • If x[n] is a causal signal, then the two-sided z-transform of x[n] is equal to the one-sided z-transform of x[n], i.e., if x[n] is a causal signal, then the z-transform of x[n] contains only negative powers of z. • If x[n] is of finite length and is zero for n > N2 and n < −N1 , then the limits of summation in (1) reduce to −N1 and N2 , i.e., the two-sided z-transform of such a signal x[n] is N2 X(z) = x[n]z −n . k=−N1 1 (3)
  • 2. • Linearity: z{αx1 [n] + βx2 [n]} = αz{x1 [n]} + βz{x2 [n]} • z{x[n − n0 ]} = z −n0 z{x[n]} ... time shift by n0 is equivalent to multiplication of the z-transform by z −n0 . 3 Examples • z{δ[n]} = 1 • z{δ[n − n0 ]} = z −n0 for any constant n0 . • z{αn u[n]} = 1 1−αz −1 for any constant α. • z{−αn u[−n − 1]} = 4 1 1−αz −1 for any constant α. More Properties of the z-transform • z{x1 [n] ∗ x2 [n]} = z{x1 [n]}z{x2 [n]} ... convolution in the time domain is equivalent to multiplication in the z domain, i.e., convolution is mathematically equivalent to polynomial multiplication. Proof: Let x[n] = x1 [n] ∗ x2 [n], i.e., x[n] = ∞ k=−∞ x1 [k]x2 [n − k]. Then, ∞ z{x[n]} = x[n]z −n n=−∞ ∞ ∞ x1 [k]x2 [n − k]z −n = n=−∞ k=−∞ ∞ ∞ x2 [n − k]z −n x1 [k] = n=−∞ k=−∞ ∞ = ∞ x1 [k]z x2 [n − k]z −(n−k) −k n=−∞ ∞ k=−∞ ∞ x1 [k]z −k = x2 [n1 ]z −n1 n1 =−∞ k=−∞ 2 (4)
  • 3. where n1 = n − k. Hence, ∞ ∞ x1 [k]z −k z{x[n]} = x2 [n1 ]z −n1 n1 =−∞ k=−∞ = z{x1 [n]}z{x2 [n]}. (5) • If z{x[n]} = X(z), then z{an x[n]} = X(a−1 z). Proof: ∞ z{an x[n]} = an x[n]z −n n=−∞ ∞ = x[n](a−1 z)−n n=−∞ −1 = X(a z). (6) • If z{x[n]} = X(z), then z{nx[n]} = −z dX(z) . dz Proof: Note that ∞ d dX(z) = dz dz x[n]z −n n=−∞ ∞ (−n)x[n]z −n−1 = n=−∞ ∞ = −z nx[n]z −n . −1 (7) n=−∞ Hence, ∞ z{nx[n]} = nx[n]z −n = −z n=−∞ dX(z) . dz (8) • If x[n] is a causal signal, then x[0] = limz→∞ X(z). Proof: If x[n] is a causal signal, then x[n] = 0 for n < 0 so that X(z) contains only negative powers of z, i.e., X(z) is of the form X(z) = x[0] + x[1]z −1 + x[2]z −2 + x[3]z −3 + . . . (9) Taking z → ∞, only the first term in (9) remains so that lim X(z) = x[0]. z→∞ 3 (10)
  • 4. • If z{x[n]} = X(z), then z{x[−n]} = X(z −1 ). Proof: ∞ z{x[−n]} = x[−n]z −n n=−∞ −∞ x[n1 ]z n1 = (11) n1 =∞ where n1 = −n. Hence, ∞ z{x[−n]} = x[n1 ](z −1 )−n1 n1 =−∞ −1 = X(z ). (12) • If z{x[n]} = X(z), then z{x∗ [n]} = X ∗ (z ∗ ). Proof: Note that ∞ X ∗ (z ∗ ) = x[n](z ∗ )−n ∗ n=−∞ ∞ = x∗ [n]z −n (13) n=−∞ since (z ∗ )∗ = z. Hence, ∞ x∗ [n]z −n = X ∗ (z ∗ ). z{x∗ [n]} = (14) n=−∞ 1 • If z{x[n]} = X(z), then z{Re(x[n])} = 2 [X(z) + X ∗ (z ∗ )]. Proof: From the property proved above, we know that z{x∗ [n]} = X ∗ (z ∗ ). Noting that 1 (x[n] + x∗ [n]), (15) Re(x[n]) = 2 the result follows. • If z{x[n]} = X(z), then z{Im(x[n])} = 1 [X(z) 2j − X ∗ (z ∗ )]. Proof: We know that z{x∗ [n]} = X ∗ (z ∗ ). Noting that 1 (x[n] − x∗ [n]), Im(x[n]) = 2j the result follows. 4 (16)
  • 5. 5 Region of Convergence • The set of values of z for which the summation in the definition of the z-transform (1) converges is called the Region of Convergence (ROC). The ROC is a subset of the complex plane. • The ROC of the z-transform of a finite length signal is the entire complex plane. Since the z-transform of a finite length signal has only a finite number of terms in the summation, the z-transform converges for all z. • From the theory of complex analysis, it is known that the ROC of the z-transform of any signal is a connected set and is bounded by circles (with the centers of the circles being at the origin of the complex plane). Hence, there are three possibilities for the ROC as shown in Figure 1: – Interior of a circle – Exterior of a circle – Annular region between two circles −n −jωn • If z = rejω , then X(z) = ∞ e . It can be shown that n=−∞ x[n]r X(z) converges if and only if ∞ |x[n]r −n | < ∞. (17) n=−∞ Example: If x[n] = u[n], then (17) reduces to ∞ |r−n | < ∞ which n=0 holds if |r −1 | < 1, i.e., if |r| > 1. Hence, the ROC of the z-transform of u[n] is 1 < |z| < ∞, i.e., the exterior of a circle with radius 1. Example: If x[n] = αn u[n], then (17) reduces to ∞ |αn r−n | < ∞ n=0 which holds if |αr −1 | < 1, i.e., if |r| > |α|. Hence, the ROC of the z-transform of αn u[n] is |α| < |z| < ∞, i.e., the exterior of a circle with radius |α|. Example: If x[n] = −αn u[−n−1], then (17) reduces to −∞ |αn r−n | < n=−1 ∞ which holds if |α−1 r| < 1, i.e., if |r| < |α|. Hence, the ROC of the z-transform of −αn u[−n−1] is 0 ≤ |z| < |α|, i.e., the interior of a circle with radius |α|. 5
  • 6. Figure 1: Possibilities for the region of convergence: (a) interior of a circle; (b) exterior of a circle; (c) annular region between two circles. • From the above examples, it can be generalized that the ROC of the z-transform of a causal signal is the exterior of a circle and the ROC of the z-transform of an anti-causal signal (i.e., a signal which is zero for n > 0) is the interior of a circle. • The above statement can be generalized to right-sided and left-sided signals. A right-sided signal is a signal which is zero for all n smaller than some constant n1 . A left-sided signal is a signal which is zero for all n greater than some constant n1 . The ROC of the z-transform of a right-sided signal is the exterior of a circle while the ROC of the z-transform of a left-sided signal is the interior of a circle (possibly not including the origin). • Example: Consider the signal αn for n ≥ 0 β n for n ≤ −1. x[n] = (18) The signal x[n] in (18) is a two-sided signal. If |α| < |β|, then the ROC 6
  • 7. of the z-transform of the signal x[n] is the annular region |α| < |z| < |β|. If |α| ≥ |β|, then the z-transform of x[n] does not converge for any z. • Special Case: If X(z) is a rational function (i.e., a ratio of polynomials), then the ROC is bounded by the poles of X(z), i.e., the values of z for which X(z) is infinity. Example: For the signal in (18), the z-transform is ∞ −∞ αn z −n + X(z) = n=0 ∞ β n z −n n=−1 ∞ β −n z n αn z −n + = n=1 n=0 1 1 + −1 = −1 1 − αz 1 − β −1 z β −1 z 1 + = 1 − αz −1 1 − β −1 z 1 1 = − . −1 1 − αz 1 − βz −1 (19) From (19), the poles of X(z) are z = α and z = β. As seen above, if |α| < |β| the ROC of X(z) is the annular region |α| < |z| < |β|. Example: If X(z) is a rational function, then the ROC of X(z) is always bounded by poles. This means that the boundaries of the ROC have poles on them. It does not mean that if X(z) has two poles, then the ROC is the annular region between the poles. For example, consider the signal x[n] = αn u[n] + β n u[n]. It can be shown that the ROC of the z-transform of X(z) is max(|α|, |β|) < |z| < ∞, i.e., the exterior of a circle with radius max(|α|, |β|). The boundary of this ROC is the circle with radius max(|α|, |β|) which has a pole on it (the pole being the larger of α and β). Note that the poles of X(z) are α and β. 7