DSP Quick Reference Table

(For EC 272: Digital Signal Processing)

DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING

January 2015

Z-Transform of Basic Signals

Definition:

X(z) =

x[n]z n

xn

1
X z z n 1dz

2j

Signal

Transform

ROC

1.

[n]

All z

2.

[n m]

z m

All z except 0 if m> 0

3.

u[n]

z
z 1

z 1

4.

u[ n 1]

z
z 1

z 1

5.

a n u[n]

z
za

z a

6.

a n u[ n 1]

z
za

z a

7.

(n 1)a n u[n]

z2
z a 2

z a

8.

sin 0 n u[n]

z sin 0
z 2 z cos 0 1

z 1

9.

cos 0 n u[n]

z(z cos 0 )
z 2z cos 0 1

z 1

Dept. of E&C, NITK Surathkal

Properties of z-Transform
________________________________________________________________________
Property
Signal
z-Transform
________________________________________________________________________
x[n]
X(z)
x1[n]
X1(z)
x2[n]
X2(z)
________________________________________________________________________
1. Linearity

a 1 x 1 [n] a 2 x 2 [n]

a 1 X1 (z) a 2 X 2 (z)

2. Time shifting

x[n k]

z k X(z) ;

x[n k] u[k]

z k X(z) - z k

x[n] is two - sided

x[m]z m ;

m0

x[n] is right - sided

x[n m]; n Multiple of m

X(z m )

4. Scaling in the
z - domain

a n x[n]

X(z / a )

5. Time Reversal

x[-n]

X(z 1 )

nxn

7. Convolution

x 1 [n] * x 2 [n]

X1 (z)X2 (z)

8. Conjugation

x [n]

X (z )

6. Differentiation in
the z domain

d
X ( z)
dz

________________________________________________________________________

Dept. of E&C, NITK Surathkal

Discrete-Time Fourier Series

Definition:

x[n]=

X [k ] e

jkO n

k N

X [k]

1
x[n] e jk0n
N n N

N fundamental period

0 2 /N

Properties of DTFS
________________________________________________________________________
Property
Signal
DTFS coefficient
________________________________________________________________________
x[n]
X[k]
y[n]
Y[k]
________________________________________________________________________
1. Linearity

Ax[n]+By[n]

AX[k]+BY[k]

2. Time shifting

x[n-m]

3. Frequency shifting

4. Time expansion

xn m; n is multiple of m

1
X[k] ; period mN
m

5. Time Reversal

x[-n]

X[k]

6. Modulation

x[n]y[n]

jM0 n

x[n]

jk0 m

X [k ]

X[k - M]

X [m]Y [k m]

m N

7. Periodic Convolution

xn yn

N a k bk

8. Conjugation
x*[n]
X*[-k]
________________________________________________________________________

xn yn =

x m y n m

m N

Parsevaals Relation

Dept. of E&C, NITK Surathkal

1
2
2
x[n] X[k]

N n N
k N

Discrete-Time Fourier Transform

x[n]=

1
2

X (e

)e

j n

X (e

x[n] e

j n

n -

DTFT of Basic Signals

1
1- a e

2) a n u[n] ; a 1

j
1-a e

3) (n 1) a n u[n] ; a 1
1 ; n M
4) x[n]
0; n M

5)

6)

sin Mn
;0 M
n

X [k ] e

k ( N )

jk0 n

2
; 0
N

Dept. of E&C, NITK Surathkal

sin((2M 1)/2)
sin( / 2)
1 ; 0 M
X(e j )
Periodic with 2
0; M

2 X [k ] [ - k0 ]
k -

X[k]

DTFS coefficient

Properties of DTFT
____________________________________________________________________
Property

Signal
Transform
X(e j )
x[n]
Y(e j )
y[n]
________________________________________________________________________
1. Linearity

Ax[n] By[n]

AX(e j ) BY(e j )

2. Time shifting

x[n - m]

e -jm X(e j )

3. Frequency shifting

e j n x[n]

X( e j ( ) )

4. Time expansion

x[n m] ;
n is multiple of m

X( e j m )

5. Time reversal

x[-n]

X( e -j )

6. Differentiation in frequency

n x[n]

7. Convolution

x[n] * y[n]

X( e j ) Y( e j )

8. Modulation

x[n]y[n]

1
X( e j ) * Y( e j )
2

9. Conjugation

x * [n]

X * ( e -j )

d
X( e j )
d

________________________________________________________________________
Note : * indicates periodic convolution
X( e j ) * Y( e j ) =

Parsevaals Relation

Dept. of E&C, NITK Surathkal

X e j Y e j d

x[n]

1
2

X (e j ) d

Discrete Fourier Transform

1
N

N 1

X ( k )e

j 2kn
N

; n=0,1,2.N-1

k 0

N 1

X [ k ] x ( n )e

j 2kn
N

k=0,1,2..N-1

n 0

Where N is the number of samples in the frequency domain in the interval (0 to 2)

Properties of DFT
Property

Time domain Signal

Frequency domain Signal

1) Periodicity

x(n)=x(n+N)
for all n

X(k)=X(k+N)
for all k

2) Linearity

Ax(n)+By(n)

AX(k)+BY(k)

3) Time reversal

x(N-n)

X(N-k)

4) Circular
time shift

x((n-l))N

X(k)e-j2kl/N

5) Circular
frequency shift

x(n)ej2ln/N

X((k-l))N

6) Complex
conjugate

x*(n)

X*(N-k)

7) Circular
convolution

x(n) N

8) Circular
correlation

x(n)

9) Multiplication

x(n)y(n)

y(n)

X(k)Y(k)

y*(-n)

X(k) Y*(k)

1
X(k)
N

Y(k)

of two sequences
N 1

10) Parsevaals

x ( n) y * ( n)
n 0

1
N

N 1

X (k )Y

(k )

k 0

Theorem

Dept. of E&C, NITK Surathkal

Window Functions for FIR Filter Design

Time domain sequence

1) Rectangular window

w(n)=1
=0

; 0nM-1
; otherwise

M 1
2
M 1

2n
1

2) Bartlet (triangular) window

2n
4n
0.08 cos
M 1
M 1
2n
0.54 0.46 cos
M 1
1
2n
(1 cos
)
2
M 1
0.42 0.5 cos

3) Blackman window
4) Hamming window
5) Hanning window

Characteristics of commonly used window functions

Rectangular
Hanning
Hamming
Blackmann

Approximate Normalised
width of
Transition
main lobe
width
4/M
8/M
8/M
12/M

Stop band Passband

1.8/M
6.2/M
6.6/M
11/M

-21
-44
-53
-74

0.7416
0.0546
0.0194
0.0017

Main lobe
relative to
sidelobe
dB
-13
-31
-41
-57

Prototype Butterworth Low Pass Filter Transfer Functions

HB (s)

1/(s 1)

1/( s 2 2 s 1)

1/(s 1)(s 2 s 1)

1/(s 2 0.765s 1)( s 2 1.8477 s 1)

1/(s 1)(s 2 0.618s 1)(s 2 1.618s 1)

Dept. of E&C, NITK Surathkal

Filter Transformations for Analog Filters

Transformation

1) Low pass

s
C

s C
s

2) High pass

Q( s 2 O )
O s
2

3) Band pass

4) Band reject

O s
Q(s 2 O )
2

where C is cut-off frequency,

O
2 1

and 2 are lower and upper cut-off frequencies.

Prototype Low pass Filter has Band Edge Frequency p

1) Low pass

Transformation

'

Band edge frequencies of

' p

p ' p
s

' p

2) High pass

3) Band pass

s p

(s 2 l u )
s ( u l )

l , u

4) Band reject

s p

s ( u c )
(s 2 u l )

l , u

Dept. of E&C, NITK Surathkal

Time domain and frequency domain relationships for sampled signals.

)e j n d
j

X (e

1
2

X e j

x(n)e

j n

( j)e jt d
a

1
2
xa (t )

FOURIER TRANSFORM

dt
jt
a

x (t )e

j2

RM
O
SF
N
n
A
k
j2 N
TR

e
n)
x(

)e

X a ( j)

(k

Dept. of E&C, NITK Surathkal

| | s / 2

X a ( j) TX e jT

X (e j )

X a ( j)

ER
RI
U
FO

1
X a j 2 k / T
T k

1
N
n)
x(

X e j

k]
X[

sin (t nT ) / T
(t nT ) / T

E
ET
CR
IS
D

x nT

x(n)

xr (t )

x(n)

Discrete Time Fourier Transform

xa (t )

X (k ) X e j 2 k / N

FREQUENCY SAMPLING

X (k )

j 2 k
X (e )
X (k ) P e N

k 0

sin(

N
/
2)
P(e j )
e j ( N 1) / 2
N sin( / 2)
j

N 1

10