Escolar Documentos
Profissional Documentos
Cultura Documentos
Industry Visits
Course
Lectures/Demonstrations/
Videos/Animations /power
point presentations/hand outs
Academic
abilities
Student
Activities
Transferable skills
3
Technical
Symposia
Attributes
Dr.P.Meena,Assoc.Prof.,EEE
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
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
For
Different
System
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
or (2 f * T s )
s
Dr. P.Meena, Assoc.Prof(EE) BMSCE
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
21
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
Dr. P.Meena, Assoc.Prof(EE) BMSCE
22
Xe
Thus X e
1
1
Xa j 2 r
T r T
ana log
T
23
24
j
From the figure it is easy to see that the triangles
X of
0
T
2f 0
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
Dr. P.Meena, Assoc.Prof(EE) BMSCE
26
27
28
Periodic Signals
,
2 N
2929
APeriodic Signals
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
31
32
He
H
H
e
e
jn
h (n ) e
jn
h (n ) e
j( 2 )
He
jn
jn
Linear Shift
Invariant
System
jn
h (n ) e
j 2 n
jn j 2 n
h (n ) e
j n
Dr. P.Meena, Assoc.Prof(EE) BMSCE
33
Under Sampling
Dr. P.Meena, Assoc.Prof(EE) BMSCE
34
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
x1(t)
x1[n]
10
15
0
-1
10
15
Effect of aliasing
3636
jt
3737
Representation of a Complex
Exponential Function
3838
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
sequence: j
jn
X e x (n ) e
, dig.freq
jn
j( 2 )
h (n ) e
h (n ) e
j 2 n
jn j 2 n
h (n ) e
jn
1
j jn
x n X e e d
2
Dr. P.Meena, Assoc.Prof(EE) BMSCE
42
43
- jn
[
n
]
e 1.
X e j x n e jn 1. e j 2 3 e- j 4 e-2j 5 e-3j
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
x ( n ) x n rN
r
x ( n mod ulo N)
x n
N
Dr. P.Meena, Assoc.Prof(EE) BMSCE
48
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
Dr. P.Meena, Assoc.Prof(EE) BMSCE
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
X (k ) n 0 x (n) e j N
N 1
W
X
nk
2
N
N 1
n 0
x ( n )W
kn
N
where
j 2 / N
51
51
X (k ) n 0
N 1
x ( n)
WN
W
e
N
nk
2
N
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
5353
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
=[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
5959
60
61
62
63
64
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
6565
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
Dr. P.Meena, Assoc.Prof(EE) BMSCE
6666
Assignment
3.Find
x[n]=(1 2 3 4 4 3 2 1 )
6767
68
69
70
71
72
73
P.Meena,Asst.Prof(EE)BMSCE
Dr. P.Meena, Assoc.Prof(EE) BMSCE
7474
7575
7676
7777
MATLAB PROGRAM
n=input('input
7878
Let
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
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
Dr. P.Meena, Assoc.Prof(EE) BMSCE
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,
mod N
x[n] [1 2 3 4 5 6 7 8]
(n-2)
[7 8 1 2 3 4 5 6]
Dr. P.Meena, Assoc.Prof(EE) BMSCE
82
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
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
If DFT[x[n]]=X[K]
then DFT
x[n-m]
mod4
mod N
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
Dr. P.Meena, Assoc.Prof(EE) BMSCE
85
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
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,
87
88
DFT W N x[n ]
mn
X (K m)
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].
Dr. P.Meena, Assoc.Prof(EE) BMSCE
8989
Consider
What
x[n]=[ 1 2 3 4 5 6 7 8 9]
is
x[n-4]
mod4
?????????
90
Circular Convolution
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
Dr. P.Meena, Assoc.Prof(EE) BMSCE
91
Circular Convolution
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
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]
Dr. P.Meena, Assoc.Prof(EE) BMSCE
94
95
96
97
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]).
Dr. P.Meena, Assoc.Prof(EE) BMSCE
99
100
x
x
n x n x n
ev
mod N
2
1
n x n x n
odd
mod N
2
x[n]=[1 2 2 0]
101
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
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
E x[n]
x
n 0
The quantity
N 1
X [K ]
k 0
X [K ]
N
duration sequences.Similarly , for periodic sequences, the quantity
:
X (K )
N
107
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
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
2)x(4) 3)
X (K )
k=0
4)
k=0
X (K )
Ans: 1)20
2)-8
3)8
4) 864
109
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
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
P.Meena,
Dr. P.Meena,
Asst.Prof(EE)
Assoc.Prof(EE)
BMSCE
BMSCE
113
113
DFT of DTMF
114
115
116
N2 ,
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
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.
Dr. P.Meena, Assoc.Prof(EE) BMSCE
120
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
1200
0321
----------
1032
-----------
---------
1
-----------
1200
1200
|1 2 0 0
1200
4365
----------10
-----------
1200
1200
5436 6543
----------- ----------13
16
----------- -----------
122
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]
Dr. P.Meena, Assoc.Prof(EE) BMSCE
123
h[ n] [1, 2]
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
------------- -----------
6
4
13
16
12
------------------------------------------------1
10
13
16
12
124
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]
Dr. P.Meena, Assoc.Prof(EE) BMSCE
125
energy content.
126
127
128
129
X ( z)
to Z- transform:
n
x
[
n
]
z
n
N 1
X ( K ) x[n]WNkn
n 0
X(z) x[n]z n
n 0
z e j , X ( K ) X ( z ) z e j 2Nk W k
N
130
0. z
0.5 0.5 z
X (k ) X ( z ) z W k
N
1.2
4
2.2
4
0.5 0.5 0
0.5 0.5 1.0
131
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
Dr. P.Meena, Assoc.Prof(EE) BMSCE
132
133
DECIMATION
IN
TIME
FFT
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
( N / 2 ) 1
x[2m 1]W
m 0
mk
N
2
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
138
139
x0
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 ]
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
Dr. P.Meena, Assoc.Prof(EE) BMSCE
143
[5 - 1 - j2 1 - 1 j2 ]
Twiddle Factors are negative powers of
WN
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
Dr. P.Meena, Assoc.Prof(EE) BMSCE
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
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}=
Dr. P.Meena, Assoc.Prof(EE) BMSCE
148
149
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
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