[go: up one dir, main page]

0% found this document useful (0 votes)
21 views14 pages

EC448 Lecture 5

The z-transform generalizes the Fourier transform to include sequences where the Fourier transform does not converge, allowing for the analysis of discrete signals and systems. The region of convergence (ROC) is crucial for determining where the z-transform exists, and it is noted that the Fourier transform can be viewed as the z-transform evaluated on the unit circle. Key properties of the z-transform include linearity and translation, which are essential for system analysis.

Uploaded by

sabekaelhouni510
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
0% found this document useful (0 votes)
21 views14 pages

EC448 Lecture 5

The z-transform generalizes the Fourier transform to include sequences where the Fourier transform does not converge, allowing for the analysis of discrete signals and systems. The region of convergence (ROC) is crucial for determining where the z-transform exists, and it is noted that the Fourier transform can be viewed as the z-transform evaluated on the unit circle. Key properties of the z-transform include linearity and translation, which are essential for system analysis.

Uploaded by

sabekaelhouni510
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/ 14

Z-Transform

• The Fourier transform does not converge for all sequences.


Specifically, depending on the definition of convergence used, the
sequence is required to be either absolutely summable or have finite
energy. It is useful to note that for an LSI system the condition for
stability corresponds to the condition for convergence of the Fourier
transform of the unit-sample response (i.e. the frequency response).

• The z-transform represents a generalization of the Fourier transform


to include sequences for which the Fourier transform doesn't
converge; and can be interpreted as the Fourier transform of the
sequence modified by multiplication with a complex exponential.
z-Transformation
– Laplace transformation is important for analyzing analog
signal/systems.
– z-transformation is important for analyzing discrete
signal/systems.
– For a given signal x(n), its z-transformation is defined By

𝑍 𝑥 𝑛 =𝑋 𝑧 = ∑ 𝑥 𝑛 𝑧−𝑛
𝑛=−∞

where z is a complex variable(z = 𝑟𝑒 𝑗𝜔 )


For X(z) to be exist ; ∑∞ 𝑥 𝑛 𝑧−𝑛 < ∞ ➔ absolutely converges
𝑛=−∞
Z-Transform Examples and ROC
Region of Convergence

◼ Fourier transform exists (converges) if and only


if the signal is absolutely summable.
◼ z-transform exists for some value of z.
◼ The region in which the z-transform exists is
called the region of convergence (ROC).
◼ z-transformation is a more powerful tool for
analyzing signals.
Examples

Example: Find the z-transform of 𝜹 𝒏 𝒖(𝒏) and 𝜶𝒏𝒖(𝒏)


Z[𝛿 𝑛 ]= ∑ 𝛿 𝑛 𝑧−𝑛 = 1 , 𝑓𝑜𝑟 𝑎𝑛𝑦 𝑧


𝑛=0
∞ ∞
1 𝑧
Z[𝑢 𝑛 ]= ∑ 𝑢 𝑛 𝑧−𝑛 = ∑ 𝑧−𝑛 = = 𝑓𝑜𝑟 𝑧 > 1
1 − 𝑧−1 𝑧 − 1
𝑛=0 𝑛=0

∞ ∞
1 𝑧
Z[𝜶𝒏𝑢 𝑛 ]= ∑ 𝜶𝒏𝑢 𝑛 𝑧−𝑛 = ∑ ( 𝛼 𝑧 − 1 ) 𝑛 = =
1 − 𝛼𝑧−1 𝑧 − 𝛼
𝑛=0 𝑛=0
𝑓𝑜𝑟 𝑧 > 𝛼
Relation between z-transform and Fourier transform

◼ Fourier transform is the z-


transform on the unit circle.
◼ The values of the z-transform
on the unit circle equals to
those of the Fourier transform
of the same signal.
Remarks
◼ It is important to specify
the ROC in the results.
◼ If we use the right table,
we can find the z-
transform of more
complicated signals.
Home Work

Problem 1: Determine which of the following sequences have Fourier transforms


which converge:

i. x(n) = 2n u(n)
ii. x(n) = 2n u(-n)
iii. x(n) = (1/2)n u(n)
iv. x(n) = u(n)

Problem 2: Find z-transform to

X(𝑛)=𝑎𝑛𝑢(𝑛)−𝑏𝑛𝑢(−𝑛−1) , and write down ROC


Properties of z-transform (1)

◼ Linearity:
z-transform is a linear transform ∀ 𝑎, 𝑏
If Z[𝑥1(𝑛)]= 𝑋1(𝑧) and Z[𝑥2(𝑛)]= 𝑋2(𝑧)
Then
Z[𝑎𝑥1 𝑛 + 𝑏𝑥1(𝑛)]=𝑎𝑋1 𝑧 + 𝑏𝑋2(𝑧)
◼ Translation:
If x(n)=0 for n<0 and Z[x(n) ]=X(z) , then
𝑍[𝑥 𝑛 + 𝑚 ] = 𝑧 𝑚 𝑋 𝑧
𝑍 𝑥 𝑛 − 𝑚 = 𝑧 −𝑚 𝑋 𝑧
The second equation is especially useful for system analysis.

You might also like