Digital Signal Processing 2014

INDIA HAS BECOME A
PERMANENT MEMBER OF THE

WASHINGTON ACCORD
Outcome Based Education

Focus
Learning, not teaching
Students, not faculty
Outcomes, not inputs or
capacity Dr.P.Meena,Assoc.Prof., EEE
Components that contribute to

Academic Abilities
Problem solving
Teacher led
Students in pairs/share
Industry Visits
Course
Lectures/Demonstrations/
Videos/Animations /power
point presentations/hand outs
Open ended experiments
Academic
abilities
Components that contribute to

Transferable Skills
Project
work/
Open ended
experiments
Student
Activities
Transferable skills
3
The components of course delivery that contribute

to the defined attributes of the course .
Technical
Symposia
Attributes
Dr.P.Meena,Assoc.Prof.,EEE
Digital Signal Processing

Introduction
with the development
of Digital Hardware such as digital
hardware.
Inception:1975
Personal computer revolution in

1980s and 1990s caused DSP explosion
with new applications.
Dr. P.Meena, Assoc.Prof(EE) BMSCE
Advantages of DSP Technology

High reliability
Reproducibility
Flexibility & Programmability
Absence of Component Drift problem
Compressed storage facility (especially in
the case of speech signals which has a lot
of redundancy).
DSP hardware allows for programmable
operations.
Signal Processing functions to be
performed by hardware can be easily
modified through soft ware(efficient
algorithms)
Advantages of DSP Technology

High reliability
Reproducibility
Flexibility & Programmability
Absence of Component Drift problem
Compressed storage facility (especially in
the case of speech signals which has a lot
of redundancy).
DSP hardware allows for programmable
operations.
Signal Processing functions to be
performed by hardware can be easily
modified through soft ware(efficient
algorithms)
Digital Signal Processing

with overlapping borders
A TYPICAL DIGITAL SIGNAL

PROCESSING SYSTEM
x(t )
d
B
xa (t )
A/D
CONVERT
ER
x(n)
s(n)
Dig.Sign
al
Processo
r
Analog
Low pass Discrete
prefilter or
filtered
time
Antialiasin
signalSampli
signal
g
ng
filter
freque
ncy
D/A
CONVERT
ER
Discrete
time
signal
d
B
s (t )
Reconstructi
on
filter same
as the pre
filter
1010
Course Outcomes
CO1: Ability to apply the knowledge of

mathematics, science and fundamentals of
signals and systems to ascertain the behavior
of complex engineering systems.
CO2:Ability to Identify techniques, formulate
representations and analyze responses of
digital systems.
CO3:Ability to Design digital system
components and test their application
using
modern
engineering
tools,
as
solutions to engineering problems.
11
Course Contents
Different operations on a signal in the
digital domain
Different forms of realizations of a
Digital System.
Design Procedures for Digital Filters
12
Outcomes of this Course:

By The End Of The Course ,
Distinguish The Digital and Analog Domains.
Analyse Signals, and reconstruct.
Develop Block Diagrams
Representations,.
For
Different
System
Design Analog And Digital Filters.

Ready to Take up Specialized Courses in Audio, speech,
image and Real-time Signal Processing, Further On
1313
Course Outline
Course Delivery:
Lecture,hand outs,videos,animations,discussions,activities
Course Assessment:
Marks:
Tests: 20 (T1 & T2)
Quiz ; 05
Tutorials: 10
Lab: 15
14
Review of
Signals
&
Systems
1515
Signals
Audio
Video
(Represented as a function of 3 variables.)
Speech Continuous-represented as a function
of a single (time) variable).
Discrete-as a one dimensional
sequence which is a function of a
discrete variable.
Image:
Represented as a function of two spatial
variables
Electrical Dr. P.Meena, Assoc.Prof(EE) BMSCE
1616
17
18
19
Relation
between analog
frequency and digital
frequency
2 f unit is radians per second.
y=a sin t , is a signal in the continuous time domain.
t=n*T s
z=a sin( nT s )
z a sin(n)
where =T
is the digital frequency in radians/sample
Therefore, given a 2 f , to get

2 f
or (2 f * T s )
s
2020
-Fs
-3/2Fs
=-3
-Fs/2 -Fs/4
Fs/4 Fs/2
Fs
=-2 =- =- =0 =/2= =2
/2
3/2Fs
=3
f in Hertz(analog)
in radians/sample
Digital
Nyquist interval
Sl.
No.
Frequency
in Hertz
Of the
signal
1.
f=0
Fs
2.
f=Fs/4
Fs
/2
f=-Fs/4
Fs
-/2
4.
f=Fs/2
Fs
5.
f= -Fs/2
Fs
=/2,f=Fs/4
=,f=Fs/2
=-,f=-Fs/2
f=0,=0
0
Sampling
Frequency
Fs in Hertz
in
radians
/cycle
= -/2,f=-Fs/4
Diagrammatic Representation of relation between analog

frequency and digital frequency:+ve angle counter
clock wise
21
Sampling of continuous time signals

The Fourier transform pair for continuous-time
signals is defined by
XXa x xae e
a
j t
jt
dt
dt
1
x a t 2
j e
X
j t
1
jt
If x is sampled
uniformlyat
times
T seconds
apart
e
x
X
a
a
from
to a discretesignal x[n] is
2time
obtained.
x[ n ] x a ( t )
t nT
22
The Fourier transform of the resulting sequence

x[n] can be shown to be
T
Xe
Thus X e
1
1
Xa j 2 r
T r T
ana log
T
is the sum of an infinite number of

amplitude-scaled, frequency-scaled, and
translated versions
Xa j of
The Fourier transform of the continuous-time x a t

signal
is illustrated in the following figure..
23
24
j
From the figure it is easy to see that the triangles
X of
Will not overlap if0 T <
0
T
This inequality can be re arranged to give,

1
If we let,0 equal 2f0 where f0 is in Hertz, the above inequality

becomes,
1
2f 0
Therefore, if the sampling rate I/T is greater than 2 f 0 no overlap

occurs. If there is no overlap,X
the
spectrum
j
a
Can be found and by the inverse transform
xa t
can be reconstructed. If however,
0 T >
The triangles will overlap and the spectrum of the continuous
signal cannot be reconstructed
25
The Sampling
signalTheorem
xa(t)
can
A
be
reconstructed from its sample
values xa(nT) if the sampling
rate 1/T is greater than twice
the highest frequency (f0 in
Hertz ) present in xa(t).
The sampling rate 2f0 for
an analog band limited
signal is referred to as the
26
Effect of Variation of Sampling frequency on the sampling of a sine wave of

frequency 50Hz.
27
28
Periodic Signals
What is the equation to

this sequence ???
,
2 N
2929
APeriodic Signals
Extract from cnx.org
3030
Consider,
Consider,
cos
0
.
4
cos
0
.
4
n
x
1
x1
cos
1
.
6
cos
2
.
4
n
x
2
x2
cos 0.4n 2n
cos 0.4n 2n
cos 0.4n
cos 0.4n
The two signals shown though

of different digital frequencies
have the same sampled
sequence .
31
Therefore we find that a

sampled sine wave of
frequency f is indistinguishable
from a sine wave of frequency
fs-f, fs+f,2fs-f,2fs+f.
Or in general kfs f for any
integer k.
These set of frequencies that
are indistinguishable from one
another are called aliases and
32
He
H
H
e
e
jn
h (n ) e
jn
h (n ) e
j( 2 )
He
jn
Is the frequency response of the system

is recognized as the Fourier transform of
the systems impulse response
jn
Linear Shift
Invariant
System
jn
h (n ) e
j 2 n
jn j 2 n
h (n ) e
j n
33
Frequency spectrum of a 100Hz sine wave Frequency spectrum of a 100Hz

sampled at 500Hz
sine wave sampled at 80Hz
Under Sampling
34
Alias during under sampling
35
Effect of Aliasing
Plot of Cos(0.4*pi*n)
0
-1
10
n
Cos(2.4*pi*n)
-1
0
5
10
15
15
Cosine wave of frequencyn 600Hz sampled at 500Hz
1
x2(t)
x2[n]
1
0
-1
Cosine wave of frequency 100Hz sampled at 500Hz

1
x1(t)
x1[n]
10
15
0
-1
10
15
Effect of aliasing
3636
Real &Imag parts of
jt
3737
Representation of a Complex
Exponential Function
Extract from cnx.org
3838
Two dimensional plot of
jt
3939
Frequency content of a
signal
Continuous time :
Periodic Fourier series
Non-periodicFourier transform
Discrete time:
Discrete Time Fourier Transform-DTFT
Discrete Fourier Transform
-DFT
4040
THE DISCRETE TIME FOURIER TRANSFORM

The discrete time Fourier transform of a
sequence: j
jn
X e x (n ) e
, dig.freq
The discrete time Fourier transform of a

system:
H e h ( n ) e
jn
j( 2 )
h (n ) e
h (n ) e
j 2 n
jn j 2 n
h (n ) e
jn
It seen that the discrete time Fourier

transform of a system is 2 periodic and
continuous in
Dr. P.Meena, Assoc.Prof(EE)

41
BMSCE
Inverse Discrete Time Fourier Transform (iDTFT)
1
j jn
x n X e e d
2
42
DTFT of a Sinusoidal signal of

analog frequency 50Hz
43
1.If x[n ] [ n ], Its DTFT : e j

2.If x (n ) 1,2,3.4,5
- jn
[
n
]
e 1.
X e j x n e jn 1. e j 2 3 e- j 4 e-2j 5 e-3j
Dr. P.Meena, Assoc.Prof(EE) BMSCE 44
DTFT of a Discrete Impulse
45
Discrete
Function
Unit Step
Magnitude
of the DTFT
46
Disadvantage of DTFT
1.The Transfer function is a function of the continuous variable
.
2. This needs computation of infinite sum at
uncountable
infinite frequencies.
3.Hence the above transform is not numerically computable.
4.The transform is defined for aperiodic sequences.
4747
A repeated sequence of finite

length N
x[n]=0 for n<0 and >N;
0 otherwise
x ( n ) x n rN
r
x ( n mod ulo N)
x n
N
48
Discrete Fourier Transform, DFT
is digital frequency
N 1
X k x n e
jk 0 n
,0 k N 1
n 0
2
where , 0
.
N
THE IDFT is,
1
x n
N
N 1
X k e
k 0
jk 0 n
,0 k N 1
49
N 1
X k x n e
jk 0 n
,0 k N 1
n0
2
where , 0 .; x( n ) [1 0 1]
N
2 2
0 .
N
3
X 0 x 0 e
2
jk .0
3
1. 0 1 2
x 1 e
2
j 0 .1
3
x 2 e
50
2
j 0 .2
3

2
X (k ) n 0 x (n) e j N
N 1
W
X
nk
....k 0,1, 2,....N 1
2
N
N 1
n 0
x ( n )W
kn
N
where
j 2 / N

P.Meena,Asst.Prof(EE)BMSCE
51
51
X (k ) n 0
N 1
x ( n)
WN
W
e
N
....k 0,1, 2,....N 1.
nk
....k 0,1, 2,....N 1.
2
N
is known as twiddle factor.

.
2
j
e N
1 N roots of Unity.
2
j
e N
W N
X ( k ) n 0 x ( n)
N 1
nk
5252
The Locus of the Twiddle Factor

for N roots traces N points on a
unit circle.
5353
2.Find the four point DFT of the sequence :

x[n]=(1,0.5,0.25,0.125)
j
W 4 e 4

Cos jSin j1
2
2
5454
Location of Roots
-1=W4 2
0
4
j 0 1
j=-1=W4 3
1=W4 0
1
1
W 4 j j
2
4
j2 1
-j=--1=W4 1
3
3
W 4 j j
5555
X (0)
X (1)
X (2)
X (3)
1
1
1
1
1.875
j 1
j
0.75-j0.375
0.5
k 1 1 1 1
0.625
0.25
j 1 j
1
0.125
0.75+j0.375
144424443
n
1
W4 kn
56
Solution:
X (0)
X (1)
X (2)
X
(3)
1
1
1
1.875
j 1
0.75-j0.375
0.5
k 1
1
1 1
0.625
0.25
j
1 j
1
0.125
0.75+j0.375
144424443
n
1
j
1
1
W4 kn
5757
Circular Folding x[n]
=[1 2 3 4 5 6 7 8 9 10 11 12 13 14]
x[k ]
x[1k ]
x[2k ]
mod N
14
13
12
11
5
6
7
10
[1 14 13 12 11 10 9 8 7 6 5 4 3 2]
mod N
mod N
[2 1 14 13 12 11 10 9 8 7 6 5 4 3 ]
[3 2 1 14 13 12 11 10 9 8 7 6 5 4 ]
........... so on
N
58

DFT
Its
a numerically computable transform.

Its obtained by sampling the discrete
time Fourier Transform in the frequency
domain.
This is developed by analyzing periodic
sequences such as the Discrete Fourier
Series.
DFS is then extended to finite duration
sequences, leading to DFT
5959
Discrete Fourier Transform, DFT
60
61
62
63
64
The importance of DFT

From the frequency sampling theorem it can be concluded that N
equispaced samples of the Discrete Time Fourier Transform of the N
point sequence x(n) can uniquely reconstruct X ( j )
These N samples around the unit circle are called the discrete
Fourier transform coefficients.
It is clear that the DFS is practically equivalent to the DFT when
0 n N 1
If x(n) is a sequence defined only over the interval from0 to N-1,

the DFT,X(k) of x(n) is defined only over the same interval from 0
to N-1.
6565
The IDFT-Inverse DFT

1
x n N
:
X k e
N 1
k 0
2
kn
N
, n 0, 1,.......
1 N 1
Kn
x(n )
X
K
W N , n 0,....... N 1
N k 0
6666
Assignment
3.Find
the eight point DFT of the

sequence :
x[n]=(1 2 3 4 4 3 2 1 )
6767
Resolution of the Frequency spectrum for

longer DFT
68
Properties of the DFT

Linearity : The DFT is a linear transform
DFT [ax1[n]+bx2[n]]= a DFT[x1[n]]+ b DFT [x2[n]]
If x1[n] and x2[n] have different durations that is,
they are N1 point and N2 sequences,
respectively, then choose N3 =max(N1,N2) and
proceed by taking N3 point DFTs.
69
HOMOGENITY OF THE DFT
70
Frequency response of the impulse response

with padded zeros.
71
72
73
4 point DFT plots of a sequence x[n]=[1 1 1 1]

in Matlab
P.Meena,Asst.Prof(EE)BMSCE
7474
The Eight point DFT of [1 1 1 1]

obtained by appending with zeros
7575
Effect of zero padding

The
zero padding gives a High density

Spectrum and a better displayed version
for plotting but not a high resolution
spectrum.
More data points needs to be obtained in
order to get a high resolution spectrum
7676
DFT plot indicating the symmetry

about =pi
7777
MATLAB PROGRAM
n=input('input
the values of nin the form

[0:deltaN:N-1]=');
k=input('input the values of kin the form
[0:deltak:k-1]=');
xn=input('input the sequence of signal values=');
w=(2*pi/(length(n))*k);
WN=exp(-j*2*pi/(length(n)));
nk=n'*k;
WNnk=WN.^nk;
Xk=xn*WNnk;
stem(w/pi,abs(Xk))
7878
Let
x[n] be a 2N valued real sequence

DFT co - eff X(N K) and X(N - K) are complex
conjugate
7979
Circular Folding
x[n]=[1 2 3 4 5 6 7 8 9 10 11 12 13 14]
x[-n]modN=[1 14 13 12 11 10 9 8 7 6 5 4 3 2]
14
13
12
11
5
6
7
10
DFT [x((-n))N]= X((k)) N =
8080
Circular Shift
x[n]
14
13
x[n-1] mod 14
12
x0
x13
x0 x13
x12 11
x12
x1
x1
12
2
x11
3
x11
x2
x2
x10 10
x10 11
x9
x9
3 x3
9
4
x3
10
x8
x8
x4
8
x4
9
x7
x7
4
x5
5
x5
x6
x6
7
8
2
1
5
6
7
6 [right shift the sequence]14
3
14
x0 x13
13
x12
x1
x[n+1] mod 14
4
x11
x2
x10 12
x9
5 x3
11 [left shift the sequence]14
x8
10
x4
x7
6
x5
x6
81
9
7
8
2
13
14
x[ n] [1,2,3,4,5,6,7,8,9,10,11,12,13,14]
x[ n 1]mod14 14,1,2,3,4,5,6,7,8,9,10,11,12,13
x[ n 2]mod14 13,14,1,2,3,4,5,6,7,8,9,10,11,12
x[ n 1]mod 4 2,3,4,5,6,7,8,9,10,11,12,13,14,1
x[ n 2]mod 4 3,4,5,6,7,8,9,10,11,12,13,14,1,2
In general,
x[n] [ x(0), x(1),........x( N 3), x( N 2), x( N 1)]

x[n 1] [ x( N 1), x(0), x(1),........x( N 3), x( N 2)]
x[n 2] [ x( N 2), x( N 1), x(0), x(1),........x( N 3)]
mod N
mod N
x[n] [1 2 3 4 5 6 7 8]
(n-2)
[7 8 1 2 3 4 5 6]
82
Properties of Discrete Fourier

Transform
1.Linearity: The DFT is a linear transform
DFT [ a x1 ( n) b x2 ( n)] a DFT [ x1 ( n)] bDFT [ x 2 ( n)]
x (n) 2 1; x
1
a[ X 1 ( k )] b[ X 2 ( k )]
2
x (n) [6 3]; ,
b 4, b x ( n) [8 12]
( n) [ 2 3]; If a 3, a
DFT[a
29
(
n
)]
b
(
n
)]
DFT[
14
15]
1
x1
x2
3
5
(
k
)
;
(
k
)
1
X
1
2
1
Let a 3; b 4
9
(
k
)
3 ; b
1

1
(k ) b
20
(
k
)
4
2
29
(
k
)
1
2
8383
2.Circular Folding /Shift :
DFT
x[n] X [K ]
mod N
mod N
let x[n] [1 2 3 4]
x[n]
mod 4
[1 4 3 2]
let x[n] [1 2 3 4]
-2+j2
-2
10
10
-2 j2
-2 j2
; DFT [ x[n] ]
X[K]
mod
4
-2
-2
-2-j2
-2
j2
10
-2+j2
-2 j2
X [ K ]mod 4 -2
-2
10
-2 j2
-2-j2
10
-2-j2
8484
3a.DFT of circular shifted sequence
If DFT[x[n]]=X[K]
then DFT
x[n-m]
mod4
mod N
If x[n]=[1 2 2 0]. Find DFT of
x[n-1]
Km
W N X[K]
x[n],x[n-1]mod 4 , x[n-2]
mod 4
[0 1 2 2]
1 1 1 1
1 -j -1 +j
1 -1 1 -1
1
+j
-1
-j
5
0
1
j
2

2
1

2

j
85
3a.DFT of circular shifted sequence
DFT
x[n-m]
mod N
DFT
X (0)
X (1)
X (2)
X
(3)
Km
x[n-1]
W N X[K]
1
K1
mod 4
W 4 X[K]
1 1 1 1 1
1 -j -1 +j 2

1 -1 1 -1 2
1
+j
-1
-j
0
5* 0
W
4
-1-j2* 1
W4
DFT x[n 1]
4
2
1*W 4
-1+j2* 3
W 4
-1
5
-1-j2
1
-j
-1+j2
5*1
(-1-j2)*(-j)
1*(-1)
(-1+j2)*(j)
-2+j
-1
-2-j
86
Find the DFT of
Circular Convolution
Find the circular convolution of ,
[1 ,2 ,2, 0] and [1,2,3,4]
4.If x[n] is a 2N valued real sequence,
X[N+k] and X[N-k] are complex conjugate.

X[0] X[1] X[2] X[3] X[4] X[5] X[6] X[7]
87
Inverse DFT of a sequence

x[n]=
x[n]=
Find the inverse DFT of [ 5 (-2+j1) -1 (-2-j1) ]
88
3b. Multiplication by Exponentials or Cicular Frequency Shift
DFT W N x[n ]
mn
X (K m)
If X(K) is circularly shifted, the resulting inverse transform will be the

multiplication of the inverse of X(K) by a complex exponential.
If g[n] and h[n] are two sequences of length 6. They have six point DFTs
G[K] and H[K] . The sequence g[n] is given by
g[n]= { 4.1, 3.5, 1.2, 5, 2, 3.3}
If DFTs G[k] and H[k} are related by circular frequency shift as,
H[k]=G[k-3] 6 Find h[n].
8989
Consider
What
x[n]=[ 1 2 3 4 5 6 7 8 9]
is
x[n-4]
mod4
?????????
90
x1[n]
x [n] [1 1 1 1]
[1 2 2 0];
5
1
X 1[ K ] 0
j 2
j 2
20
0
[K ]
2
0

0
X [K ] X
1
20

0
IDFT
0

0
1 1
4 1
4
0

[K ]
2
0

0
IDFT
1 1 1 20
+j -1 -j 0
-1 1 -1 0

-j -1 +j 0
X [K ] X
1
[ K ]
5
5
5
91
1 1 1 1
x1[n] x 2[n] 1 2 2 0
1 2 2 0 1 2 2 0 1 2 2 0 1 2 2 0
x1[n]
x 2[n k ]mod 4 1111 1111 1111 1111
------- ------- ------ -----5
5
5
5
[
n
]
[
n
]
x1
x2
IDFT
X [K ] X
1
[ K ]
92
Evaluating the IDFT

Find
the IDFT of [5 (-1-j2) 1 (-1+j2)]
1 1 1 1
x1[n] x 2[n] 1 2 2 0
1 2 2 0 1 2 2 0 1 2 2 0 1 2 2 0
x1[n]
x 2[n k ]mod 4 1111 1111 1111 1111
------- ------- ------ -----5
5
5
5
+j
-1
1
-j
kn
N
93
Circular Shift
x[-n]=x[N-n]modN
3
n=2 n=1
4
n=3
4
n=2 n=1
n=4
x[n+1]
n=0
n=4
4
5
n=0 2
n=5
1
n=3
x[n]
n=2 n=1
n=5
n=3
n=0
n=4
n=2 n=1
n=3
1
n=4
x[n+2]
n=5
5
x[n-1]mod6
1
6
5
n=2 n=1
n=0 3
n=3
n=5
2
x[n-1]=x[n+5]modN
n=4
2
x[n+3]
n=0
n=5
3
n=2 n=1
n=3
3
n=4
n=0
n=5
4
x[n+4]
94
Symmetry property for real valued x[n]

If the sequence is real, X[N-k] =X*[k]=X[-k]
If the first 5 points of the 8 point DFT of a real valued sequence are
X[k]=[ 0.5 (1-j) 0 (1-j1.72) 0 ],find the remaining 3 points of the
DFT.
From the symmetry property,

X[N-k]=X*[k]
If x[n]=
Find the four point DFT of x[n].
[ 4 ( -1+j) 2 (-1-j ) ]
95
If x[n] is real ,We know that DFT of x[-n] = X[-k] = X[N-k}=

X*[K]
Example DFT of[1 ,2, 3 ,4]
Which implies that, for real valued time signals,
X*[K]= X[-K]
And for imaginary valued time signals,
X*[K]= -X[-K]
Conjugation:
DFT [x*(n)]= X* ((-K))N
96
Symmetry properties for real sequences

If x[n] is real and a N point sequence. then x[n]=x*[n]. Using the
above property,
X(K)= X*(-K) N
97
x(ev)[n]= 1/2[ x[n]+x[-n]]

X (ev) (K)=1/2[ X[K]+X[-K]]
If signal is real, x[-n]=x[n]
Therefore X[-K]= X*[K]
Hence X[K] is real and even=
[ X[K]+X*[K]]=X(real)[K].
Case 2:
If x[n] is real and odd, then its X[K] is purely
imaginary
X(odd)[n]= 1/2[ x[n]-[-n]]
Therefore, X(odd[K])=1/2[X[K]-X[-K]]
=jX(imag)[K].
98
Case 3 :
If x[n] is imaginary and even, then its X[K] is purely imaginary.
x(ev)[n]= 1/2[ x[n]+x[-n]]
X (ev) (K)=1/2[ X[K]+X[-K]]
If the signal is imaginary,
Then we know that X*[K]=-X[-K].
Hence X[K] imaginary and even,
=1/2[X[K]-X*[K]]
= jX(imag)[K].
Case 4 :
If x[n] is imaginary and odd , then its X[K] is purely real.
X(odd)[n]= 1/2[ x[n]-[-n]]
X(odd[K])=1/2[X[K]-X[-K]]
If signal is imaginary
X*[K]=-X[-K],therefore
[X[k]+x*[-K]]=1/2[ X(real)[K + j X(imag)[K] + [ X(real)[K - j X(imag)[K]
= X(real[K]).
99
Complex Conjugate Properties

x*[n] has a DFT X*[N-k]= X*[-K]
100
Even and odd parts of a sequence
x
x
n x n x n
ev
mod N
2
1
n x n x n
odd
mod N
2
Find the even and odd parts of the sequence
x[n]=[1 2 2 0]
101
Real and Imaginary Parts of X[K]
1
*
xre n 2 x[n] x [n]
1
*
xIm n 2 j x[n] x [n]
1
*
X re K 2 X [ K ] X [ K ]N
1
*
X im K 2 X [ K ] X [ K ]N
102
Computation of N point DFT of a real sequence using N point DFT.

g[n]=[1 2 0 1]; h[n]=[2 2 1 1]
x[n]=
103
104
Multiplication:
It is the dual of the circular convolution
property.
1
DFT x1[n] x1[n]
N
[K ] X 2[K ]
105
106
Parsevals Relation
This
Computes the energy in the frequency

domain
N 1
E x[n]
x
n 0
The quantity
N 1
X [K ]
k 0
X [K ]
is called the energy spectrum of finite
N
duration sequences.Similarly , for periodic sequences, the quantity
:
X (K )
N
is called the power spectrum
107
Some quick relations:

N-1
3.
-kn
1. f x[n]= 1
X[K]
WN
N k=0
1 N-1
1 N-1
0
x[0] X[K]W N X[K]
N k=0
N k=0
If x[n] be a 2N valued real sequence,

2N-1
X[N]= x[n](-1)
n=0
N-1
X[K]=Nx[0];
k=0
2.
N 1
E x[n]
x
n0
1 N 1

N k 0
X [K ]
OR
N 1
X [K ]
k 0
N 1
N
n 0
x[n]
108
Problems on Quick Relations

x[n] [1 2 0 3 -2 4 7 5]
with a 8 point DFT X(K). Evaluate the following without
explicitly computing
X(K).
1)x[0]
2)x(4) 3)
X (K )
k=0
4)
k=0
X (K )
Ans: 1)20
2)-8
3)8
4) 864
109
DFT OF A 50 Hz SINE WAVE SAMPLED AT 8KHZ
Magnitude
100
50
0
w in radians
angleindegrees
magnitude
100
50
0
20
40
60
80
k
100
120
140
160
20
40
60
80
k
100
120
140
160
100
0
-100
magnitude
100
50
0
0.2
0.4
0.6
0.8
1
w/pi
1.2
1.4
1.6
1.8
110
DFT & Energy Spectrum OF A 50 Hz SINE WAVE with SAG

1
0
magnitude of DFT
Energy Spectrum
-1
0 5
x 10
10
500
1000
1500
DFT and energy spectrum of a wave form with sag
2000
2500
5
0
0
1000
500
1000
1500
2000
2500
mag of DFT
500
0
1000
500
0
500
1000
1500
500
1000
1500
2000
2500
100
0
-100
2000
2500
1000
500
0
0.2
0.4
0.6
0.8
1.2
1.4
Dr.
BMSCE
1.6 P.Meena,
1.8Assoc.Prof(EE)
2
111
DFT & Energy Spectrum OF A 50 Hz Normal SINE WAVE and a Sine wave with
sag
112
DTMF TONE Allocation
P.Meena,
Dr. P.Meena,
Asst.Prof(EE)
Assoc.Prof(EE)
BMSCE
BMSCE
113
113
DFT of DTMF
114
Use of DFT in Linear Filtering
115
Therefore zero padding is used to make

the signals of equal length.
116
Linear Convolution & Circular

Convolution.
FIR(Finite Impulse Response) filters are implemented using linear
convolution.
Given two sequences
x n and x n of length N and

1
N2 ,
Both sequences are made of the same length N by

padding an appropriate number of zeros, then the
circular convolution is identical to linear convolution.
N N1 N 2 1
117
Let
x1 n [1 2 2 1]; x2 n [1 1 1 1];
Determine their linear convolution.
Compute the circular convolution and show
that they are equal.
Ans : [ 1 1 - 1 - 2 - 1 1 1].
118
Error between Circular convolution & Linear

convolution due to choice in N
When N=max(N1,N2) is chosen for circular
convolution then the first M-1 samples are
in error where M=min(N1,N2).
Hence this leads to different methods of
convolution in block processing.
119
BLOCK CONVOLUTIONS
Necessity of Block Convolutions:
To filter an input sequence received continuously such as a speech
signal from a microphone and if this filtering operation is done
using a FIR filter, in which the linear convolution is computed using
the DFT then there are some practical problems .
A large DFT is to be computed.
Output samples are not available until all input samples are
processed resulting in a large amount of delay.
In Block Convolution:
The speech signal is segmented into smaller sections /blocks .
Each section is processed using the DFT
Finally the output sequence is assembled by assembling the
outputs of each section.
120
Errors in BLOCK CONVOLUTIONS
If x[n] is sectioned into N point sequences and

The impulse response of the filter is an M point sequence ,
where M <N.
Then the N point circular convolution between the input block
and the impulse response will yield a block output sequence
in which the first M-1 samples are not the correct output
values.
Therefore x[n] is partitioned into sections by adding M-1
zeros into first section each overlapping with the previous
one by exactly (M-1) samples, save the last (N-M+1) output
samples and finally concatenate these outputs into a
sequence.
To correct for the first M-1 samples in the first output block,
set the first (M-1) samples in the first input block to zero. This
procedure is called the Overlap save method
P.Meena, Asst.Prof(EE)
Dr. P.Meena, Assoc.Prof(EE)
BMSCE
BMSCE
121
121
h[n] [1 2] [1 2 3 4 5 6];
length of h[n]=M;
length of x[n]=L;
To evaluate the length of the sequences N for convolution,
2
2
M
2
M N 1,
2 N 1, N 4 1 3. N 4
In Overlap and save method,Input sequence overlaps by (M-1) samples.

h[n] [1 2 0 0]; x1[n]=[0 1 2 3],x 2 [n]=[3 4 5 6]
1200
1200
0321
----------
1032
-----------
---------
1
-----------
1200
1200
|1 2 0 0
2103 3210 |3654

----------- ----------- |---------4
7
|
----------- ----------- |----------
1200
4365
----------10
-----------
1200
1200
5436 6543
----------- ----------13
16
----------- -----------
The linear convolution result y[n]=[1 4 7 10 13 16]
122
Using overlap and save method compute y[n] if h[n]=[3 2 1]

And input x[n]=[ 2 1 -1 -2 -3 5 6 -1 2 0 2 1 ].
Use only 8 point circular convolution.
M=3;
x1[n] [0 0 2 1 - 1 - 2 - 3 5]
x2 [n] [3 5 6 - 1 2 0 2 1]
h[n] [3 2 1]
123
h[ n] [1, 2]
Overlap and Add method of Sectional Convolution:
x[n] [ 1 2 3 4 5 6],
N is the size of circular convolution
2 M M L 1;
4 2 L 1;
L 3, is the block size considered in the array.N 4
h[ n] [1 2 0 0]
x[ n] [1 2 3 0]; [4 5 6 0]
12 0 0
12 0 0
12 0 0 12 0 0
12 0 0
12 0 0 12 0 0 12 0 0
10 3 2
210 3
3 210 0 3 21
4065
5406 6540 0654
------ -------- -----------1
------------- -----------
6
4
13
16
12
------------------------------------------------1
10
13
16
12
-----------------------------------------------Dr. P.Meena, Assoc.Prof(EE) BMSCE
124
Verify by overlap and Save Method

M 2, 2 M N M L 1
N 4; L 3; M 1 2
h[n] [1 2 0 0]
x1[n] [0 1 2 3]
x2 [n] [3 4 5 6]
x 3 [ n ] [6 0 0 0 ]
12 0 0
1 2 0 0 1 2 0 0 1 2 00
0 3 21
10 3 2 210 3 3 210
------ -------- ------------ ----------------------------6
------ -------------------------------------------------12 0 0
1 2 0 0 1 2 0 0 1 2 00
12 0 0
1 2 0 0 1 2 0 0 1 2 00 |
3654
43 65 5436 6543
6 0 0 0 0 6 0 0 0 0 60 0 0 0 6
--------------------------------------------------------15
10
Ans : [ 1 4
13
16
12
7 10 13 16 6 12]
125
Obtain the DFT of the sequence

2nK 0
x[n] cos
where 0 n N - 1.and hence find the
N
energy content.
126
127
128
DFT of a Square Wave
129
Relationship of the DFT to Other

Transforms
Relationship
X ( z)
to Z- transform:
n
x
[
n
]
z
n
N 1
X ( K ) x[n]WNkn
n 0
sin ce x[n] 0 outside the range 0 n N - 1,

N 1
X(z) x[n]z n
n 0
z e j , X ( K ) X ( z ) z e j 2Nk W k
N
130
Find the Z transform of [0.5 0 0.5 0].Using

the Z transform find its DFT.
X(z) 0.5 0.z 0.5 z
-1
0. z
0.5 0.5 z
X (k ) X ( z ) z W k
N
X (0) 0.5 0.5W40.2 0.5 0.5 1.0

X (1) 0.5 0.5W
1.2
4
X (2) 0.5 0.5W
2.2
4
0.5 0.5 0
0.5 0.5 1.0
X (3) 0.5 0.5W43.2 0.5 0.5 0.0

131
The Limitations of the direct

calculation of the DFT
It
requires
2
N complex multiplications and N(N - 1) complex
additions.
For direct evaluation of X(k) for each k requires 4N
real multiplications, four for each pair
132
THE FAST FOURIER TRANSFORM

This is proposed by Cooley and Tukey
Based on decomposing /breaking the
transform into smaller transforms and
combining them to give the total
transform.
This can be done in both Time and
Frequency domains.
133
DECIMATION
IN
TIME
FFT
The number of points is assumed as a power of 2,that

is
N 2v
This approach is one of breaking the N - point
N
transforms into two po int transforms and then breaking
2
N
N
each point transform into two po int transforms
2
4
until two - point transforms are obtained.
134
X [K ]
( N / 2 ) 1
x[2m ]W
m 0
2 mk
N
( N / 2 ) 1
x[2m 1]W
k
N
m 0
.WN2 mk
for k 0,1,....., N - 1.
using the relation,
WN2 W
X [K ]
N
2
, it follows that,
( N / 2 ) 1
x[2m ]W
m 0
mk
N
2
k
N
( N / 2 ) 1
x[2m 1]W
n 0
mk
N
2
for k 0,1,....., N - 1.
we now define new functions as,
( N / 2 ) 1
x[2m ]W
G[ K ]
m 0
H [K ]
mk
N
2
, DFT x ( 2m ) with N / 2 po int s
( N / 2 ) 1
x[2m 1]W
m 0
mk
N
2
, DFT x ( 2 m 1) with N / 2 po int s
N
N
], for , k 0,1,.....,
- 1.
2
2
N
N
H [K ] H [K
], for , k 0,1,.....,
- 1.
2
2
substituting this into the expression for X[K], yields
the first half frequency bins,
N
X [ K ] G[ K ] WNk H [ K ], for , k 0,1,.....,
- 1.
2
Considering the following fact and using the above equations,
note that G[ K ] G[ K
WN
N
K )
2
X( K
WNk , then the second half of frequency bins can be computed as follows,
N
N
) G[ K ] WNk H [ K ], for , k 0,1,.....,
- 1.
2
2
135
https://engineering.purdue.edu/VISE/ee438/demos/flash/decimation.swf
136
2-POINT DFT
x0
0
2
W
x1
x0
x2
4-POINT DFT
X (1)
W21
X(0)
W20
W40
W21
1
4
x1
x3
X ( 0)
2
4
W20
1
2
3
4
X(1)
X(2)
X(3)
137
Find the DFT of x[n]=[1 2 3 4] using DIT algorithm

Ans:[10 -2+j2 -2 -2-j2].
Find the inverse of :[10 -2+j2 -2 -2-j2].
using DITFFT.
138
139
BIT REVERSED SEQUENCE EIGHT POINT DFT

1
x0
x[n]=[1, -1, -1, -1, 1, 1, 1, -1]
x4
1
2
W20
x3-1
W
1
2
X(3)
W83 1.53-j0.39
-2j
3
4
-2
W40 -2
W41
-2
0
2
X(1)
W81 3.69+j1.96
X(2)
W 2 2.82-j0.78
8
-2
1
2
-1
x7
W42
W20
W8
2j
W41
-2
-1
x1
x51
1
2
0
4
x2 -1
x61
W20
X(0)
0.0-j0.0
0
W42
0
3
4
4
8
W
W85
2
-2
W86
W87
X(4)
4-j0.0
X(5)
1.53+j0.39
X(6)
2.82+j0.78
X(7)
3.69-j1.96
140
141
W 1;
W -1
2
2
W
j
2
2
2
W8 j
2
2
W
j
2
2
6
W8 j
2
2
W
j
2
2
2
2
W
j
2
2
0
8
1
8
3
8
4
8
5
8
7
8
142
Let x[n] [x 0 x1 x 2 x 3 ]
Divide or decimate into
[x 0 , x 2 ], [x1 , x 3 ]
Let x[n] [x 0 x1 x 2 x 3 ]
Divide or decimate into

[x 0 , x 2 ], [x1 , x 3 ]
x[ n] [1 0.5 0.25 0.125]
1.25
x0 1
x 2 0.25
x1 0.5
0
2
W
W21
0.75
00.625
W
2
x 3 0.125
1
W2 0.375
X(0)=1.875
0
4
1
4
2
4
3
4
W
W
X(1)=0.75-j0.375
X(2)=0.625
X(3)=0.75+j0.375
143
Computation of Inverse DFT
The inverse DFT is given by

1 N 1
kn
x[n] X [ K ]WN .
N k 0
Find the IDFT of
[5 - 1 - j2 1 - 1 j2 ]
Twiddle Factors are negative powers of
WN
The output is scaled by 1/N

144
x0 5
x2 1
4
W40
0
2
W
1
2
x1 1 j 2
0
2
x3 1 j 2
2
4
3
4
1
2
8
W41
W
W
j4
1
4
1
4
1
4
1
4
2
0
+j
-1
-j
145
x0 1
x1 1
x 2 1
21
W20
W21
W
W
2-j2
W43
W20
W40
1
4
3
0
2
W
1
2
2+j2
6)
W21
2+j2
0
2
4
x2 1
x3 2
1
4
W21
x0 2
x1 1
W40
0
W20
x3 1
W42
1
3
4
1+j
0
1-j
146
x0 0
x2 0
x1 j 4
x3 j 4
W40
0
2
W
W21
4
0
2
1
2
j4
1
4
1
4 0
W42 8
W43
1
4
1
4
0
2
147
DECIMATION
IN
FREQUENCY FFT (DIF) FFT
or k=0,1..N-1,
Where = is the twiddle factor and N=2,4,8,16 can be expanded as,
X[K]=x(0)+x(1)k ++x(N-1)k(N-1)
Again if we split the above equation into,
X[K]=x(0)+x(1)k+x(-1)k(-1)+x()WN k + +x(N-1) k(N-1)
Then we can rewrite as a sum of the following two parts,
+
Which can be written as ,
+
=-1 , then we have ,
+
Now letting k=2m as an even number achieves,
X[2m]=+ ,
X[2m+1]=-,
a[n]=x[n]+x[n+N/2], for n=0,1,N/2 -1,
b[n]=x[n]-x[n+N/2], for n=0,1.N/2 -1
We get DFT{x[n]with N points}=
148
149
If x[n]=[1 2 3 4]. Find X[K] using DIF FFT.
x0 1
x2 2
x4 4
1
1
X0
10
2
1
-2
W40
-2
-2
W41`
-2j
W20
-2-j2
X2
X1
-2+j2 X3
W20
X[K]= [10, -2-j2, -2, -2+j2]
150
N=2
No.of stages =N
No.Ofcomplex multiplications in each butterfly=2
No.of Butterflies in each stage = N/2
number of complex multiplications in each stage=N.
no.of complex multiplications =NN
151

Digital Signal Processing 2014

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Digital Signal Processing 2014

Uploaded by

Copyright:

Available Formats

INDIA HAS BECOME A

PERMANENT MEMBER OF THE

Outcome Based Education

Components that contribute to

Open ended experiments

Components that contribute to

The components of course delivery that contribute

Digital Signal Processing

Personal computer revolution in

Advantages of DSP Technology

Advantages of DSP Technology

Dr. P.Meena, Assoc.Prof(EE) BMSCE

Digital Signal Processing

Dr. P.Meena, Assoc.Prof(EE) BMSCE

A TYPICAL DIGITAL SIGNAL

Dr. P.Meena, Assoc.Prof(EE) BMSCE

CO1: Ability to apply the knowledge of

Dr. P.Meena, Assoc.Prof(EE) BMSCE

Dr. P.Meena, Assoc.Prof(EE) BMSCE

Outcomes of this Course:

Design Analog And Digital Filters.

Dr. P.Meena, Assoc.Prof(EE) BMSCE

Dr. P.Meena, Assoc.Prof(EE) BMSCE

Dr. P.Meena, Assoc.Prof(EE) BMSCE

Dr. P.Meena, Assoc.Prof(EE) BMSCE

Dr. P.Meena, Assoc.Prof(EE) BMSCE

is the digital frequency in radians/sample

Therefore, given a 2 f , to get

Diagrammatic Representation of relation between analog

Sampling of continuous time signals

The Fourier transform of the resulting sequence

is the sum of an infinite number of

The Fourier transform of the continuous-time x a t

Dr. P.Meena, Assoc.Prof(EE) BMSCE

Dr. P.Meena, Assoc.Prof(EE) BMSCE

Will not overlap if0 T <

This inequality can be re arranged to give,

If we let,0 equal 2f0 where f0 is in Hertz, the above inequality

Therefore, if the sampling rate I/T is greater than 2 f 0 no overlap

Effect of Variation of Sampling frequency on the sampling of a sine wave of

Dr. P.Meena, Assoc.Prof(EE) BMSCE

Dr. P.Meena, Assoc.Prof(EE) BMSCE

What is the equation to

Dr. P.Meena, Assoc.Prof(EE) BMSCE

Extract from cnx.org

Dr. P.Meena, Assoc.Prof(EE) BMSCE

The two signals shown though

Therefore we find that a

Is the frequency response of the system

Frequency spectrum of a 100Hz sine wave Frequency spectrum of a 100Hz

Alias during under sampling

Dr. P.Meena, Assoc.Prof(EE) BMSCE

Cosine wave of frequency 100Hz sampled at 500Hz

Dr. P.Meena, Assoc.Prof(EE) BMSCE

Real &Imag parts of

Dr. P.Meena, Assoc.Prof(EE) BMSCE

Extract from cnx.org

Dr. P.Meena, Assoc.Prof(EE) BMSCE

Two dimensional plot of

Dr. P.Meena, Assoc.Prof(EE) BMSCE

Dr. P.Meena, Assoc.Prof(EE) BMSCE

THE DISCRETE TIME FOURIER TRANSFORM