0% found this document useful (0 votes)
11 views33 pages

5 DTFT

The document discusses the transform-domain representation of discrete-time signals, focusing on the Discrete-Time Fourier Transform (DTFT) and its properties. It provides definitions, examples, and mathematical formulations of the DTFT, including its magnitude and phase functions, convergence conditions, and applications in signal processing. Additionally, it outlines common DTFT pairs and properties useful for analyzing discrete-time sequences.

Uploaded by

allanbarongo96
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
11 views33 pages

5 DTFT

The document discusses the transform-domain representation of discrete-time signals, focusing on the Discrete-Time Fourier Transform (DTFT) and its properties. It provides definitions, examples, and mathematical formulations of the DTFT, including its magnitude and phase functions, convergence conditions, and applications in signal processing. Additionally, it outlines common DTFT pairs and properties useful for analyzing discrete-time sequences.

Uploaded by

allanbarongo96
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 33

Transform-Domain

Representation of
Discrete-Time Signals
• Three useful representations of discrete-
time sequences in the transform domain:
- Discrete-time Fourier Transform
- Discrete Fourier Transform
- z Transform
Discrete-Time Fourier
Transform
• A discrete-time signal can be represented in
the frequency domain using discrete-time
Fourier transform.
• Therefore, the Fourier transform of a discrete
time sequence is called the discrete-time
Fourier transform (DTFT).
• Is a form of Fourier analysis that is
applicable to a sequence of values
Discrete-Time Fourier
Transform
• Definition - The discrete-time Fourier
transform (DTFT) X (e j ) of a sequence
x[n] is given by

j  j n
X (e )  x[n]e
n 
• In general, X ( e j )
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 )
Note:The DFT is one of the most powerful tools in digital signal processing which enables us to find the
spectrum of a finite-duration signal.
Discrete-Time Fourier
Transform
• X re (e j ) and X im (e j ) are, respectively,
the real and imaginary parts of X (e j ), and
are real functions of 
• X (e j ) can alternately be expressed as
X (e j )  X (e j ) e j()
where
() arg{ X (e j )}
Discrete-Time Fourier
Transform
• X (e j ) is called the magnitude function
• () is called the phase function
• Both quantities are again real functions of 
• In many applications, the DTFT is called
the Fourier spectrum
• Likewise, X (e j ) and () are called the
magnitude and phase spectra
Discrete-Time Fourier
Transform
• For a real sequence x[n], X (e j ) and X re (e j )
are even functions of , whereas, ()
and X im (e j ) are odd functions of 
• Note: X (e j )  X (e j ) e j ( ( )2k )

 X (e j ) e j()
for any integer k
• The phase function () cannot be
uniquely specified for any DTFT
Discrete-Time Fourier
Transform
• Unless otherwise stated, we shall assume
that the phase function () is restricted to
the following range of values:
  ()  
called the principal value
Discrete-Time Fourier
Transform
• Example - The DTFT of the unit sample
sequence [n] is given by

 j n
( )    [n]e  [0] 1
n 
• Example - Consider the causal sequence
n
x[n]   [n],   1
Discrete-Time Fourier
Transform
• Its DTFT is given by
 
j n  j n n  j n
X (e )   [n]e   e
n  n 0

  ( e  j )n  1
n 0 1  e  j
 j
as  e   1
j 1 1
X (e )   j

1  e 1   cos   j sin 

1
X e 
j 2

(1   cos  ) 2   sin  
2

1

1  2 cos    2

arg( X (e j )  tan  1 ( sin  1  cos  )


For  0.5
2 1
X ( e j ) 
1.25  cos 

 0.5 sin  
arg( X (e j )  tan  1  
 1  0.5 cos  
Discrete-Time Fourier
Transform
• The magnitude and phase of the DTFT
j  j
X (e ) 1 /(1  0.5 e ) are shown
below 2
0.6

0.4

Phase in radians
0.2
1.5
Magnitude

1 -0.2

-0.4

0.5
-3 -2 -1 0 1 2 3 -3 -2 -1 0 1 2 3
w/p w/p
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:
Discrete-Time Fourier
Transform
• Therefore 
j  j n
X (e )  x[n]e
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  j n
x[n]   X (e )e d
2  
Discrete-Time Fourier
Transform
• Inverse Discrete Fourier Transform:

1 j j n
x[n]   X (e )e d
2  
Discrete-Time Fourier
Transform
• Convergence Condition - An infinite
series of the form

j  j n
X (e )  x[n]e
n 
may or may not converge
Discrete-Time Fourier
Transform

•Now, if x[n] is an absolutely summable


sequence, i.e., if


 x[n]  
n 
Discrete-Time Fourier
Transform
• Then
 
j  j n
X (e )  x[n]e   x[n]  
n  n 

for all values of 


• Thus, the absolute summability of x[n] is a
sufficient condition for the existence of the
DTFT X (e ) j 
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
j
and its DTFT X ( e ) therefore converges
 j
to 1 /(1   e uniformly
)
Discrete-Time Fourier
Transform
• The DTFT can also be defined for a certain
class of sequences which are not absolutely
summable.
• Examples of such sequences are the unit
step sequence [n], the sinusoidal sequence
A n
cos( o n   ) and the exponential sequence
• For this type of sequences, a DTFT
representation is possible using the Dirac
delta function ()
Discrete-Time Fourier
Transform
• The function

X ( e j )   2 (  o  2 k)
k 
is a periodic function of  with a period 2
and is called a periodic impulse train
• To verify that X (e j ) given above is indeed
the DTFT of we j o n
compute the
x[n] e
inverse DTFT of j
X (e )
Discrete-Time Fourier
Transform
• Thus

1
x[n]    2(  o  2 k)e jn d
2   k 

 (  o )e jn d e jo n

where we have used the sampling property
of the impulse function  ( )
Table 3.1
Commonly Used DTFT Pairs
Sequence DTFT
 [n]  1

1   2 (  2 k)
k  

j o n
e   2 (   o  2 k)
k  
1 
 [n ]   j
    (  2 k )
1 e k  
1
 n [n], (   1) 
1   e  j
DTFT Properties
• There are a number of important properties
of the DTFT that are useful in signal
processing applications
• These are listed here without proof
• Their proofs are quite straightforward
• We illustrate the applications of some of the
DTFT properties
Table 3.2:General Properties of
DTFT
DTFT Properties
• Example - Determine the DTFT Y (e j ) of
n
y[n] (n  1)  [n],   1
• Let x[n]  n  [n],   1
• We can therefore write
y[n] n x[n]  x[n]
• From Table 3.1, the DTFT of x[n] is given
by j 1
X (e ) 
1   e  j
DTFT Properties
• Using the differentiation property of the
DTFT given in Table 3.2, we observe that
the DTFT of n x[n] is given by
dX (e j ) d  1   e  j
j j   
d d  1   e  j   (1   e  j 2
)
• Next using the linearity property of the
DTFT given in Table 3.2 we arrive at
 j
j e 1 1
Y (e )   j 2
  j
  j 2
(1   e ) 1  e (1   e )
DTFT Properties
• Example - Determine the DTFT V (e j )of
the sequence v[n] defined by
d 0v[n]  d1v[n  1]  p0 [n]  p1 [n  1]
• From Table 3.1, the DTFT of  [n]is 1
• Using the time-shifting property of the
DTFT given in Table 3.2 we observe that the
j the DTFT of
DTFT of  1] e and
 [n is
v[nis 1] e  jV (e j )
DTFT Properties
• Using the linearity property of Table 3.2 we
then obtain the frequency-domain
representation of
d 0v[n]  d1v[n  1]  p0 [n]  p1 [n  1]
as
j  j j  j
d 0V (e )  d1e V (e )  p0  p1e
• Solving the above equation we get
 j
j p  p e
V (e )  0 1
d 0  d1e  j
DTFT Computation Using
MATLAB
• The function freqz can be used to compute
the values of the DTFT of a sequence,
described as a rational function in in
the form of
 j  j M
p  p e  ....  p e
X ( e j )  0 1 M
d 0  d1e  j  ....  d N e  jN
at a prescribed set of discrete frequency
points   
DTFT Computation Using
MATLAB
• For example, the statement
H = freqz(num,den,w)
returns the frequency response values as a
vector H of a DTFT defined in terms of the
vectors num and den containing the
coefficients { pi } and {di } , respectively at a
prescribed set of frequencies between 0 and
2 given by the vector w
 0 : pi / k : pi;
DTFT Computation Using
MATLAB
• Example - Plots of the real and imaginary
parts, and the magnitude and phase of the
DTFT
 j  j 2
0.008  0.033 e  0.05 e
 j 3  j 4
j  0.033 e  0.008 e
X (e )   j  j 2
1  2.37 e  2.7 e
 1.6 e  j 3  0.41e  j 4
are shown on the next slide
DTFT Computation Using
MATLAB
Real part Imaginary part
1 1
Amplitude

Amplitude
0 0

-1 -1
0 0.5 1 0 0.5 1
/ /
Magnitude Spectrum Phase Spectrum
1 5
Phase, radians
Magnitude

0.5 0

0 -5
0 0.5 1 0 0.5 1
/ /
DTFT Computation Using
MATLAB
• Note: The phase spectrum displays a
discontinuity of 2 at  = 0.72
• This discontinuity can be removed using the
function unwrap as indicated below
Unwrapped Phase Spectrum
0

-1

-2
Phase, radians

-3

-4

-5

-6

-7
0 0.2 0.4 0.6 0.8 1
w/p

You might also like