Professional Documents
Culture Documents
Transform
Continuous-Time Fourier
Transform
X a ( j) = xa (t )e jt dt
x a ( t ) X a ( j )
1
Continuous-Time Fourier
Transform
Continuous-Time Fourier
Transform
The quantity X a ( j) is called the
magnitude spectrum and the quantity a ()
is called the phase spectrum
Both spectrums are real functions of
In general, the CTFT X a ( j) exists if xa (t )
satisfies the Dirichlet conditions given on
the next slide
X a ( j ) = X a ( j ) e j a ( )
where
a () = arg{X a ( j)}
3
Continuous-Time Fourier
Transform
Continuous-Time Fourier
Transform
If the Dirichlet conditions are satisfied, then
Dirichlet Conditions
(a) The signal xa (t ) has a finite number of
discontinuities and a finite number of
maxima and minima in any finite interval
(b) The signal is absolutely integrable, i.e.,
jt
X a ( j)e d
xa (t ) dt <
E x = xa (t ) dt = xa (t ) x*a (t ) dt
E x = xa (t ) 1 X a* ( j)e jt d dt
2
1
x(t ) dt = 2 X a ( j) d
1
2
1
2
=
8
1
2
jt
dt d
X a* ( j) xa (t )e
X a* ( j) X a ( j)d
X a ( j) d
Ex =
10
Band-limited Continuous-Time
Signals
Band-limited Continuous-Time
Signals
11
Band-limited Continuous-Time
Signals
Band-limited Continuous-Time
Signals
13
14
Discrete-Time Fourier
Transform
Discrete-Time Fourier
Transform
X ( e j ) =
X (e j ) = x[n]e j n
n =
n =
j
X (e ) is
X ( e j )
15
In general,
is a complex function
of the real variable and can be written as
X (e j ) = X re (e j ) + j X im (e j )
Copyright 2005, S. K. Mitra
16
In general,
a complex function
of the real variable and can be written as
X (e j ) = X re (e j ) + j X im (e j )
Copyright 2005, S. K. Mitra
Discrete-Time Fourier
Transform
Discrete-Time Fourier
Transform
x[n]e j n
Discrete-Time Fourier
Transform
Discrete-Time Fourier
Transform
= X (e j ) e j()
for any integer k
20
Discrete-Time Fourier
Transform
Discrete-Time Fourier
Transform
21
22
Discrete-Time Fourier
Transform
Discrete-Time Fourier
Transform
Its DTFT is given by
X (e j ) = n[n]e jn = ne jn
n =
j n
(e j ) = [n]e jn = [0] = 1
n =
= ( e
x[n] = n[ n],
23
n =0
as e j = < 1
<1
n =0
= 1 j
1 e
24
Discrete-Time Fourier
Transform
Discrete-Time Fourier
Transform
The DTFT X (e j ) of a sequence x[n] is a
continuous function of
It is also a periodic function of with a
period 2:
Phase in radians
Magnitude
0.4
1.5
0.2
X (e j ( o + 2 k ) ) = x[ n]e j ( o + 2 k ) n
0
-0.2
-0.4
0.5
-3
-2
-1
0
/
-3
-2
-1
X ( e j ) = X ( e j )
25
n =
0
/
( ) = ( )
Copyright 2005, S. K. Mitra
= x[n]e
n =
n =
Proof:
x[ n] =
Discrete-Time Fourier
Transform
29
Now
sin ( n l) 1, n = l
=
( n l )
0, n l
= [n l]
Hence
x[l]
1 j( nl )
sin (n l)
x[l]
d = x[l]
e
2
( n l )
l =
l
=
l =
1
jl j n
e d
x[l]e
2 l =
28
Discrete-Time Fourier
Transform
n =
= x[n]e jon = X (e jo )
Discrete-Time Fourier
Transform
X (e j ) = x[n]e j n
represents the Fourier series representation
of the periodic function
As a result, the Fourier coefficients x[n] can
be computed from X (e j ) using the Fourier
integral
1
j jn
x[ n] =
X (e )e d
2
27
26
Discrete-Time Fourier
Transform
Therefore
jo n j 2 k n
30
sin (n l)
= x[l][ n l] = x[ n]
(n l)
l =
Discrete-Time Fourier
Transform
Discrete-Time Fourier
Transform
Then for uniform convergence of X (e j ) ,
X (e ) = x[n]e
lim X (e j ) X K (e j ) = 0
j n
n =
x[n] <
n =
n= K
31
32
Discrete-Time Fourier
Transform
Discrete-Time Fourier
Transform
Example - The sequence x[n] = n[ n] for
< 1 is absolutely summable as
1
n
n
<
[n] = =
1
n =
n =0
Then
n =
n =
33
34
Discrete-Time Fourier
Transform
Since
1 / n, n 1
x[n] =
0, n 0
has a finite energy equal to
1 2 2
E x = =
6
n =1 n
But, x[n] is not absolutely summable
Discrete-Time Fourier
Transform
x[n] x[n] ,
n =
n =
2
36
Discrete-Time Fourier
Transform
Discrete-Time Fourier
Transform
X ( e j ) X K ( e j )
must approach zero at each value of as K
goes to
In such a case, the absolute value of the
error X (e j ) X K (e j ) may not go to
zero as K goes to and the DTFT is no
longer bounded
lim X (e j ) X K (e j ) d = 0
where
X K (e j ) = x[n] e j n
n= K
37
38
Discrete-Time Fourier
Transform
1 e jc n e jc n sin c n
=
, < n<
n
2 jn
jn
The energy of hLP [n] is given by c /
hLP [n] is a finite-energy sequence,
39
Discrete-Time Fourier
Transform
Discrete-Time Fourier
Transform
Discrete-Time Fourier
Transform
As a result
K
hLP [n] e
n= K
j n
sin c n j n
e
n
n= K
K
Discrete-Time Fourier
Transform
1
0.8
0.8
0.6
0.4
0.2
0.4
0
0.2
0.4
0.6
0.8
0.2
0.8
0.8
0.6
0.4
0.6
0.8
0.6
0.4
0.2
0.2
0
0
0.4
/
N = 40
Amplitude
Amplitude
/
N = 30
43
0.6
0.2
0
0
Discrete-Time Fourier
Transform
N = 20
Amplitude
Amplitude
N = 10
0.2
0.4
0.6
0.8
0.2
0.4
Copyright
0.62005, S.0.8K. Mitra1
44
Discrete-Time Fourier
Transform
Discrete-Time Fourier
Transform
As K goes to infinity, the condition
lim H LP (e j ) H LP , K (e j ) d = 0
46
Discrete-Time Fourier
Transform
Discrete-Time Fourier
Transform
47
p ( )
X (e j ) = 2( o + 2 k)
k =
0
2
2
48
Discrete-Time Fourier
Transform
Discrete-Time Fourier
Transform
The function
Thus
X (e j ) = 2( o + 2 k)
x[ n] =
k =
= ( o )e jn d = e jon
DTFT Properties
2( + 2 k)
k =
2( o + 2 k)
k =
1
+ ( + 2 k)
j
1 e
k =
1
[n], ( < 1)
1 e j Copyright 2005, S. K. Mitra
[n]
51
52
53
DTFT
[n] 1
e jon
1
jn
2( o + 2 k)e d
2 k =
54
Table 3.4:General
3.4:General Properties of
DTFT
55
10