Академический Документы
Профессиональный Документы
Культура Документы
Processing
3 – Discrete-Time Fourier Transform
• Definition of DTFT and Inverse DTFT
• Notation and conditions for existence
• DTFT properties and known transforms
• Frequency response of an LTI system
• Ideal frequency-selective filters
• An example of frequency response of a feasible LTI system:
the MA case
1
Definitions - 1
The discrete-time fourier transform (DTFT) of a sequence x(∙) is defined as
X e x k e
j
jn
X e j X e j 2m
n m 0 ,1,2 ,
X(ejω)
4 3 2 2 3 4
• The DTFT output is a complex-valued function
• The DTFT output is frequency-continuous even if the input is discrete-time
• The DTFT output is periodic with period 2π, because ω=π means high-
frequency in a DTFT the whole frequency axis is mapped in [-π, π]
2
Definitions - 2
The inverse discrete-time fourier transform (IDTFT) of a function X(ejω)
is defined as
x n
1
X e j e jn d
2
3
Is IDTFT the inverse of DTFT ?
n If n = m e j( nm) d 2
X (e j ) x ( n ) e jn
n
else
e j( nm ) d
1 1
j jn
x ( n) X ( e ) e d e j( n m )
dj(n m)
2
j (n m) The only
1 m 1 element
2 m
jm jn
x ( m ) e e d e j( nm) different
j (n m) from zero
1 m
2 m
x(m) e jm e jn d
1
j (n m)
e j( nm) e j( nm) is for n = m,
i.e. x(n), as
expected
1 m
x(m) e j( nm) d
1
2 j sin (n m)
2 m j (n m)
2 sin (n m)
0
(n m)
4
Notations
X (e j )
j
j
x(n)
X (e )
F X I (e )
| X (e j ) |
X ( e j )
X R (e j )
Analysis
n
DTFT
j
X (e ) x ( n )e
n
jn
= X (e j ) F [ x(n)]
Synthesis
1
j
IDTFT x(n) X ( e j
) e jn
d = x ( n) F -1
[ X (e )]
2
5
A sufficient condition for existence
Theorem: if a sequence is absolutely summable, then the DTFT exists and
it is a continuous function of ω.
| x(n) |
n
| X (e j ) | for all
| X (e j ) | x (
n
n ) e jn
| x
n
( n ) e jn
|
| x
n
( n ) || e jn
|
| x ( n) |
n
6
A counterexample of existence
X e j
-2 2
sinc n
c c
c 2k F - 1 n0
X e j
1
x n
1 c jn
2 c
n
e d
0 c 2k c n0
• For signals with a finite energy (i.e. square summable ) the DTFT exists
7
DTFT properties - 1
1. Linearity: ax(n) by(n)
F
aX (e j ) bY (e j )
Proof:
[ax(n) by(n)]e
n
jn
a x ( n)e
n 1
jn
b y(n)e jn aX (e j ) bY (e j )
n 1
8
DTFT properties - 2
4. Time reversal: x(n)
F
X (e j )
Proof:
F x n x n e jn
x n e j n X e j
n n
d
5. Differentiantion in frequency: nx(n) j
F
X (e j )
d
Proof:
de jn
dX e j
F nx n nxne x n
x n e
jn 1 d jn
j j
n
j n d d n d
6. Convolution theorem: y ( n) x (
k
k )h ( n k )
F
Y ( e j
) X ( e j
) H ( e j
)
Proof:
jn
F y n
x k hn k e
x k e jk
hn k e j n k X e j H e j
n k k n
9
DTFT properties - 3
1
7. Windowing theorem: y(n) x(n) w(n) Y (e ) X (e j )W (e j ( ) )d
F j
2
Proof:
wn xn e
Y e j jn
1
2
wn
X e j
e jn d e jn
1
2
X e j
wn e j n
d
n n
n
1
8. Parseval’s theorem: x(n) y * (n) X (e )Y (e )d
j * j
n 2
Proof: It results immediately from the windowing theorem, assuming that
• w(n)=y*(n)
• ω=0
9. Parseval’s theorem 1
(preservation of energy)
n
| x ( n) | 2
2
| X ( e j 2
) | d
10
Symmetry
Any function (or sequence) can be expressed as the sum of a conjugate-
symmetric one and a conjugate-antisymmetric one, i.e.,
X e (e j ) 12 [ X (e j ) X * (e j )] X o (e j ) 12 [ X (e j ) X * (e j )]
11
Symmetry of real-valued sequences
j
x(n)
X (e )
F j
x * (n)
X (e
F *
)
magnitude Properties
1. Real part is even X R (e j ) X R (e j )
2. Imag. part is odd X I (e j ) X I (e j )
phase j j
3. Magnitude is even | X I (e ) || X I (e ) |
4. Phase is odd X (e j ) X (e j )
12
Discrete-time Fourier transform pairs
Sequence x(n)
F
X (e j ) DTFT
(n) 1
(n nd ) e jnd
1
a nu(n) (| a | 1)
1 ae j
2k
1
u (n) j
1 e k
1
(n 1)a u(n)
n
(1 ae j ) 2
r n sin p (n 1) 1
u (n) (| r | 1)
sin p 1 2r cos p e j r 2e 2 j
e j0n 2(
k
0 2k)
cos(0 n ) [e j( 0 2k ) e j( 0 2k )]
k
13
Frequency response of an LTI system
The frequency transform of an LTI system is the DTFT of its impulse
response
H (e j ) h (
k
k ) e jk
j
H (e )
H (e j ) H R (e j ) jH (e j )
j j H ( e j )
H (e ) | H (e ) | e
Phase response
Magnitude response
14
Complex exponential input sequences
e j0n H (e j )
H e j0 e jn0
eigenvalue
eigenfunction
A cos 0n H (e ) j
A H e j0 cos 0n Arg H e j0
c c
| H (e j ) |
1
Highpass Filter
c c
| H (e j ) |
1
Bandpass Filter
b a a b
None of the ideal filters listed above is feasible in practice: all of them
refer to noncausal systems
16
Example: ideal lowpass filter
H (e j )
c c
x(n)
F
X (e j ) The ideal lowpass filter is noncausal
0.6
sin c n The ideal lowpass filter
h( n) n 0,1,2,
0.4 n can be approximated
using a window.
0.2
-0.2
-60 -40 -20 0 20 40 60
17
Approximated ideal lowpass filter
2
M=3
1
-1
-4 -3 -2 -1 0 1 2 3 4
2
sin c n jn
M=5
M
H (e )
j 1
e
n M n 0
-1
-4 -3 -2 -1 0 1 2 3 4
2
M=19
1
-1
-4 -3 -2 -1 0 1 2 3 4
18
An example of real filter - 1
The Moving Average
1 k M
y ( n)
M 1 k 0
x( n k )
1 M jk 1 1 e j( M 1)
M 1 k 0
e
M 1 1 e j
1 M
h ( n)
M 1 k 0
(n k )
1 e j( M 1) / 2 (e j( M 1) / 2 e j( M 1) / 2 )
j / 2 j / 2 j / 2
M 1 e (e e )
1 jM / 2 (e j( M 1) / 2 e j( M 1) / 2 )
e j / 2 j / 2
M 1 (e e )
h(n)
1 jM / 2 sin[( M 1) / 2]
0 0 M e
M 1 sin( / 2)
19
An example of real filter - 2
• If M increases, the filter bandwidth
1 jM / 2 sin[( M 1) / 2]
H (e j ) e (i.e. the mainlobe width) decreases
M 1 sin( / 2) by 1/(M+1)
0.5
Phase 0
Response -4 -3 -2 -1 0 1 2 3 4
-0.5
-1
20