Some useful z-transform pairs:

Sequence Z-Transform ROC

All values of z

a'"u[n]

na"u[n]

1-(rcos(o, )z
cos(ayn)u[n] I-(2rcos(o,)z+r'
(rsin(o, ):!
" sin(yn)uln] 1-(2rcos(on ):+r2
DFT Theorems:

Theorem Sequence DTFT

G[k]
H[k]
Lincarity agn]+ Bh[n] aGk] + BHÊK]

Circular Time Shifting - "Gk]

Circular Frequency Shifting g[n] G(k - ko)]
Duality G[n Ngl(-k)w]
N-Point Circular Convolution Gk]H[K]

Modulation Sqn(a -m)s]

Parseval's ldentity

Z-Transform:
X()- )xtn" Inverse Z-Transform:

Z-Transform Properties:

Property Sequence Z-Transform Region of Convergence

G() R
H(Z) R
Coniugation G(=) R
gn]
Time Reversal gl-n] Gr) YR
Linearity agln]+ Bh[n] aG(z) + BH(Z) Includes R, MRy
Time Shifting R, except possibly the point z =0 or
Multiplication by an
exponential sequence a'gin] Gla)
Differentiation in the
ngln] dGE) R, except possibly the point z=0 or
z-domain dz
Convolution gn]* h[n] G()H(:) Includes R, N R
 DTFT Theorcms:

Sequence
DTFT
Theorem
gln] Ge")
H(e")
ag[n] +Bh[n aGel")+ BH(e)
Linearity
Gle )
Time Reversal gl-n)
Time Shifting g[n-n]
Geu-))
Frequency Shifting
ng[n
,dG(e)
Differentiation in Frequecncy do

gn]*n] Ge"H(e")
Convolution
-

Modulation ginin]

Parseval's Identity

Discrete Fourier Transform (DFT): 0sksN-1

Inverse DFT: 0snsN -1

Circular Convolution: v.n-)Ami(a -m)x]. 0snsN-1

Symmetry properties of DFT:

Length-N Sequence N-Point DFT

xfn] =n]+j*,n] X[k]= X,(k]+ jXik]

x'(-*)NJ
x'k]
x)--41+x'-*)N
Nk--x'-)NL
Xk]
jXmk]
Energy and power of discrete-time signals:

Energy: E, - ) l ..Power: non-periodie P, - limN .Nperiodic: P,

Diserete-time linear convolution:

Discrete-time Fourier Transform (DTFT):

DTFT Properties:
Symmetry relations:

Sequence DTFT

X(e")
xf-n] X(ej)
x[-n]
Rex{n):
Xlele")+xietu.
j Imn)}

Note: Subscript cs" and "as" mean conjugate symmetric and

conjugate anti-symnmetric signals, respectively.
DTFT of commonly used
sequences:
Sequence
DTFT

un](Unit Step Function) 1

2zd (w - 0, +2rk)
a'un). Vd<l)
(n+)a'ulnl]. (<d <i)
hËn] - sin(o n) (-*<n< +*)
H )J 0<l s
 EE-556 Formula Sheet

Some useful Mathematical formulas and ldentities:

e"+e
e" = cos(0) + jsin(0), cos(0) = sin(e) =
2 2j
sin(28) = 2sin(0) cos(0), cos(20) - 2cos*(e) -1-1- 2sin'(e)
cos(a)costp)-costa - p)+ costa +p)]
singca)sin(A) =osta -p) -costa +P)]
sin(a)cos( )-sin(a -f) +sin(a +P)]
Sin(T x)
sinc(x) =

Geometric series:

Fourier serles:

x(0) =a0 + Xl4, costnoE/) +h, sin(nag)]- SC,e"a.

Fourier transform and Inverse Fourier transform:

x(1)

Some useful Fourier transform pairs:

u(t) >IÐ{o) +L
ja
S) >1

ref-Tinc
cos(,/) n8(0+,) + o o- , )
sin(oht) * jnõ(w+oy)- Slo-o)