0% found this document useful (0 votes)
80 views15 pagesExamples On DFT
The scanned pdf is about Examples of DFT from Rameshbabu
Uploaded by
coep05Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
80 views15 pagesExamples On DFT
The scanned pdf is about Examples of DFT from Rameshbabu
Uploaded by
coep05Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
/ 15
[y(0) + v1) + 92) + ¥(3)]
[L+0+1+0]
So ele ale
5.
il
i ,
ul) = Fp LLY (weir?
k=0
(1) = i ro +Y¥(l)ei"/? + ¥(2)ei" + Y(a)e"/)|
[1+0+ cos + jsinm +0]
eee
= qii+0-1+0)=0
V2) =F VO FYE + YQ + ¥ Be]
= an +0 + cos 2m + jsin 2m + 0]
= qii+o+1+09) =0.5
18) =4 [PO +Y Me™? +¥Qe™ +¥Be""]
= jl + 0+ cosar + jsin 3x +0)
=4n+0+(-y+0=0
y(n) = {0.5,0,0.5,0}
Example 3,2 Find the DFT of a sequence Oo
a(n)=1 ford> a(nje P/N &=0,1,...,N—1
n=0 3.14 Digital Signal Processing
x(n)
: L=3
os
Seas 4 a
@
xp(n)
Ppt eecae ee to eo 8 2s
(b)
Fig. 3.5 (a) The sequence given in example 3.2.(b) Periodic extension of the se-
quence for N = 4.
'
From Fig. 3.5b we find
-2(0)=1;2(0)=1; — 2(2) = 1,2(3)=0 :
For N =4 '
X(k) = Soa(nje 4? “k= 0,1,2,3
n=0
Fork =0
3 oe
X(0) = a(n) = 2(0) +22) +2(2) + 2(3)
‘ n=0
=3
Therefore, |X (0)| = 3, ZX (0) = 0
Fork =1
3 f,
| X(1) = So (mje?
no
= 2(0) + w(1)e™#"/? 4 2(2)e797 4 9(3)@7930/2
7
i = 140085 — jsin} + cosm — jsinn +0
\ =1-j-1e-j
Therefore,’
IX(Q)|=1,. 2x1) = The Discréte Fourier Transform 3.15
pork = 3
3
X(2) = > a(m)ensen
n=0"
= 2(0) + a(1eI" 4 (a)end2n (3)e-43"
=1+cosr ~ Jsint + cos2n ~ j sin da +0
Sloiffa 1
Therefore,
IX) =1, 2x(2) <0
Fork =3
3
X(3) = SY a(njenaden/2
no
= 2(0) + 2(1)e~29"/? + o(2)0799" 4 2(3)e-99H/2
30 3 f
= 1408 ~jsin + cos3i ~ jsin 3a +0
=1l+y-1s
Therefore |X(3)|=1, ZX(3) =
IX()l = 3,11, 3
ZX(k) = {o.-F.0, 3}
The plot of |X (k) and 2X (k) for N = 4 is shown in Fig. 3.6.
Fig. 3.6 Frequency response of a(n) forN=4
For N = 8 the periodic extension of «(n) shown in Fig. 3.7 can be obttined by
Adding five zeros (-.: N — L zeros). 4
2(0) = 2(1) = #(2)=1 and a(n)=0 for 3 The Discrete Fourier Transform 3.17
Fork =3
7
X(3) = Yo a(njens3rna
n=0
= 2(0) + a(1)e~43n/4 i (2)e-J94/2
Sn an an
= 14,008 8% _ jsin 3% 4. 95 3% — jgin OF
a join 4 = +008 2 jein 2
= 1-0.707 — 50.707 +5
= 0.293 + 70.293
Therefore, |X(3)|= 0.414, ZX(3) = 5.
Fork=4
7
Sane
n=0
= 2(0) +a(1)e™ + 2(2)e9"
= 1+ cosm ~ jsin x +. cos 2n — j sin 2m
=1-141=1
,. 2X(4) =
X(4)
Therefore, |X (4)| =
For
» 7
X(5) = So a(n)esnr/4
n=0 |
1 = (0) + a(1)e95"/4 + (2) 55"/2
br. ot Sm Sr
= 14 cosF — jsinT +008 — jsin
= 1-0.707 + 50.707 —j
= 0.293 — j0.293
|X(5)| = 0.414, . £X(5) = a5
Fork =6
ul ‘
X(6) =) a(n)en"/?
n=0
= 2(0) + 2(1)e9"/? + o(2)e99"
3a 3a
=1+ cos ae jsin = 2
=14+j-l=j
IX@=1, 2X06) =F
+ cos 3m — j sin 3x 3.18 Digital Signal Processing
Fork =7
7 a
x()= ane” /4
n=0, _ jt [2
“s/he
=1+e it Tr
Un TH isin
= 1+ e08 %F — jsin'g +008 aja 2
= 140.707 + j0.707 +4
= 1.707 + j1.707
©
|x()| = 2.414, 2X() =]
|X(k)| = (8,2-414, 1, 0.414, 1, 0.414, 1, 2.414}
non nam a
Z2X(k) = {0-4 34
‘The plot of |X(k)] and ZX (k) vs. k for N = 8 is shown in Fig. 3.8.
ix)
3
Fig. 3.8 Frequency response of x(n) for N =8
Comments: Based on the Fig. 3.6 and Fig. 3.8 we can observe the following.
From Fig. 3.6 we can observe that, with N = 4, it is difficult to extrapolate
the entire frequency Spectrum. For low values of N, the spacing between succes-
ne samples is high, which results in poor resolution. On the other hand when
= 8, from Fig. 3.8 we can observe that it is possible ;
: Possible to extrapolate the frequency
of spectrum. That is zero padding ives 'a high densi i
" It
displayed version for plotting, ee
Example 3.3 Determine the 8-point DFT of
2(n) = {1,1,1,1,1,1,0,0} ous Saolnse (AU EEE'07) The Discrete Fourier Transform 3.19
solution
N-1
We know X(k) =} a(n)eP7"4/N = 9,1,...,N—1
n=O
For N =8
z
X(k) = SO alnje I =0,1...,7
n=0
Fork =0
7
X(0) = So a(n)
n=0
(0) = 2(0) + x(1) + 2(2) + (3) + 2(4) + 2(5) + 2(6) + 2(7)
=14+14+14+1414+140+0=6
Fork =1
T
X(1) =o a(n)eir"/4
n=0
= 2(0) + 2(1)e"/4. + (2)e~F7/? + @(B)e-I8"/4 +. (det
+ 2(5)e7H"/4 + 2(6)e~F9"/? + a(7)e~57A/A
= 1+0.707 — 50.707 — j — 0.707 — 50.707 — 1 — 0,707 + j0.707
= —0.707 — j1.707
Fork = 2
1
X(2) = So a(nje"/?
- n=0
= 2(0) + a(1)eI"/? + a(2)e-I + w(8)e~I9"/2 +. (4-92
+ a(5)e~99"/? + 2(6)e~I9" + 2(7)e~378/2
=1-j-1+j+1-j
=1-j 3.20 Digital Signal Processing
Fork =3
X(3)= Seinen
=
= (0) + 2( e294 + a(2)e 3? + a Be + 2(d)erson
4 2(5)eH98/4 4 a(6)eH + 2
= 1—0.707 — 70.707 + j + 0.707 — j0.707 — 1+ 0.707 + 30.707
q)e~d2in/4
= 0.707 + j0.293
Fork =4
z
X(4) = So a(n)je™
n=
= 2(0) + 2(1)e™* +.2(2)e79?* + 2(3)e93" + 2(4)e-I47
+ 2(5)eF" 4 0(6)e-9" + 2(7)e-97™
=1-1+1-1+4+1-1=0 :
=0
X(5) = So a(njesrn/4
n=0
= 2(0) + a(1)eF"/4 + 2(2)e-F5"/2 4 9(3)e~H15R/4 a(4)e9"
+ (Be POA 4 a(6)eHSH/2 4 9(7)—-I85n/4
— 0.707 + 50.707 — J +0.707 + 50.707
= 0.707 ~ 50.293
+ 1+ 0.707 — 50.707
Fork =6
1
X(6) = 3 2(n)e-Hn/2
n=0
=2(0 ~i8m,
2(0) + 2(1)e ; (ey 2(2)e~3m 2(3)e"39"/2 ade"
+ 2(5)eF15m/2 2(6)e-3%" a{r)e-itie/a
~145-1-j4+145
=14+j ‘The Discrete Fourier Transform 3.21
X(T) = Salmons
n=0
= 2(0) + x(1)eI7/4 4 (2)e“I7#/2 4. (3) FAM/4 4 (4)eI™
+ x(5)e7 4350/4 + 2(6)e79214/2 4 x(T)e~S49n/4
= 1+ 0.707 + 50.707 + j — 0.707 + j0.707 — 1 — 0.707 — j0.707
= ~0.707 + j1.707
X(k) = {6, —0.707 — j1.707, 1 — j,0.707 + 70.293, 0, 0.707 — 0.293,
1+ j,-0.707 + 51.707}
Example 3.4 Find IDFT of the sequence IT AU Dec’03
X(k) = {5,0,1=J,0,1,0,1 + 7,0}
Solution
p82
We have a(n) = 5 X(kei**/N 1 =0,1,.
=o
ForN =8
1 N=
=F xe en n=0,1,...,7
i=
Forn =0
a :
1 5 e
«o=3[y xia] = gb +O4+1—-G+041404145+0 =1
a(t)= 3 [pxwems =} +0-DH FIC) HAHN
k=0
= jl6] = 0.75
2(2) = Beene D410) +04
=F =9 = 3.22 Digital Signal Processing
ot 1 [Exwem =
k=0
[p+ (1-s)(-A) + U-1) +0 +/Q)]
1
8
i
19] = 0.25
3
1
x¢é en =}+0-Da) +104 0+)
=)
=1
26-4 )=3 [x0 yom = 'o+-a+WCD+0+ICa
k=0
= gle =0.75
[exwenn] = 30+ +s (-1) +10) +1 +9)(-D)]
a
= fl] =05
[Exmer] =tpea--D+CD +O +00)
k=0
=jel= 0.25
a(n) = {1,0.75, 0.5, 0.25, 1, 0.75, 0.5, 0,25}
Practice Problem 3.1 (i) Compute 4-point DFT of the sequence
a(n) = {0, 2, 4,6} Ans: 12,-4+ j4,-4,-4-j4
(i) Compute 8-point DFT of the sequence
a(n) = {2,2?, 28, 24}
Ans: {30, -6.48 — 22, —6 + j12, 10.48 = 46:14, -10, 10.48 + j6.4,-6-
512, -6.48 + 22}
3.5 Relationship of The DFT to Other Transforms
3.5.1 Relationship to The Fourier Transform
The Fourier transform X (e) of a finite duration sequence «-(n) having length N is
given by
oat yet
X(e*) = a(njesen 3.24)
n=0 ‘The Discrete Fourier Transform 3.23
X(e) is a continuous function of
w.
ere ;
wherpe discrete Fourier transform of z-(n) is given by
N-1
X(k) = SO a(nyje Hk = 0,1,9,...,N-1 (3.25)
Ferd i
comparing Ea. (3.24) and Eq, (3.25), we find that the DFT of «(n) is a sampled
‘ersion of the Fourier transform of the sequence and is given by
XU) = XO) ay k=0,1,...,N-1 (3.26)
452. Relationship to The z-Transform
Letus consider a sequence «(n) of finite duration N with z-transform
N-1
X() = Yo a(n)” 27)
n=0
We have
iS jankn/N
an) =H DY X (hei! 28)
=o
Substituting Eq. (3.28) in Eq. (3.27) we get
N-1 1 a3 , i N-1 N-1
xX@= >> [F YX WeN] am =H DT XH) Yee
k=0
n=0 k=0 n=0
aN S X(k)
T= eitak/N 7-1
(3.29)
Example 3.5 Find the z-transform of the sequence a(n) = u(n) — u(n — 8) and
sample it at 6 points on the unit circle using the relation
X(k) = X(2)|,cesee K=01,--55
Find the inverse DFT of X (ke) and compare it with x(n) and give your comments.
Solution
a(n) = u(n) — u(n- 8)
The signal 2(n) = {1,1,1,1,1,1,1,1}
X(@)aigetg ete ett tet
X(k) = X(z) ge k= 0,1,...5
lage Fe ne
=1 tee 4 petty eee 4 eT + eh
atk, goink 4 eo
=itnk
es
=242e%* +e 3.24 Dgital Signal Processing,
The inverse DFT of X(k) is
al(n) = {2,2,1,1, 1,15}
we can find that time domain aliasing occurs in the first
ing a
rea th sufficient number of points on the uni,
two points because X(z) is not sampled wil
circle.
Note: The length of the sequence L = 8. The number of samples taken on unit
circle to find X(k) is 6. Since N < L, time domain aliasing occurs. That is last
2 samples (L — N = 2) are added to first two samples due to under sampling
Example 3.6 Consider a finite duration sequence x(n), 0 aa(njeP**"/M Qk
