Scribd
Upload
104 views5 pages

1. Unit sample δ (n) 1 δ (n-k) z 2. Unit step u (n) z/ (z-1) 3. Exponential a u (n) z/ (z-a) 4. Sinusoidal sin (θ n) u (n) θ n) u (n)

A table of very useful transforms in the eng field. These fine application in plenty plenty thing! Yuh know? Yeah bai! Yes yuh butta teeth!

Uploaded by

sabrahima
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
104 views5 pages

1. Unit sample δ (n) 1 δ (n-k) z 2. Unit step u (n) z/ (z-1) 3. Exponential a u (n) z/ (z-a) 4. Sinusoidal sin (θ n) u (n) θ n) u (n)

A table of very useful transforms in the eng field. These fine application in plenty plenty thing! Yuh know? Yeah bai! Yes yuh butta teeth!

Uploaded by

sabrahima
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/ 5

Table of the z transforms of useful sequences

Sequence
(n)
(n-k)
u(n)
an u(n)
sin(on) u(n)

Basic z-Transforms
1.
Unit sample
2.
3.
4.

Unit step
Exponential
Sinusoidal

Unit ramp

z-Transform Properties

Note: 1 + z

z sin 0

z 2 2 cos 0 z + 1

cos(on) u(n)
5.

z-Transform
1
z-k
z/(z-1)
z/(z-a)

+ z + z + .... + z

( N 1)

z 2 z cos 0
z 2 2 cos 0 z + 1

nu(n)

z
( z 1) 2

Sequence
x(n)
x(n-k)
an x(n)
x(-n)
x(n)*y(n)
n x(n)

z-Transform
X(z)
z-k X(z)
X(z/a)
X(z-1)
X(z).Y(z)
-z (dx(z)/dz)

1 zN
=
1 z 1

z-Transform Properties
Sequence
x(n)

z-Transform
X(z)

x(n-k)

z-k X(z)

an x(n)

X(z/a)

x(-n)

X(z-1)

x(n)*y(n)

X(z).Y(z)

n x(n)

-z (dx(z)/dz)

sin 2 = 2sin cos


sin3 = 3sin - 4sin 3
cos2 = cos 2 - sin 2

1 j
j
e +e

2
1 j
j
sin =
e e

2j

cos =

Fourier Transform pair (for discrete-time signal):

X ( ) =

x(n)e

jn

...

n =

1
x(n ) =
2

X ( )e jn d

= digital frequency ;

Impulse Invariant Method:


1
1

s+b
1 e bT z 1

b>0

T Sampling Period
Bilinear Transformation:

2 1 z 1
s=
T 1 + z 1

T sampling period

A Butterworth filter of order n is defined by


H ( j )

1

1 +
c

Where c is the cut-off


frequency of the filter.

2n

Butterworth Polynomials

S+1

2
3

s2 + 2s + 1

(s

+ s + 1 ( s + 1)

You might also like