Digital Signal Processing

Z Transforms: Introduction
Z-Transform
 INTRODUCE the Z-TRANSFORM
 Give Mathematical Definition
 Show how the H(z) POLYNOMIAL simplifies analysis
 CONVOLUTION is SIMPLIFIED !
 Z-Transform can be applied to
 FIR Filter: h[n]  H(z)
h[n ]--> H ( z)
 Signals: x[n]
x[n ]-->
 X(z)
X ( z)

H ( z )   h[n]z n

n
TRANSFORM CONCEPT
 Move to a new domain where
 OPERATIONS are EASIER & FAMILIAR
 Use POLYNOMIALS

 TRANSFORM both ways

 x[n]  XX(z)
x[n ]---> ( z ) (into the z domain)
 X(z)
X ( z--->
)  x[n]
x[n ] (back to the time domain)
Z-TRANSFORM IDEA
 POLYNOMIAL REPRESENTATION

x[n] y[n]
h[n ]
H ( z )   h[n]z  n
n
x[n] y[n]
H (z )
Z-Transform DEFINITION
 POLYNOMIAL Representation of LTI SYSTEM:

 EXAMPLE:
H ( z )   h[n]z n

n
APPLIES to

{h[n ]}  { 2, 0,  3, 0, 2 }
Any SIGNAL

0 1 2 3 4
H ( z )  2 z  0 z  3z  0 z  2 z
 2  3z 2  2z 4
1 2 1 4 POLYNOMIAL in z-1
 2  3( z )  2( z )
 Z-Transform EXAMPLE
 ANY SIGNAL has a z-Transform:

X ( z )   x[n]z  n
n

X ( z)  ? 1
X ( z)  2  4 z  6z 2
 4z 3
 2z 4
 1 3 5
X ( z )  1  2 z  3z z

EXPONENT GIVES
TIME LOCATION

x[ n ]  ?
Z-Transform of Filter
 CALLED the SYSTEM FUNCTION
 h[n] is same as {bk}

M M
SYSTEM
FUNCTION H ( z )   bk z k
  h[k ]z k

k 0 k 0
M M
y[n]   bk x[n  k ]   h[k ]x[n  k ]
k 0 k 0
CONVOLUTION
FIR DIFFERENCE EQUATION
 Z-Transform of Filter
 Get H(z) DIRECTLY from the {bk}
 Example 7.3 in the book:

y[n ]  6 x[n ]  5 x[n  1]  x[n  2]

{bk }  { 6,  5,1}

H ( z )   bk z 1 1
 6  5z  z 2