Digital Signal Processing

FREQUENCY-DOMAIN REPRESENTATION OF
DISCRETE-TIME SIGNALS AND SYSTEMS
Eigenfunctions for Linear Time-Invariant Systems
Considering input x[n] = ejωn for −∞ < n < ∞, the
corresponding output of an LTI system with impulse response
h[n] is

ejωn is eigen function

of the system
H(ejw) is eigenvalue

Digital Signal Processing 2

A Sum of Sinusoids

Digital Signal Processing 3

Frequency
 Frequency is the rate of change with respect to time.

 Change in a short span of time means high frequency.

 Change over a long span of time means low frequency.

Digital Signal Processing 4

Note:

 If a signal does not change at all, its frequency is zero.

 If a signal changes instantaneously, its frequency is infinite.

Digital Signal Processing 5

Phase

Phase describes the position of the waveform relative to

time 0.

Digital Signal Processing 6

Fig. Three sine waves with the same amplitude
and frequency, but different phases
Digital Signal Processing 7
Fourier Analysis

Fourier analysis is a tool that changes a time domain

signal to a frequency domain signal and vice versa.

Digital Signal Processing 8

Fourier Series
 Every periodic signal can be represented with a series of sine
and cosine functions.

 The functions are integral harmonics of the fundamental

frequency “f” of the signal.

 Using the series we can decompose any periodic signal into

its harmonics.

Digital Signal Processing 9

Fourier Series

Digital Signal Processing 10

Examples of Signals and the Fourier Series
Representation

Digital Signal Processing 11

Sawtooth Signal

Digital Signal Processing 12

Fourier Transform
 Fourier Transform gives the frequency domain of a non
periodic time domain signal.

Digital Signal Processing 13

Example of a Fourier Transform

Digital Signal Processing 14

Inverse Fourier Transform

Digital Signal Processing 15

Discrete Time Fourier Transform (DTFT)

Digital Signal Processing 16

Discrete Time Fourier Transform (DTFT)
Example:

Digital Signal Processing 17

Discrete Time Fourier Transform (DTFT)
Example:

Digital Signal Processing 18

DTFT of x[n] = 1

 x[n] = 1 ∀n doesn't have absolute summability or squared

summability, hence the DTFT summation does not converge
in any of the usual senses.
 We can however guess" at the DTFT as

Digital Signal Processing 19

Fourier Series Analysis Technique
 Express the periodic excitation in terms of Fourier harmonics

Digital Signal Processing 20

DTFS Representation

Digital Signal Processing 21

DTFT

Digital Signal Processing 22

Digital Signal Processing 23
DT FT Example

Digital Signal Processing 24

Digital Signal Processing 25
Fourier transform of Periodic Impulse train

Digital Signal Processing 26

Fourier transform of Periodic Impulse train
So, periodic impulse train is represented as

Digital Signal Processing 27

Fourier transform of Periodic Impulse train

Digital Signal Processing 28

Periodic Sampling
 In this method x[n] obtained from
xc(t) according to the relation :

x [ n ]  x c ( nT )   n  
T  sampling period f s  1/T  sampling frequency

• The sampling operation is generally not invertible i.e., given the output x[n] it
is not possible in general to reconstruct xc(t). Although we remove this
ambiguity by restricting xc(t).

Digital Signal Processing 29

Sampling with a Periodic Impulse Train
 Figure(a) is not a representation of any
physical circuits, but it is convenient for
gaining insight in both the time and
frequency domain.

s (t )    (t  nT )
n 

(a) Overall system

(b) xs(t) for two sampling rates

(c) Output for two sampling rates

Digital Signal Processing 30

 Frequency Domain Representation of Sampling

 Let us now consider the Fourier transform of xs(t):

 If s (t ) 
Fourier
S ( j ) and x c (t )  X C ( j )
Fourier

Assignment
2 
S ( j) 
T
  (   k )
k  
s where  s  2 / T is the sampling rate in radians/s.

1 1
X s ( j ) 
2
X c ( j ) * S ( j  ) 
T
 X  j (  k  ) 
k 
c s

Digital Signal Processing 31

 Frequency Domain Representation of Sampling

 By applying the continuous-time Fourier transform to equation



We obtain x s (t )  
n 
x c ( nT ) (t  nT )

X S ( j )  
n 
x c ( nT )e  j Tn

consequently x [ n ]  x c ( nT ) and X (e j
) 
n 
x [ n ]e  j  n

1 
  2k 
X s ( j )  X (e j
)  X (e j T
) X (e j
)
T
 X c

j
T

T


 T k  

Digital Signal Processing 32

Frequency Domain Representation of Sampling

Example:

Solution:

Digital Signal Processing 33

Exact Recovery of Continuous-Time
from Its Samples
 (a) represents a band limited
Fourier transform of xc(t)
Whose highest nonzero
frequency is  N .

 (b) represents a periodic

impulse train with S
frequency

 (c) shows the output of

impulse modulator in the
case
S   N   N  S  2 N

Digital Signal Processing 34

Exact Recovery of Continuous-Time
from Its Samples
 In this case X C ( j ) don’t
overlap
 therefore xc(t) can be
recovered from xs(t) with an
ideal low pass filter H r ( j )
with gain T and cutoff
frequency
 N  C  S   N
 It means X r ( j )  X C ( j )

=
Digital Signal Processing 35
Aliasing Distortion
 (a) represents a band limited
Fourier transform of xc(t)
Whose highest nonzero
frequency is  N .

 (b) represents a periodic

impulse train with 
S
frequency.

 (c) shows the output of

impulse modulator in the
case
S   N   N  S  2 N

Digital Signal Processing 36

Aliasing Distortion

X ( j )
 In this case the copies of C
overlap and is not longer recoverable by
lowpass filtering therefore the reconstructed signal is related to original
continuous-time signal through a distortion referred to as aliasing distortion.

Digital Signal Processing 37

Sampling of Continuous time signals
Example:

Digital Signal Processing 38

Sampling of Continuous time signals
Solution:

Digital Signal Processing 39