CHAPTER 3

Discrete-Time Signals in the

Transform-Domain
Wang Weilian
wlwang@ynu.edu.cn
School of Information Science and Technology
Yunnan University

Outline
The Discrete-Time Fourier Transform
The Discrete Fourier Transform
Relation between the DTFT and the DFT, and
Their Inverses
Discrete Fourier Transform Properties
Computation of the DFT of Real Sequences
Linear Convolution Using the DFT
The z-Transform

Discrete-Time Signals in the

Outline
Region of Convergence of a Rational z-Transform
Inverse z-Transform
z-Transform Properties

Discrete-Time Signals in the

The Discrete-Time Fourier Transform

The discrete-time Fourier transform (DTFT) or,
simply, the Fourier transform of a discretetime
sequence x[n] is a representation of the
sequence in terms of the complex exponential
sequence e j x where is the real frequency
variable.
The discrete-time Fourier transform
sequence x[n] is defined by

X e j

X e j

of a

x[n]e j n

Discrete-Time Signals in the

The Discrete-Time Fourier Transform

In general X e j is a complex function of the real

variable and can be written in rectangular form as

X e j X re e j jX im e j
where X re e j and X im e j are, respectively, the real and
j
imaginary parts of X e , and are real functions of .

Polar form

where

X e j X e j e j

arg X e j

Discrete-Time Signals in the

The Discrete-Time Fourier Transform

Convergence Condition:
If x[n] is an absolutely summable sequence, i.e.,

x n

if

then

X e

x n e

j n

x n

Thus the equation is a sufficient condition for the

existence of the DTFT.

Discrete-Time Signals in the

The Discrete-Time Fourier Transform

Bandlimited Signals:
A full-band discrete-time signal has a spectrum
occupying the whole frequency rang 0 .
If the spectrum is limited to a portion of the frequency
range 0 , it is called a bandlimited signal.
A lowpass discrete-time signal has a spectrum
occupying the frequency range 0 p , where p
is called the bandwidth of the signal.
A bandpass discrete-time signal has a spectrum
occupying the frequency range 0 L H
where H L is its bandwidth.

Discrete-Time Signals in the

The Discrete-Time Fourier Transform

Discrete-Time Fourier Transform Properties
There are a number of important properties of the
discrete-time Fourier transform which are useful in
digital signal processing applications. We list the
general properties in Table 3.2, and the symmetry
properties in Tables 3.3 and 3.4.

Discrete-Time Signals in the

The Discrete-Time Fourier Transform

Energy Density Spectrum
Parseval's relation:

1
j
*
j
g[n]h [ n]
G
(
e
)
H
(
e
)d

2
n -
Total energy of a finite-energy sequence g[n] :
*

g
If

h[n] g[n],

g n

then from Parseval's relation we observe

1
j
2
g | g[n] |
|
G
(
e
)
|
d

2
n -
The quantity: S gg e

G e
j

is called the energy density spectrum of the sequence g[ n].

Discrete-Time Signals in the

The Discrete Fourier Transform

DTFT Computation Using MATLAB
The Signal Processing Toolbox in MATLAB
Functions:
freqz
abs
Angle

The forms of freqz:

H = freqz(num, den, w)
[H, w] = freqz(num, den, k, whole)

Example 3.8:

Program 3_1

Discrete-Time Signals in the

The Discrete Fourier Transform

Definition
The simplest relation between a finite-length
sequence x[n], defined for 0 n N 1 , and its

DTFT X e j is obtained by uniformly sampling

X e j on the

-axis between 0 2

at

k 2 k / N , 0 k N 1 .
From X e

X k X e

x[n]e j n

2 k / N

N 1

j 2 kn / N
x
[
n
]
e
, 0 k N 1

n 0

Discrete-Time Signals in the

The Discrete Fourier Transform

The sequence X[k] is called the discrete Fourier
transform (DFT) of the sequence x[n].
Using the commonly used notation

WN e j 2 / N
We can rewrite as
N 1

X [k ] x[n]WNkn ,

0 k N 1

n 0

Inverse discrete Fourier transform (IDFT)

N 1

x[n] X [k ]e

j 2 kn / N

n0

N 1

X [k ]WN kn ,

0 n N 1

n0

Discrete-Time Signals in the

The Discrete Fourier Transform

Matrix Relations
N 1

The DFT samples defined in X [k ] x[n]WNkn can

n0

be expressed in matrix form as

X DN x
where X is the vector composed of the N DFT
samples,
T
X X 0 X 1 L X N 1
x is the vector of N input samples,

x x[0]x[1] L

x[ N 1]

Discrete-Time Signals in the

The Discrete Fourier Transform

DN is the N N DFT matrix given by

1 1 L
11

1
2
N- 1
1
WWW
L
N
N
N

2
4
2( N- 1)

DN 1WW
L
W
N
N
N

M
M M M

N- 1
2( N- 1)
( N- 1)( N- 1)
1 WWW

N
N
N
IDFT relations

1 *
x D X DN X
N
1
N

Discrete-Time Signals in the

The Discrete Fourier Transform

DFT computation Using MATLAB
MATLAB functions:
fft(x), fft(x,N), ifft(X), ifft(X,N)

X = fft(x, N)
If N < R=length(x), truncate ( ) to the first N
samples.
If N > R=length(x), zero-padded ( ) at the end.

Example 3.11, 3.12, 3.13, Program 3_2, 3_3, 3_4.

Discrete-Time Signals in the

Relation between the DTFT and the

DFT, and their Inverses
DTFT from DFT by Interpolation
We could express X e j in terms of X[k]:
Xe

N 1

x[n]e

N 1

N 1

k 0

n 0

j n

n 0

X [ k ] e

j n
kn
e
X
[
k
]
W

n 0 k 0

N 1

j 2 kn / N

N 1

e j n

N 2 k

1 N 1
2

e j 2 k / N

X
k
N 2 k
N k 0
sin
2N

sin

N 1 / 2

Discrete-Time Signals in the

Relation between the DTFT and the DFT, and

their Inverses
Sampling the DTFT
Consider the following question

DTFT

x[ n]

X ( e j )
k 2 k / N , 0 k N - 1

b ?
y[n], 0 n N - 1
DFT

Y [k ]

X ( e jk ), 0 k

N -1

We obtain the relation

y[n]

x[n mN ],

0 n N -1

Example 3.14

Discrete-Time Signals in the

Relation between the DTFT and the DFT, and

their Inverses
Numerical Computation of the DTFT Using the DFT
Let X (e j ) be the DTFT of length-N sequence x[n]. We
wish to evaluate X (e j ) at a dense grid of frequencies:

k 2 k / M , 0 k M 1, where M ? N

X e jk X e j

N 1

j k n
x
[
n
]
e

n 0

N 1

j 2 kn / M
x
[
n
]
e

n 0

x[n] 0 n N 1
Define a new sequence xe [n]
N n M -1
0

then X e jk DFT { xe [n]}

M 1

n 0

xe [ n]e j 2 kn / M

Discrete-Time Signals in the

Discrete Fourier Transform Properties

Discrete Fourier Transform Properties
Like the DTFT, the DFT also satisfies a number
of properties that are useful in signal processing
application. A summary of the DFT properties are
included in Tables 3.5, 3.6, and 3.7.

Discrete-Time Signals in the

Discrete Fourier Transform Properties

Circular Shift of a Sequence
Time-shifting property of the DTFT

x1 [n] x[n n0 ]
DTFT

X 1
(e j )

e j n0 X (e j )

Circular shifting property of the DFT

x[n], 0 n N - 1
DFT

N -1

b ?
xc [n], 0 n N - 1
DFT
We obtain

X [ k], 0 k

Xc [k ] W Nkn0 X [k], 0 k

N -1

xc [ n] x[ n n0 N ] x[( n n0 )% N ]

n0 n N 1
x[n n0 ]
For n0 >0, xc [n]
0 n n0
x[n n0 N ]

Discrete-Time Signals in the

Computation of the DFT of Real

Sequences
Computation of the DFT of Real Sequences
Tow N-point DFTs can be computed efficiently
using a single N-point DFT X[k] of a complex
length-N sequence x[n] defined by

x n g n jh n
where, g n Re{x[n]} and h[n] Im{x[n]}

Discrete-Time Signals in the

Computation of the DFT of Real

Sequences
we arrive at:

1
G k { X [k ] X * k N },
2
1
H k
X k X * k N
2j

Note that

X * k N X *

N k

Discrete-Time Signals in the

Linear Convolution Using the DFT

Linear Convolution of Two Finite-Length
Sequences
Let g[n] and h[n] be finite-length sequences of
lengths N and M, respectively. Denote L=M+N-1.
Define two length-L sequences,

g n , 0 n N 1

ge n

0.N n L 1

h n , 0 n M 1

he n

0.M n L 1

Discrete-Time Signals in the

Linear Convolution Using the DFT

obtained by appending g[n] and h[n] with
zero-valued samples. Then

y L n g n h n yc n

g e n linear convolution he n

Linear Convolution of a Finite-Length Sequence

with an Infinite-Length Sequence
Overlap-Add Method
Overlap-Save Method

Discrete-Time Signals in the

The z-Transform
Definition
For a given sequence g[n], its z-transform G(z) is
defined as

G z Z g n

g n z n

where z Re z j Im z is a complex variable.

j
z

re
If we let
, then the right-hand side of the

above expression reduces to

G re j

g n r n e j n
Discrete-Time Signals in the

The z-Transform
For a given sequence, the set R of values of z
for which its z-transform converges is called
the region of convergence (ROC).
If

g n r n

In general, the region of convergence R of a ztransform of a sequence g[n] is an annular region

of the z-plane:
Rg z Rg

Discrete-Time Signals in the

The z-Transform
Rational z-Transforms

An alternate representation as a ration of two

polynomials in z:

An alternate representation in factored form as

Discrete-Time Signals in the

Region of Convergence of a Rational zTransform

The ROC of a rational z-transform is bounded by
the locations of its poles.
A finite-length sequence ROC:

0 z

A right-sided sequence ROC:

Rg z

A left-sided sequence ROC:

z Rg

A two-sided sequence ROC:

Rg z Rg

Discrete-Time Signals in the

Inverse z-Transform
General Expression
By the inverse Fourier transform relation. We have

g n r

G re j e j n d
j

By making the change of variable z re , the above

equation can be converted into a contour integral given
by

g n

1
n 1
G
z
z
dz

'

2 j C

'

Where C is a counterclockwise contour of integration

defined by
z r

Discrete-Time Signals in the

Inverse z-Transform
Inverse Transform by Partial-Fraction Expansion
G z can be expressed as

P z
G z
D z

We can divide P(Z) by D(Z) and re-express G(Z) as

P z
G z l z
D z
l 0
M N

Discrete-Time Signals in the

Inverse z-Transform
Simple Poles

p168

Multiple Poles

p169

Discrete-Time Signals in the

z-Transform Properties
P174 Table 3.9

Discrete-Time Signals in the

Summary
Three different frequency-domain representations of an
aperiodic discrete-time sequence have been introduced and
their properties reviewed .Two of these representations, the
discrete-time Fourier transform (DTFT) and the z-transform,
are applicable to any arbitrary sequence, whereas the third
one , the discrete Fourier transform (DFT), can be applied
only to finite-length sequences.
Relation between these three transforms have been
established. The chapter ends with a discussion on the
transform-domain representation of a random discrete-time
sequence.
For future convenience we summarize below these three
frequency-domain representations.

Discrete-Time Signals in the

Assignment and Experiment

Assignment
A03: 3.2, 3.12, 3.20, See p180~182
A04:
A05:

Experiment
E03: Q3.3 See p32
E04:
E05

Discrete-Time Signals in the