Ch 5 The discrete-time Fourier transform

• 5.1 Representation of aperiodic signal: the discrete-time

Fourier transform (p.359)
¾5.1.1 Development of the discrete-time Fourier transform
"We saw that the Fourier series coefficients for a
continuous–time periodic square wave can be viewed as
samples of an envelope function.
„As the period of the square wave increases, these
samples become more and more finely spaced.
" x[n]=0, outside the range -N1≤n≤N2
„Fig. 5.1
1
2
„We can construct a periodic sequence x[n ] for which x[n]
is one period and period=N.
» N→ ∞, x[n ] = x[n ] for any finite value of n.

„ (3.94) and (3.95)

∑
1
x[n ] =
k =< N >
ak e jk (2π / N ) n
, ak =
N
∑
n =< N >
x[n ]e − jk (2π / N ) n

„Since x[n ] = x[n ] over a period that includes the interval

-N1≤n≤N2,

3
"Defining the function

„The coefficients ak are proportional to samples of X(ejω)

» where ω0=2π/N is the spacing of the samples in the

frequency domain.
„

"As N increase ω0 decreases, and N→ ∞

1
∫
jω jω n
x[n ] = x[n ] = X ( e )e dω
2π 2π
„ X(ejω) is seen to be periodic in ω with period 2π, and so
is ejωn. 4
 "Discrete-time Fourier transform pair
1
∫
jω jω n
Synthesis equation x[n ] = X ( e )e dω (5.8)
2π 2π
Analysis equation (5.9)

5
 „ Signals at frequencies near these values or any other
even multiple of π are slowly varying and there are all
appropriately thought of as low-frequency signals.
„ The high frequencies in discrete time are the values of
ω near odd multiples of π.
„Fig. 5.3

Ex. 5.1. Consider the signal x[n]=anu[n], where |a|<1. Find X(ejω)
∞ ∞
X ( e jω ) = ∑ a n

n =−∞
u[ n ]e − jω n
= ∑ e
a
n =0
n − jω n

1
=
1 − ae − jω
6
7
a>0

8
a<0

9
¾5.1.3 Convergence issues associated with the discrete-time
Fourier transform (p.366)
"Eq. (5.9) will converge either if x[n] is absoulutely
∞

∑ | x[n] | < ∞
n =−∞

or has finite energy

∞

∑ | x[n] |
n =−∞
2
<∞

"We approximate an aperiodic signal x[n] by

1 W
∫
jω jω n
xˆ[n ] = X ( e ) e dω
2π −W

10
 „ xˆ[n ] = x[n ] for W = π

„Ex. 5.4 x[n]=δ[n]ÖX(ejω)=1, (Fig. 5.7)

• 5.2 The Fourier transform for periodic signals (p.367)

¾Consider the signal x[n ] = e jω0n F
jω t
" In continuous-time case e 0 ↔ 2πδ (ω − ω 0 )
" In discrete-time case
F ∞
x[n ] = e jω0n ↔ 2π ∑ δ (ω − ω 0 − 2π l )
l =−∞

„To check the validity of this expression

∞
1 1
∫
2π 2π
X ( e jω
) e jω n
d ω = ∫ ∑
2π 2π l =−∞
2πδ (ω − ω 0 − 2π l )e jω n
dω
11
 » If the interval of integration chosen includes the
impulse located at ω0+2πr
1
2π ∫2π
jω jω n j ( ω 0 + 2π r ) n jω0n
X ( e ) e d ω = e = e

¾Now consider a periodic sequence x[n] with period N and with

the Fourier series representation
x[n ] = ∑
k =< N >
ak e jk (2π / N ) n

The Fourier transform is

∞
2π k
X ( e ) = 2π ∑ akδ (ω −
jω
)
k =−∞ N
"Choose the interval k=0,1,…, N-1
N −1
x[n ] = ∑ ak e jk (2π / N ) n
k =0
12
13
Ex. 5.5 Consider the periodic signal x[n]=cos(ω0n), with ω0=2π/5
"

"

"

14
• 5.3 Properties of the discrete-time Fourier transform

¾ Periodicity of the discrete-time Fourier transform

¾Linearity of the Fourier transform

"

¾Time shifting and frequency shifting

F
x[n − n0 ] ↔ e − jω n0 X ( e jω )
D F
e x[n ] ↔ X ( e j (ω −ω0 ) )
jω0n
15
Ex. 5.7 Hhp(ejω)=Hlp(ej(ω-π)) D hhp[n]=ejπnhlp[n]=(-1)nhlp[n]
"Fig. 5.12

¾Conjugation and conjugate symmetry

D
"If x[n] is real valued, its transform X(ejω) is conjugate
symmetric.

„ ,
„If x[n] is real and even, its Fourier transform is also real
and even.

16
17
¾Differencing and accumulation

" Consider the signal

„ y[n]-y[n-1]=x[n]

¾Time reversal
D

18
 " y[n]=x[-n]

„Substituting m=-n

¾Time expansion
"For continuous-time signals
"For discrete-time signals
„Define the signal

19
„Fig. 5.13

20
"

"
"Ex.

21
22
 ¾ Differentiation in frequency (p.380)

" D

¾Parseval’s relation

" D

„|X(ejω)|2: energy-density spectrum of the signal x[n]

• 5.4 The convolution property (p.382)

¾ y [ n ] = x[ n ] ∗ h[ n ] jω jω jω
D Y (e ) = X (e ) H (e )
23
¾Ex. 5.11 Consider an LTI system with impulse response
h[n]=δ[n-n0]
∞
" H ( e jω ) = ∑ δ [
n =−∞
n − n0 ]e − jω n
= e − jω n
0

jω − jω n jω
" Y (e ) = e 0 X (e )

¾Ex. 5.14 Consider the system shown in Fig. 5.18(a) with input
x[n] and output y[n]. The LTI system with frequency response
Hlp(ejω) are ideal lowpass filter with cutoff frequency π/4 and
unity gain in the passband.

24
" W1 ( e jω ) = X ( e j (ω −π ) )
„ (-1)n=ejπn
jω jω j (ω −π )
" 2
W ( e ) = H lp ( e ) X ( e )

" W3 ( e jω ) = W2 ( e j (ω −π ) ) = H lp ( e j (ω −π ) ) X ( e j (ω −2π ) )
= H lp ( e j (ω −π ) ) X ( e jω )

"
"

25
• Ex. The frequency response of an LTI system is H(ejω)=e-jω/4, -π<
ω≤ π. Determine the output of the system, y[n], when the input
x[n]=cos(5πn/2).
¾x[n]=cos(5πn/2)= cos(2πn+πn/2)=cos(πn/2)
1 jπn / 2 − jπn / 2
= (e +e )
2
1 jπ n / 2
¾ y[n]= [e H (e jπ / 2 ) + e− jπ n / 2 H (e − jπ / 2 )]
2
1 jπ n / 2 − jπ / 8 − jπ n / 2 + jπ / 8 1 j (π n / 2 −π / 8) − j (π n / 2 −π / 8)
= [e e +e e ] = [e +e ]
2 2
1
= cos(π n / 2 − π / 8)
2

26
• 5.5 The multiplication property (p.388)
¾Consider y[n] equal to the product of x1[n] and x2[n], with
Y(ejω), X1(ejω), and X2(ejω) denoting the corresponding Fourier
transforms.
"

"
27
28
 Discrete Frequency Continuous Frequency

CT

DT

29
• Ex. CTFT - CTFS Relationship

30
• Ex. CTFT - DTFT Relationship

31
• DTFS - DTFT Relationship

32
 ¾Table 5.1 and Table 5.2

• 5.7 Duality
¾Duality in the discrete-time Fourier series (p.391)
Consider two periodic sequences with period N, related through
the summation
1
f [m ] = ∑
N r =< N >
g [ r ]e − jr (2π / N ) m

"Let m=k and r=n

1
f [k ] =
N
∑
n =< N >
g[n ]e − jk (2π / N ) n

33
 „The sequence f[k] corresponds to the Fourier series
coefficients of the signal g[n].
FS
g [n ] ↔ f [k ]
1
"If we let m=n and r=-k D f [n ] = ∑ g[ −k ]e jk (2π / N ) n

k =< N > N

„We find that (1/N)g[-k] corresponds to the sequence of

Fourier series coefficients of f[n]
FS 1
f [n ] ↔ g [ − k ]
N
"This duality implies that every property of the discrete-
time Fourier series has a dual.
FS FS
− jk (2π / N ) n0 jm (2π / N ) n
„Ex. x[ n − n0 ] ↔ a k e D e x[n ] ↔ ak −m
34
¾Duality between the discrete-time Fourier transform and the
continuous-time Fourier series (p.395)

"Note that eqs. (5.73) and (5.76) are very similar, as are eqs.
(5.74) and (5.75)
35
 sin(π n / 2) F jω ⎧1, | ω |≤ π / 2
Ex. 5.17 x[n ] = ↔ X (e ) = ⎨
πn ⎩0, π / 2 <| ω |≤ π
⎧1, | t |≤ T1 FS sin( kT1 )
g (t ) = ⎨ ↔ ak = (T=2π)
⎩0, T1 <| t |≤ π kπ

sin(π k / 2) 1 π 1 π /2
∫π ∫π
− jkt
"T1=π/2 D = g (t )e dt = (1)e − jkt dt
πk 2π − 2π − /2

„Renaming k as n and t as ω
sin(π n / 2) 1 π / 2
∫
− jnω
= (1) e dω
πn 2π −π / 2
„ Replacing n by –n on both side
sin(π n / 2) 1 π / 2
∫
jnω
= (1) e dω
πn 2π −π / 2 36
• 5.8 Systems characterized by linear constant-coefficient
difference equations (397)
¾An LTI system with input x[n] and output y[n]

37
 "

"

"Frequency response

Ex. 5.18. y[n]-ay[n-1]=x[n], |a|<1. Find H(ejω) and h[n].

Ex. 5.19. Consider the causal LTI system that is characterized by

the difference equation

38
 "

"

Ex. 5.20. Consider the LTI system of ex. 5.19, and let the input
to this system be x[n]=0.25nu[n]. Find output y[n].

39
"

"

40