Digital Signal Processing/Z Transform

From testwiki
Revision as of 23:08, 26 April 2007 by imported>Whiteknight (Z-Plane)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:DSP Page

The Z Transform has a strong relationship to the DTFT, and is incredibly useful in transforming, analyzing, and manipulating discrete calculus equations. The Z transform is named such because the letter 'z' (a lower-case Z) is used as the transformation variable.

Z Transform Definition

for a given sequence x[n], we can define the z-transform X(z) as such:

Template:Eqn

𝒵(x[n])=X(z)=n=x[n]zn

it is important to note that z is a continuous complex variable defined as such:

z=Re(z)+jIm(z)

It is important to note that the z-transform rarely needs to be computed manually, because many common results have already been tabulated extensively in tables.

The Inverse Z-Transform

The inverse z-transform can be defined as such:

Template:Eqn

x[n]=12πjCX(z)zn1dz

Where C is a closed-contour that lies inside the unit circle on the z-plane, and encircles the point z = {0, 0}.

The inverse z-transform is mathematically very complicated, but luckily--like the z-transform itself--the results are extensively tabulated in tables.

Equivalence to DTFT

the z-transform is equivalent to the DTFT by making the following substitution:

z=ejω

Properties

Since the z-transform is equivalent to the DTFT, the z-transform has many of the same properties. Specifically, the z-transform has the property of duality, and it also has a version of the convolution theorem (discussed later).

The z-transform is a linear operator.

Convolution Theorem

Since the Z-transform is equivalent to the DTFT, it also has a convolution theorem that is worth stating explicitly:

Template:TextBox

Z-Plane

Since the variable z is a continuous, complex variable, we can map the z variable to a complex plane as such:

Transfer Function

Let's say we have a system with an input/output relationship defined as such:

Y(z) = H(z)X(z)

We can define the transfer function of the system as being the term H(z). If we have a basic transfer function, we can break it down into parts:

H(z)=N(z)D(z)

Where H(z) is the transfer function, N(z) is the numerator of H(z) and D(z) is the denominator of H(z). If we set N(z)=0, the solutions to that equation are called the zeros of the transfer function. If we set D(z)=0, the solutions to that equation are called the poles of the transfer function.

The poles of the transfer function amplify the frequency response while the zero's attenuate it. This is important because when you design a filter you can place poles and zero's on the unit circle and quickly evaluate your filters frequency response.

Example

Template:TextBox

Stability

It can be shown that for any system with a transfer function H(z), all the poles of H(z) must lie within the unit-circle on the z-plane for the system to be stable. Zeros of the transfer function may lie inside or outside the circle.

Gain

Gain is the factor by which the output magnitude is different from the input magnitude. If the input magnitude is the same as the output magnitude at a given frequency, the filter is said to have "unity gain".

Properties

Here is a listing of the most common properties of the Z transform.


Time domain Z-domain ROC
Notation x[n]=𝒵1{X(z)} X(z)=𝒵{x[n]} ROC: r2<|z|<r1 
Linearity a1x1[n]+a2x2[n]  a1X1(z)+a2X2(z)  At least the intersection of ROC1 and ROC2
Time shifting x[nk]  zkX(z)  ROC, except z=0  if k>0 and z= if k<0 
Scaling in the z-domain anx[n]  X(a1z)  |a|r2<|z|<|a|r1 
Time reversal x[n]  X(z1)  1r2<|z|<1r1 
Conjugation x*[n]  X*(z*)  ROC
Real part Re{x[n]}  12[X(z)+X*(z*)] ROC
Imaginary part Im{x[n]}  12j[X(z)X*(z*)] ROC
Differentiation nx[n]  zdX(z)dz ROC
Convolution x1[n]*x2[n]  X1(z)X2(z)  At least the intersection of ROC1 and ROC2
Correlation rx1,x2(l)=x1[l]*x2[l]  Rx1,x2(z)=X1(z)X2(z1)  At least the intersection of ROC of X1(z) and X2(z1)
Multiplication x1[n]x2[n]  1j2πCX1(v)X2(zv)v1dv  At least r1lr2l<|z|<r1ur2u 
Parseval's relation x1[n]x2*[n]  1j2πCX1(v)X2*(1v*)v1dv 
  • Inital value theorem
x[0]=limzX(z) , If x[n] causal
  • Final value theorem
x[]=limz1(z1)X(z) , Only if poles of (z1)X(z)  are inside unit circle

Phase Shift

Phase shift is the amount by which the output waveform is phase-shifted from the input signal. Phase shift is a function of the complexity

Further Reading