Representation of Sequences

by Fourier Transforms

Many sequences can be represented by a Fourier

integral of the form as
∞

∑ x[n]e
1 π

Discrete Time Fourier Transform x[n ] = ∫ π X (e

jω
)e jωn dω. X (e jω ) = − jωn
2π −
n = −∞

Frequency response of a LTI system is simply the

Maryam Mahsal Khan (Lecturer)
Fourier transform of the impulse response.
»B.Sc (CSE) – UET Peshawar
∞

∑ h[n]e
»M.Sc(EE) – UTP Malaysia 1 π
H (e jω ) = − jωn
∫ π H (e
jω
h[n ] = )e jωn dω.
2π − n = −∞

Representation of Sequences
Fourier Transform (Convergence)
by Fourier Transforms

Determining the class of signals that can be represented

Fourier transform is equivalent to considering the
The frequency response of discrete-time LTI system is convergence of the infinite sum of the Fourier transform.
always a periodic function with period 2π. A sufficient condition for convergence can be found as
∞ ∞ ∞

H (e j ( ω + 2π )
)=
∞

∑ h[n]e − j ( ω + 2π ) n
=
∞

∑ h[n]e − jωn jω
= H (e )
X ( e jω ) = ∑ x[n]e
n = −∞
− jωn
≤ ∑ x[n ] e
n = −∞
− jωn
≤ ∑ x[n] < ∞
n = −∞
n = −∞ n = −∞

More generally, H ( e j (ω + 2πr ) ) = H ( e jω ), for r an integer.
Thus, if a sequence is absolutely summable, then its Fourier
transform exists. The series can be shown to converge
uniformly to a continuous function of ω.
Since a stable sequence is, by definition, absolutely
summable, all stable sequences have Fourier transforms.

1
 Example 2.19 Ideal Frequency-Selective
Fourier Transform (Interpretation)
Filters: Ideal Lowpass filter

Signals: The Fourier Transform X ( e jω ) of a signal x[n]

describes the frequency content of the signal.
At each frequency ω0 , the magnitude spectrum X ( e 0 )
jω
„

describes the amount of that frequency contained in the signal.

„ At each frequency ω0 , the phase spectrum ∠X (e jω0 )
describes the location (relative shift) of that frequency
component of the signal.
Systems: The frequency response H ( e jω ) of a linear system
describes how frequencies input to the system are modified:
„ An input frequency component ω 0 is amplified or attenuated
jω
by a factor H (e 0 ) .
„ An input frequency component ω 0 is shifted by an amount
∠H (e jω0 ).

DTFT of Ideal Low-Pass Filter Contd..

Convergence of the Fourier Transform

The oscillatory behaviour – Gibbs Phenomena

( ) ∑ sinπωn ne
M
H M e jω = c − jω

n=− M

2
 Frequency-Domain Representation Frequency-Domain Representation
of Discrete-Time Systems of Discrete-Time Systems (Cont’d)

Eigenfunctions for LTI system Frequency response of the system is defined as

„ Consider an input sequence ∞
x[ n ] = e jωn for − ∞ < n < ∞, H ( e jω ) = ∑ h[k ]e
k = −∞
− jωk
,
The corresponding output of a LTI discrete-time system with
impulse response h[n ] is
∞
⎛ ∞ ⎞ „ Real and imaginary representation
y[n ] = x[n ] * h[n ] = ∑ h[k ]e ω j (n−k )
= e jωn ⎜ ∑ h[k ]e − jωk ⎟.
⎝ k = −∞ ⎠
k = −∞
∞ H ( e jω ) = H R ( e jω ) + jH I ( e jω )
„ If we define H ( e jω ) = ∑ h[k ]e
k = −∞
− jωk
,

„ Magnitude and phase polar representation

„ Then we have y[n ] = H ( e jω )e jωn .
jω

jωn H ( e jω ) = H ( e jω ) e j∠H ( e ) .
„ We define e as an eigenfunction of the system, and the
associated eigenvalue is H ( e jω ) .

Example 2.17 Frequency Response of Example 2.20 Frequency Response

the Ideal Delay of the Moving-Average System

Consider the ideal delay system defined by The impulse response of a moving-average system is
y[n ] = x[n − nd ], where nd is a fixed integer. ⎧ 1
⎪ − M1 ≤ n ≤ M 2 ,
„ If we consider x[n ] = e
jωn
as input to this system. h[n ] = ⎨ M 1 + M 2 + 1
„ Then we have the output ⎩⎪ 0 otherwise.
y[n ] = e jω ( n − nd ) = e − jωnd e jωn „ The frequency response is
M2
1
„ Therefore, the frequency response of the ideal delay is H ( e jω ) = ∑ e − jωn
M 1 + M 2 + 1 n = − M1
H ( e jω ) = e − jωnd .
„ Real and imaginary representation 1 e jωM1 − e − jω ( M 2 +1)
H ( e jω ) = cos(ωnd ) + j sin(ωnd ).
=
M1 + M 2 + 1 1 − e − jω
„ Magnitude and phase representation
1 sin(ω ( M 1 + M 2 + 1) / 2) − jω ( M 2 − M1 ) / 2
H ( e jω ) = 1 and ∠H ( e jω ) = −ωnd . = e .
M1 + M 2 + 1 sin(ω / 2)

3
 Example 2.20 Frequency Response
of the Moving-Average System (Cont’d)
Application Example - Signal Smoothing
A common DSP application is the removal of noise from a signal corrupted by additive noise.
A simple 3-point moving average algorithm is given by:

% Signal Smoothing by Averaging 1

clf;
y[n] = ( x[n − 1] + x[n] + x[ n + 1])
3
% Generate random noise, d[n]
R = 51; d = 0.8*(rand(R,1) - 0.5); 8
d[n]
% Generate uncorrupted signal, s[n] 6
s[n]

Amplitude
m = 0:R-1; s = 2*m.*(0.9.^m); 4 x[n]

% Generate noise corrupted signal, x[n] 2

H ( e − jω0 ) = H * ( e jω0 )? x = s + d'; 0

subplot(2,1,1); -2
plot(m,d','r-',m,s,'g--',m,x,'b-.'); 0 5 10 15 20 25
Time index n
30 35 40 45 50

xlabel('Time index n');ylabel('Amplitude'); 8

legend('d[n] ','s[n] ','x[n] '); y[n]
% do smoothing 6 s[n]

Amplitude
x1 = [0 0 x];x2 = [0 x 0];x3 = [x 0 0]; 4
y = (x1 + x2 + x3)/3;
2
subplot(2,1,2);
plot(m,y(2:R+1),'r-',m,s,'g--'); 0
0 5 10 15 20 25 30 35 40 45 50
legend( 'y[n] ','s[n] '); Time index n
xlabel('Time index n');ylabel('Amplitude');

Symmetry Properties of the Symmetry Properties of the

Fourier Transform Fourier Transform (Cont’d)

Symmetry properties of the Fourier transform are often
very useful for simplifying the solution of problems.
Some basic definitions
„ Conjugate-symmetric sequence
„ Conjugate-antisymmetric sequence xo [n ] = − x [ − n ]
Similarly, a Fourier transform X ( e jω ) can be
decomposed into a sum of conjugate-symmetric and
conjugate-antisymmetric functions.
x e [n ] = x e* [ − n ] X ( e jω ) = X e ( e jω ) + X o ( e jω )
*

[ ] [ ]
o 1 1
„ Any sequence can be expressed as a sum of a conjugate- X e ( e jω ) = X ( e jω ) + X * ( e − jω ) = X e* ( e − jω ) X o ( e jω ) = X ( e jω ) − X * ( e − jω ) = − X o* ( e − jω )
2 2
symmetric and conjugate-antisymmetric sequence
1
x e [n ] =
2
[ ]
x[n ] + x * [ −n ] = x e* [ −n ]
x[n ] = x e [n ] + x0 [n ]
Re{ x[n ]} =
1
( x[n ] + x * [n ]) j Im{x[n ]} =
1
( x[n ] − x * [n ])
2 2
1
[ ]
xo [n ] = x[n ] − x * [ − n ] = − xo* [ − n ]
2
For real sequences, the real part of the Fourier
„ Even sequence (real): x e [n ] = x e [ − n ] transform is an even function, and the imaginary part is
an odd function.
„ Odd sequence (real): x o [ n ] = − xo [ − n ]

4
 Fourier Transform Theorems

Example: Determining an h[n] from Difference

Frequency Response of LCCDE
Equation

y[n] − y[n − 1] = x[n] − x[n − 1]

1 1
2 4
jω 1 − jω jω 1 jω
H (e )− e H (e ) = 1 − e −
2 4
1
1 − e − jω
jω 4
H (e ) =
1
1 − e − jω
2
1 − jω
e
jω 1
H (e ) = − 4
1 − jω 1 − jω
1− e 1− e
2 2
From Transform Tables
n n −1
⎛1⎞ ⎛ 1 ⎞⎛ 1 ⎞
h [ n ] = ⎜ ⎟ u [n ] − ⎜ ⎟ ⎜ ⎟ u [n − 1 ]
⎝2⎠ ⎝ 4 ⎠⎝ 2 ⎠

5
Example 2.22 Determining the Impulse Response
from the Frequency Response

The frequency response of a high-pass filter with delay

⎧e − jωnd ωc < ω < π
H ( e jω ) = ⎨ .
⎩ 0 ω < ωc

H ( e jω ) = e − jωnd (1 − H lp ( e jω )) = e − jωnd − e − jωnd H lp ( e jω ),

⎧1, ω < ωc sin ωc n
H lp ( e jω ) = ⎨ hlp [n ] =
⎩ 0, ωc < ω ≤ π. πn
sin ωc ( n − nd )
h[n ] = δ [n − nd ] −
π (n − nd )