fourier transform of the shah function
DESCRIPTION
Fourier Transform of the Shah Function. The Sampling Theorem. Discrete Fourier Transform. Insight of Discrete Fourier Transform. Formula of Discrete Fourier Transform. Zero-Padding of DFT. Circular Convolution in the Discrete Case. Convolution Theorem in the Discrete Case. - PowerPoint PPT PresentationTRANSCRIPT
1
Fourier Transform of the Shah Function
j
j
wji
j
wti
wti
jj
j
jw
edtejt
dtejtjtFT
jt
2cos
)(
)()(
have We
.)(
be todefined isfunction shah The
22
2
2
12sin2
121
2cos212cos and
,...,2,1,0at
2cos
and 0
2cos
e,Furthermor
,...2,1,0at approaches aluefunction v that thefind willwe
,2cos examine weIf
1
2/12/1
2
1
2
11
2
1
2
1
2
2
j
jj
jj
j
jwj
dwjwdwjw
wdw
jwd
dw
jwd
w
jw
3
domain.frequency in thefunction shah a is 2cos
rem,power theo by the ,Therefore
j
jw
4
)2(2cos)()(
)sin(cos)()(
)()(
)2
1()()
2(
).2
1()()
2(
e,Furthermor
kkk
kk
k
wi
k
jjj
jjj
kwkkwkw
wiwkwkw
kwekw
jtFTjtFTj
tFT
jtjtj
t
5
The Sampling Theorem
j
j
j
jj
jj
jwW
dxjxxwW
dxjxxwW
jwwWj
ttfFT
wtfFTwW
jwj
tFT
)(
)()(
)()(
)()()()(
have weThen,
.for 0)()( that Assume
.)()( Given that
6
).()()()(
with)(t reconstruc accurately
way tono is e then ther,2 if However,
.)(t reconstruc completelycan we
,integer any for )( have weas long as is,That
).()()()(
withcompletely )(construct can then we
,2 if Therefore,
jt
jf
jttf
tf
tf
jj
f
jt
jf
jttf
wW
jj
jj
7
domain. ed transformin the numbers real
of series aby described completely
becan function periodicalany cases, allIn
8
Discrete Fourier Transform
jn
jj
jj
n
jnjnnn
n
njws
njwsjws
n
jws
wWwW
wW
nsss
sssssss
)1
(~....)1
(~)(~
)(~ have We
.)(~
)1(~
with
)(~
function periodical a of [0,1]in samples
spacedevenly theare ~,,~,~ that imagecan We
.~~ with ,~,~,~,,~,~,
numbers real of sequence periodical aGiven
110
110
1110
9
j
ntn
i
n
j
tn
i
j
jn
jj
jj
jtes
jtesjts
n
njwFTs
njwFTsjwFTs
n
jwsFT
)(~...
)(~)(~
)1
(~...
)1
(~)(~
)(~ y,Accordingl
)1(2
1
2
10
11
11
10
1
10
...)(~))1((~...
)2(~)1(~)(~...
...)(~))1((~...
)2(~)1(~)(~...
)(~...
)(~)(~
1
0
21
0
)1(2
1
0
221
0
21
0
1
0
21
0
)1(2
1
0
221
0
21
0
)1(2
1
2
10
ntesntes
testests
ntesntes
testests
jtes
jtesjts
n
h
hnn
i
h
n
h
hnn
i
h
n
h
hn
i
h
n
h
hn
i
h
n
hh
n
h
hnn
i
h
n
h
hnn
i
h
n
h
hn
i
h
n
h
hn
i
h
n
hh
j
jnn
i
n
j
jn
i
j
11
Insight of Discrete Fourier Transform
.)()()(
)()()(
)()()(
y,Accordingl
.)()()()(
have we theorem,sampling by the
,2/1for 0)( and 0 and for 0)(with
)( TransformFourier its and )(function aGiven
111
1
jk
jk
jk
kj
njtkttfn
n
jwFTkwFTwWFT
n
jwkwwWFT
kwwWjttfFT
wwWtnttf
wWtf
12
Formula of Discrete Fourier Transform
.,,, of ansformFourier tr discrete the
called is ~,,~,~ and
~
have wee,Furthermor
.~,,~,~ of anformFourier tr discrete inverse
thecalled is ,,,,y Accordingl
.1,...,2,1 ,~1Let
110
110
21
0
110
110
21
0
n
n
khn
in
kkh
n
n
hkn
in
hhk
sss
sss
ess
sss
sss
nkesn
s
15
Zero-Padding of DFT
.))(()()()(
)()()(
)()()(
y,Accordingl
.)()()()(
have we theorem,sampling by the
,2/1for 0)( and 0 and for 0)(with
)( TransformFourier its and )(function aGiven
111
1
jk
jk
jk
kj
jmntkttfmn
mn
jwFTkwFTwWFT
mn
jwkwwWFT
kwwWjttfFT
wwWtnttf
wWtf
17
Circular Convolutionin the Discrete Case
.
:follows as defined
length of sequence periodical a is
sequences two theseofn convolutiocircular The
.length of sequences periodical twoare
},...,,{ and },...,,{ that Assume
1
0
)2()1(
)2(1
)2(1
)2(0
)1(1
)1(1
)1(0
n
jjkjk
nn
sss
n
n
ssssss
18
Convolution Theoremin the Discrete Case
)2()1(1
0
)(21
0
)2(2
)1(
1
0
21
0
)2()1(1
0
2
1
0
2)2()2(
1
0
2)1()1(
1
0
)2()1(
)2(1
)2(1
)2(0
)1(1
)1(1
)1(0
~~
~
~ and ~
. and
length of sequences periodical twoare
},...,,{ and },...,,{ that Assume
mm
n
j
jkmn
in
kjk
mjn
i
j
n
k
mkn
in
jjkj
n
k
mkn
i
km
n
h
jhn
i
hj
n
h
jhn
i
hj
n
jjkjk
nn
sseses
essess
essess
sss
n
ssssss
19
Implementation of the Linear Convolutionin the Discrete Case
.2for ,0 and
10for , )3(
.2for ,0 and
;10for , )2(
;1 (1)
where,
by defined is sequences two theseofn convolutiolinear The
}.,...,,{ and },...,,{
:sequences twoofn convolutio
linear thecompute want to that weAssume
)2(
)2()2(
)1(
)1()1(
1
0
)2()1(
)2(1
)2(1
)2(0
)1(1
)1(1
)1(0
nmjns
njss
nmjms
mjss
nmh
sss
ssssss
j
jj
j
jj
h
jjkjk
nm
20
Implementation of the Linear Convolutionin the Discrete Case
.~ and ~
where,~~~n theorem,convolutio the toAccording
1
0
2)2()2(
1
0
2)1()1(
)2()1(
h
j
jqh
i
jq
h
j
jqh
i
jq
qqq
essess
sss
21
Multi-Dimensional Discrete Fourier Transform
. of ansformfourier tr discrete the
called is ~Then,
.~
Let
. numbers real ofarray an Given
21
0
21
0
jk
qr
rkn
in
j
qjn
in
kjkrs
jk
s
s
eess
s