ECE 3331b

Introduction to Signal Processing

Lecture 4

Instructor: Dr. Ilia G. Polushin

Department of Electrical & Computer Engineering

Faculty of Engineering

The University of Western Ontario

Winter 2017
Schedule: Lectures & Office Hours

Lectures:

Wednesday 8:30 a.m. - 9:30 a.m., SEB 1200

Friday 8:30 a.m. - 10:30 a.m., SEB 1200

Office Hours:

Thursday 12:30 pm 1:30 pm.

Random drop-by is welcome, availability is not guaranteed
Office: TEB 357
Homework 1

Homework 1 is posted on OWL

Solutions to Homework 1 will be posted on OWL on January 25th, 2017

Content:
Introduction: Signals, Systems and Signal Processing, Classification of Signals, The Concept
of Frequency in Continuous-Time and Discrete-Time Signals, Analog-to-Digital and Digital-to-
Analog Conversion.

Discrete-Time Signals and Systems: Discrete-Time Signals, Discrete-Time Systems, Anal-

ysis of Discrete-Time Linear Time-Invariant (LTI) Systems, Discrete-Time Systems Described
by Difference Equations, Implementation of Discrete-Time Systems

The z-Transform and its Application to the Analysis of LTI Systems: The z-Transform,
Properties of the z-Transform, Rational z-Transforms, Inversion of the z-Transform, Analysis of
LTI Systems in the z-Domain, The One-sided z-Transform

Frequency Analysis of Signals: Frequency Analysis of Continuous-Time Signals Frequency

Analysis of Discrete-Time Signals Properties of the Fourier Transform for Discrete-Time Signals

Frequency-Domain Analysis of LTI Systems: Frequency-Domain Characteristics of LTI

Systems, Frequency Response of LTI Systems

The Discrete Fourier Transform: Frequency-Domain Sampling: The Discrete Fourier Trans-
form (DFT), Properties of the DFT

The Fast Fourier Transform

Topic 2: Discrete-Time Signals and Systems

Discrete-Time Signals

Discrete-Time Systems

Analysis of Discrete-Time Linear Time-Invariant (LTI) Systems

Discrete-Time Systems Described by Dierence Equations

Implementation of Discrete-Time Systems

Discrete-Time Signals

Mathematically, a discrete-time signal is defined on a set of integer

numbers, such as
Z+ := {0, 1, 2, 3, . . .}
or
Z := {. . . , 2, 1, 0, 1, 2, . . .}

A discrete-time signal is not defined for noninteger numbers, such as

n = 3.5.

In the following, all discrete-time signals are assumed to be defined for

all n 2 Z := {. . . , 2, 1, 0, 1, 2, . . .} if not otherwise specified
Representations of Discrete-Time Signals

Graphical:

Functional:

8
< 1, for n = 1, 3,
x(n) := 4, for n = 2,
:
0, otherwise
Representations of Discrete-Time Signals
Tabular representation:

n ... -2 -1 0 1 2 3 4 ...
x(n) ... 0 0 0 1 3 5 -1 ...

Sequence representation: (symbol " indicates the time origin, i.e., n = 0)

Infinite duration sequence:

x(n) = {. . . , 0, 0, 0, 1, 3, 5, 1, . . .}
"

A sequence which is defined for n 0 only:

x(n) = {0, 1, 3, 5, 1, . . .} .
"

A finite-duration sequence:

x(n) = {0, 1, 3, 4, 1} .
"
Some Elementary (but Important) Discrete-Time Signals

The unit impulse signal (sequence):

1, for n = 0,
(n) :=
0, for n 6= 0
Some Elementary (but Important) Discrete-Time Signals

The unit step signal:

1, for n 0,
u(n) :=
0, for n < 0
Some Elementary (but Important) Discrete-Time Signals

The unit ramp signal:

n, for n 0,
ur (n) :=
0, for n < 0
Some Elementary (but Important) Discrete-Time Signals

The exponential signal:

x(n) := an for all n.

Classification of Discrete-Time Signals

Energy Signals vs Power Signals

Periodic Signals vs. Aperiodic Signals

Symmetric (Even) Signals vs. Asymmetric (Odd) Signals

Energy Signals vs Power Signals
The energy of a discrete-time signal x(n) is defined as
1
X 2
E[x] := |x(n)| .
n= 1

E[x] 0 for any signal x(n).

A signal x(n) is called energy signal if E[x] < 1.

Energy of x(n) over the finite interval N n N:

N
X 2
EN [x] := |x(n)| .
n= N
Energy Signals vs Power Signals
The average power of a discrete-time signal x(n) is defined as

XN
1
P [x] := lim |x(n)|2 .
N !+1 2N + 1
n= N

If E[x] < +1 for some signal x(n), then P [x] = 0. (Why?)

A signal x(n) is called power signal if 0 < P [x] < 1.

The average power of x(n) over the finite interval N n N:

XN
1
PN [x] := |x(n)|2 .
2N + 1 n= N
Energy Signals vs Power Signals
Example 2.1.1 (from Proakis & Manolakis, 2007): Determine the energy and the average
power of the unit step sequence.

Solution: Unit step sequence:

(
1, for n 0,
u(n) :=
0, for n < 0

Energy:
+1
X +1
X
2
E [u(n)] = |u(n)| = 1 = +1.
n= 1 n=0

u(n) is not an energy signal.

Power:
N
X XN
1 2 1 N +1 1 + 1/N 1
P [u(n)] = lim |u(n)| = lim 1 = lim = lim = .
N !+1 2N + 1 N !+1 2N + 1 N !+1 2N + 1 N !+1 2 + 1/N 2
n= N n=0

u(n) is a power signal.

Classification of Discrete-Time Signals

Energy Signals vs Power Signals

Periodic Signals vs. Aperiodic Signals

Symmetric (Even) Signals vs. Asymmetric (Odd) Signals

Periodic Signals vs. Aperiodic Signals

A signal x(n) is periodic with period N > 0 if and only if

x(n + N ) = x(n) for all n. (P)

The smallest N > 0 such that (P) holds is called the fundamental period of x(n).

A signal x(n) is aperiodic (nonperiodic) if there is no N > 0 such that (P) holds.

Example: A sinusoidal signal

x(n) = A cos(2f n + )

is periodic if f is a rational number (f = k1 /k2 , where k1 , k2 are integers) and aperiodic

otherwise.
Classification of Discrete-Time Signals

Energy Signals vs Power Signals

Periodic Signals vs. Aperiodic Signals

Symmetric (Even) Signals vs. Asymmetric (Odd) Signals

Symmetric (Even) Signals vs. Asymmetric (Odd) Signals

Symmetric (Even) Signals vs. Asymmetric (Odd) Signals

A signal x(n) is symmetric (even) if

x(n) = x( n) for all n

Example:
Symmetric (Even) Signals vs. Asymmetric (Odd) Signals

Symmetric (Even) Signals vs. Asymmetric (Odd) Signals

A signal x(n) is asymmetric (odd) if

x( n) = x(n) for all n.

Example:
Symmetric (Even) Signals vs. Asymmetric (Odd) Signals

Any discrete-time signal can be represented as a sum of an even and an odd components:

1 1
x(n) = [x(n) + x( n)] + [x(n) x( n)]
2| {z } 2| {z }
even odd
Simple Manipulations of DT Signals
Time shifting: x(n) ! x (n) := x(n k)
The signal x(n k) is equal to x(n) delayed by k steps
Example: x(n) ! x(n 3)

The signal x(n + k) is equal to x(n) advanced by k steps

Example: x(n) ! x(n + 2)
Simple Manipulations of DT Signals

Reflection (folding): x(n) ! x( n)

Simple Manipulations of DT Signals
Reflection and time-shifting
Example: x(n) ! x( n) ! x ( (n 2)) = x( n + 2)

Figure 2.1.10 from Proakis & Manolakis, 2007

 Simple Manipulations of DT Signals

Reflection and time-shifting do not commute!

Reflection (Time-shifting [x(n)]) 6= Time-shifting (Reflection [x(n)])

Example:

reflection time delay of 2 steps

x(n) ! x( n) ! x( n + 2)

time delay of 2 steps reflection

x(n) ! x(n 2) ! x( n 2)

Same original signals

Different results
Schedule: Laboratories
Matlab tutorials: January 23rd January 27th

4 Lab sessions:

Lab 1: January 30th February 3rd

Lab 2: February 13th February 17th
Lab 3: March 13th March 17th
Lab 4: March 27th March 31st

Reports are due one week after the lab session. Should be submitted to locker
# 206, 2nd floor of TEB