EEE203: Signals and Systems I

Midterm
Review Session
Fall 2024 (Session B)

1

 Exam Date and Guidelines

Time: 110 minutes

Date: Due November 11th

The midterm is closed book and closed notes. You may use one 8.5"x11" cheat sheet (front and
back, typed or hand-written), 20 pages of blank scratch paper, a hand-held or canvas browser
built-in calculator (top right) during the exam. You may be absent from the front of the camera for
at most five minutes for restroom breaks. Please use Chrome as the web browser.

2

 Module 1:
Introduction

3

 Formulas to Know
Trigonometry
sin2 θ + cos2 θ = 1

( 2)
π
1 sin θ + = cos θ
Euler’s Formula
(e + e )
θ −θ
cos θ =
2
e θ = cos θ + sin θ 1
sin θ = (e θ − e − θ)
2

Geometric Series
N

{ }
k1 − α N+1
∑
α = ⇐ α ≠ 1,N ⇐ α = 1
k=0
1 − α
(Finite series)
∞
1
αk =
∑
⇐ |α| < 1
k=0
1−α
(Infinite series)
𝚥
4
𝚥
𝚥
𝚥
𝚥
𝚥
𝚥

 Discrete vs. Continuous Signals

A continuous signal x(t) is defined

for all values of t – there are an
infinite number of points along any
interval of this function. These come
from real, physical systems.

Ex: Volume of a tank.

A discrete signal x[n] is defined for

integer values of n – there are a
quantized number of points along
this function. For example, x[1.5]
does not exist.

Ex: Movie tickets sold per day.

5

 Energy and Power
Energy (CT)
t2

∫t
E= | x(t) |2 dt Power (CT)
1

1 T
T→∞ 2T ∫−T
∞ Average power is
| x(t) |2 dt
∫−∞
E∞ = | x(t) |2 dt (Total) the signal’s energy P∞ = lim
divided by the
interval length.

Energy (DT) Power (DT)

n2
| x[n] |2
∑
E=
N
n=n1 1
| x[n] |2
N→∞ 2N + 1 ∑
P∞ = lim
∞ n=−N
| x[n] |2 (Total)
∑
E∞ =
n=−∞

6

 Unit Step Function u(t), u[n]

The unit step is a very useful function in

describing signals.
It as defined as:

u(t) = 1 for t > 0 u[n] = 1 for n

= 0,1,2,…
u(t) = 0 for t < 0 u[n] = 0 for n
= -1,-2,…
undefined at t = 0
u(t) u[n]

1 1

t n

-3 -2 -1 1 2 3 -3 -2 -1 1 2 3

7

 Signal Transformation

Time Reversal Time Shift

8

 Signal Transformation cont.

Scaling

*Coefficients in front of t cause horizontal stretching/

compressing. Vertical scaling only results from
multiplying x(t), e.g. 0.5x(t).

9

 Signal Transformation Ex. 1

( 3 )
1
x 1− t =?

10

 Signal Transformation Ex. 1

( 3 )
1
x 1− t =?

( 3 )
1
Rewrite: x − (t − 3)

11

 Signal Transformation Ex. 2
x[n] = u[n − 2] − u[n − 4]

x[−n − 3] = ?

12

 Signal Transformation Ex. 2
x[n] = u[n − 2] − u[n − 4]

x[−n − 3] = ?

n−3=0
n=3
Shift right by 3

Time Reversal

x[−n − 3] = u[n + 6] − u[n + 4]

13

 Periodicity: Continuous Time

The fundamental period T0 is the least

common multiple of all terms’ periods
T1, …, Tn.

14

 Periodicity: Discrete Time

15

 Impulse/Delta Function δ(t), δ[n]

{0, n ≠ 0.
du(t) 1, n = 0
δ(t) = δ[n] =
dt

∫−∞
δ(t)dt = 1 δ[n] = u[n] − u[n − 1]

16

 Impulse Sampling / Sifting

∞
x(t)δ(t − t0) = x(t0)δ(t − t0)
∑
x[n] = x[k]δ[n − k]
k=−∞

x[n]δ[n − n0] = x[n0]δ[n − n0] The sifting property demonstrates that

a discrete signal is a weighted sum of
impulses.
Remember these!

x[2]δ[n-2]

Example of sampling.

17

 Series, Parallel, and Feedback Connections

18

 System Properties

Memory – y(t) only depends on input x(t) at time t.

Ex: y(t) = 3x(t) memoryless

y(t) = 6x(t-3) not memoryless
Causality – y(t) only depends on past or present x(t) values.

Ex: y(t) = x(t-5) + x(t) causal

y(t) = x(-t) + x(t+2) not causal

Linearity – T{ ax1(t) + bx2(t) } = T{ax1(t)} + T{bx2(t)}, where T

is some system such that T{x(t)} = y(t).

Ex: y(t) = x(t)cos(wt)is this linear? let x(t) = ax1(t) + bx2(t).

T{ ax1(t) + bx2(t) } = cos(wt)(ax1(t) + bx2(t))

= cos(wt)ax1(t) + cos(wt)bx2(t))
= T{ax1(t)} + T{bx2(t)} yes, this
is linear. 19

 Signal Characteristics cont.

Time Invariance – When input x(t) is shifted by some

amount, output y(t) is shifted by same amount.
T{x(t-t0)} = y(t-t0).

Ex: y(t) = 5x(t) + 4x(t-3) TI

y[n] = nx[0.5n+1] not TI

Invertibility – When the order of a system can be

reversed and still yield the
same output y(t).

Superposition – If x[n]  y[n], then a sum of x[n] 

a sum of y[n].

x1[n] + x2[n] + … + xn[n]  y1[n] + y2[n] + … + yn[n]

20

 Module 2:
LTI Systems

21

 DT Convolution

22

 DT Convolution Example

Given the following LTI system,

find y[n] when the input x[n] = u[n].

23

 CT Convolution

CT Convolution problem methodology:

1. Plot x(τ).
2. Plot h(t-τ) by reversing and shifting h(t).
3. Draw each region of overlap.
4. Compute the convolution integral for each region.

24

 CT Convolution Example

x(t) = e −atu(t)
h(t) = u(t) − u(t − 2)
Find y(t)

25

 26

 CT Convolution Example

x(t) = e −atu(t)
h(t) = u(t) − u(t − 2)
Find y(t)

27

 CT Convolution Example cont.

28

 LTI System Properties

Commutative Property: Associative Property:

Distributive Property:

29

 LTI System Properties cont.

LTI Memory:

LTI Invertibility:

This is an example of an invertible LTI system.

LTI Causality:

h(t) = 0 for t < 0

h[n] = 0 for n < 0

30

 Module 3:
Fourier
Series

31

 Fourier Series fundamental idea:

All periodic functions can be broken down into a sum of sinusoids /

complex exponentials.

32

 Complex Exponential System Response

33

 Complex Exponential Form of CT Signal

Sum of harmonic
exponential
components…
where each
component has a
Fourier coefficient ak.

34

 Computing the Fourier Series of LTI System

Given a periodic signal x(t), how do we

calculate y(t)?

1. Find coefficients ak, put signal x(t)

into form:

2. Find:

3: Put together:
Note: a-k is the complex conjugate of ak.

Given ak = c +jd,
a-k = ak* = c - jd.

Keep this in mind when finding Fourier coefficients. ak = a-k only when ak is a real number!
35

 CT Fourier Series Example

( t ) ( 3 )
2π 4π
(e + e ) (e − e )
1 1 θ −θ
x(t) = 2 + cos + 2 sin cos(θ) = θ −θ sin(θ) = 2
2

h(t) = e −tu(t) ∞
H( ω) = ∫−∞ h(t)e − ωt dt
y(t) = ? ∞
y(t) = ∫−∞ ak H( kω0)e kω0t

36
𝚥
𝚥
𝚥
𝚥
𝚥
𝚥
𝚥
𝚥
𝚥

 37

 CT Fourier Series Example

38

 CT Fourier Series Example cont.

39

 Complex Exponential Form of DT Signal

Sum of harmonic
exponential
components…
where each
component has a
Fourier coefficient ak.

40

 DT Fourier Series Example

41

 DT Fourier Series Example

42

 Fourier Analysis vs. Synthesis

Analysis: Starting with a signal x(t), we decompose it into a sum of complex exponentials.

x(t) 

Synthesis: Starting with a sum of complex exponentials, we reconstruct the signal x(t).

 x(t)

43

 Parseval’s Relation

∞
1
T ∫T
| x(t) |2 dt = | ak |2
∑ Another proof of conservation of energy:
k=−∞ The energy of a signal in the time
domain is equal to the energy of that
signal in the frequency domain.

More abstractly, the sum of the square of

1 the signal’s transform is equivalent to the
| x[n] |2 = | ak |2
∑ ∑
sum of the square of the signal itself.
N n=<N> k=<N>

44

 Thank you!
Questions?
Email: jhawley4@asu.edu

Make sure you understand everything on your Module

1, 2, and 3 Key Concept sheets. The Midterm Review is
a great resource for summing it up and there is a
practice exam to see how well prepared you are.

45