Final Formula Sheet

Download as pdf or txt
Download as pdf or txt
You are on page 1of 6

UNIVERSITY OF TORONTO

FACULTY OF APPLIED SCIENCE AND ENGINEERING


DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING
ECE216 - SIGNALS AND SYSTEMS
FINAL EXAMINATION
April 20, 2023

Examiner: Prof. R. Adve, Dr. S. Akbar, Prof. J. W. Simpson-Porco

FAMILY NAME

GIVEN NAME(S)

STUDENT NUMBER

Calculator Type: 2

Exam Type: A

Instructions

• There is a formula sheet at the end that you can take out and use.

• You are allowed to use a non-programmable calculator.

• Write your solutions clearly in the spaces provided below the problem statements.
Provide detailed steps for all your derivations and fully justify each answer.

• The exam duration is 2.5 hours.

• There are five problems in this exam.

Problem Mark
1 /20
2 /20
3 /20
4 /20
5 /14
Total: /94

Page 1 of 27
Formula Sheet

Basic Properties of Complex Numbers: If z = x + jy then


(
p p tan 1 (y/x) if x 0

z = x jy, ⇤ 2
|z| = zz = x + y ,2 \z =
tan 1 (y/x) +⇡ if x < 0

Euler Identities:
ej✓ + e j✓ ej✓ e j✓
ej✓ = cos ✓ + j sin ✓, cos ✓ = , sin ✓ = .
2 2j
Action, Energy, and Amplitude:
Z 1 Z 1
kxk1 = |x(t)| dt kxk22 = |x(t)|2 dt kxk1 = max |x(t)|
1 1 t2R
1
X 1
X
kxk1 = |x[n]| kxk22 = |x[n]|2 kxk1 = max |x[n]|
n2Z
n= 1 n= 1

(for periodic signals, restrict the sums and integrals above to cover only one period )

Even and Odd Components of a Signal:


x(t) + x( t) x(t) x( t)
xeven (t) = , xodd (t) = .
2 2
Impulse Function Sifting Formulae:
Z 1 1
X
x(t) = x(⌧ ) (t ⌧ ) d⌧, x[n] = x[k] [n k].
1 k= 1

Finite and Infinite Geometric Series:


n
X 1
X
k 1 rn+1 1
r = if r 6= 1. rk = if |r| < 1.
1 r 1 r
k=0 k=0

2⇡
Continuous-Time Fourier Series: For periodic x(t) with fundamental period T0 and !0 = T0

1
X Z T0 1
X
jk!0 t 1 jk!0 t 1 2
x(t) = ↵k e , ↵k = x(t)e dt, kxk2 = |↵k |2 .
T0 0 T0
k= 1 k= 1

2⇡
Discrete-Time Fourier Series: For periodic x[n] with fundamental period N0 and !0 = N0

NX
0 1 N0 1 NX
0 1
jk!0 n 1 X jk!0 n 1 2
x[n] = ↵k e , ↵k = x[n]e , kxk2 = |↵k |2 .
N0 N0
k=0 n=0 k=0

Continuous-Time Fourier Transform (CTFT):


Z 1 Z 1 Z 1
1 1
x(t) = X(j!)ej!t d!, X(j!) = x(t)e j!t
dt, kxk22 = |X(j!)|2 d!.
2⇡ 1 1 2⇡ 1

Page 23 of 27
Discrete-Time Fourier Transform (DTFT):
Z ⇡ 1
X Z ⇡
1 j! j!n j! j!n 1
x[n] = X(e )e d!, X(e ) = x[n]e , kxk22 = |X(ej! )|2 d!.
2⇡ ⇡ n= 1
2⇡ ⇡

Orthogonality Relationships for Complex Exponentials:


Z T0 ( NX
(
0 1
1 1 if k = ` 1 1 if k = ` + mN0 , m 2 Z
ej!0 (k `)t dt = ej!0 (k `)n =
T0 0 0 if k 6= ` N0 0 if k 6= `
n=0

System Properties: Let T be a CT system and let x⌧ denote a time shift of x.

Linearity T {c1 x1 + c2 x2 } = c1 T {x1 } + c2 T {x2 }

Time-Invariance If y = T {x}, then y⌧ = T {x⌧ } for all shifts ⌧

Causality y(t) = T {x}(t) depends only on {x(⌧ )}⌧ t

Memorylessness y(t) = T {x}(t) depends only on x(t)

Invertibility There is a system Tinv such that T {Tinv {x}} = Tinv {T {x}} = x

BIBO Stability There exists K 0 such that if x 2 L1 , then kT {x}k1  Kkxk1

Convolution:
Z 1 1
X
(h ⇤ x)(t) = h(t ⌧ )x(⌧ ) d⌧, (h ⇤ x)[n] = h[n k]x[k]
1 k= 1

Frequency Response of an LTI System:

If x(t) = ej!0 t If x[n] = ej!0 n


then y(t) = H(j!0 )ej!0 t then y[n] = H(ej!0 )ej!0 n
j!0 ))
= |H(j!0 )|ej(!0 t+\H(j!0 )) = |H(ej!0 )|ej(!0 n+\H(e

Page 24 of 27
Tables of Transformations

Properties of the CTFS


2⇡ 1
R T0 jk!0 t dt
x(t) has period T0 , !0 = T0 , and ↵k = T0 0 x(t)e
2⇡ 1
R T0 jk!0 t dt
y(t) has period T0 , !0 = T0 , and k = T0 0 y(t)e

Time-shift by t0 x(t t0 ) e j!0 kt0 ↵


k

Frequency-shift by k0 ej!0 k0 t x(t) ↵k k0

Conjugation x(t)⇤ ↵⇤ k

Time-reversal x( t) ↵ k

Di↵erentiation ẋ(t) (j!0 k)↵k


1
R T0
Convolution T0 0 x(⌧ )y(t ⌧ ) d⌧ ↵k k
P1
Multiplication x(t)y(t) `= 1 ↵` k `
1
Real Part Re{x(t)} 2 (↵k + ↵⇤ k )
1
Imag Part Im{x(t)} 2j (↵k ↵⇤ k )

Properties of the DTFS


2⇡ 1 P N0 1 jk!0 n
x[n] has period N0 , !0 = N0 , and ↵k = N0 n=0 x[n]e
2⇡ 1 P N0 1 jk!0 n
y[n] has period N0 , !0 = N0 , and k = N0 n=0 y[n]e

Time-shift by n0 x[n n0 ] e jk!0 n0 ↵


k

Frequency-shift by k0 ejk0 !0 n x[n] ↵k k0

Conjugation x[n]⇤ ↵⇤ k

Time-reversal x[ n] ↵ k

First-di↵erence x[n] x[n 1] (1 e jk!0 )↵


k

1 P N0 1
Convolution N0 m=0 x[m]y[n m] ↵k k
P N0 1
Multiplication x[n]y[n] `=0 ↵k ` `

1
Real Part Re{x[n]} 2 (↵k + ↵⇤ k )
1
Imag Part Im{x[n]} 2j (↵k ↵⇤ k )

Page 25 of 27
Properties of the CTFT / Useful CTFT Pairs
R1
x(t) has spectrum X(j!) = 1 x(t)e j!t dt, similar for y(t) and Y (j!)

Time Domain Frequency Domain

Time-shift by t0 x(t t0 ) e j!t0 X(j!)

Frequency-shift by !0 ej!0 t x(t) X(j(! !0 ))

Conjugation x(t)⇤ X( j!)⇤


1
Time-scaling x(at) |a| X(j!/a)

Di↵erentiation ẋ(t) (j!)X(j!)


R1
Convolution 1 x(⌧ )y(t ⌧ ) d⌧ X(j!)Y (j!)
1
R1
Multiplication x(t)y(t) 2⇡ 1 X(j⌫)Y (j(! ⌫)) d⌫
1
Real Part Re{x(t)} 2 (X(j!) + X( j!)⇤ )
1
Imag Part Im{x(t)} 2j (X(j!) X( j!)⇤ )

(t t0 ) e j!t0

ej!0 t 2⇡ (! !0 )
at u(t) 1
e with a > 0 j!+a
sin(⌧ !/2)
u(t + ⌧2 ) u(t ⌧
2) with ⌧ > 0 !/2
sin(at)
⇡t with a > 0 u(! + a) u(! a)

Properties of the Laplace Trans. / Useful Laplace Trans. Pairs


R1
x(t) is right-sided with L.T. X(s) = 0 x(t)e st dt

Time Domain Frequency Domain

Time-shift by t0 x(t t0 )u(t t0 ) e st0 X(s)

Derivative ẋ(t) sX(s)

Second Derivative ẍ(t) s2 X(s)

(t) 1

u(t) 1/s

eat u(t) with a 2 R 1/(s a)

tn u(t) n!/sn+1

sin(!0 t)u(t) with !0 2 R !0 /(s2 + !02 )

Page 26 of 27
Properties of the DTFT / Useful DTFT Pairs
P
x[n] has spectrum X(ej! ) = 1 n= 1 x[n]e
j!n

P
y[n] has spectrum Y (ej! ) = 1n= 1 y[n]e
j!n

Time Domain Frequency Domain

Time-shift by n0 x[n n0 ] e j!n0 X(ej! )

Frequency-shift by !0 ej!0 n x[n] X(ej(! !0 ) )

Conjugation x[n]⇤ X(e j! )⇤

Time-reversal x[ n] X(e j! )

First di↵erence x[n] x[n 1] (1 e j! )X(ej! )

P1
Convolution m= 1 x[m]y[n m] X(ej! )Y (ej! )
1
R1 j⌫ )Y
Multiplication x[n]y[n] 2⇡ 1 X(e (ej(! ⌫) ) d⌫

1 j! j! )⇤ )
Real Part Re{x[n]} 2 (X(e ) + X(e
1 j! j! )⇤ )
Imag Part Im{x[n]} 2j (X(e ) X(e

[n n0 ] e j!n0

P1
ej!0 n 2⇡ k= 1 (! !0 2⇡k)
1
an u[n] with |a| < 1 1 ae j!

Page 27 of 27

You might also like