


Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Material Type: Notes; Class: Linear System Analysis II; Subject: Electrical and Computer Engineering; University: Colorado State University; Term: Spring 2008;
Typology: Study notes
1 / 4
This page cannot be seen from the preview
Don't miss anything!



Test is 2 hr. open book, open notes; Calculator (no computer) Allowed. Exam is Comprehensive (material from entire semester).
NOTE: SHOW YOUR WORK! BOX ALL ANSWERS! EXPRESS ALL LAPLACE, Z- AND FOURIER TRANSFORMS AND TRANSFER FUNCTIONS AS RATIONAL POLYNOMIALS!
REVIEW (Post Mid-term) (We will fill out missing info in class)
Z Transform -One sided
n n
f n Z^ F z Z f n f nz −
∞
=
0
Directly from definition (sum geometric series)
S = 1 + a + a^2 + ... + an^ = a
a a
n k n
k −
=
0
IF |a| <1, S = 1 + a + a^2 + ... = a
ak k −
∞
= 1
0
Thus z a
z a n Z −
←→ (Pole Locations)
∞
=−∞
k
x [ k ] y [ n k ]
-IVT: lim F ( z ) z →∞
-FVT: ( )
lim 1 F z z
z z
→ IF (z-1)F(z) has NO poles in |z| ≥ 1
F ( z )
. Use tables
LTI System Representation
ODE: Solve for y[n] y[n] – 0.9y[n-1] = 0.1x[n] Implicit Time Domain Non-zero I.C.s
TF: Y(z) = H(z)X(z) H(z) =
− −^1 = z −
z z Explicit Time Domain Zero I.C.s
IR: y[n] = h[n]*x[n] h[n] = 0.1(0.9)n, n ≥ 0 Explicit Time Domain 0 n < 0 Zero I.C.s
System Properties: Memory (IIR/FIR) Causality (Proper) Stability (no poles in |z| ≥ 1) Invertibility (bi-proper)
Bilateral Z Transform
Fb(z) = Zb(f[n]) = n n
f n z −
∞
=−∞
f[n] ↔ Fb(z) & ROC
left-sided
right-sided
two-sided
inverse formula
Sampling Process
x(t) x[n] xp(t)
x(t) xs(t) xp(t) Impulse Modulator
Discrete Fourier Transform
X[k] = DF(X[n]) = N
j N
kn N
N
n
N
n
N j kn xne xnW W e
π 1 2 π
0
1
0
2 [ ] [ ]
− −
=
−
=
−
x[n] = DF-1(X[k]) = N
k xnW N
kn N
N
n
0
−
=
x[n] ↔ X[k]
k T
x nW N
kn N
N
n
0
−
=
kf NT
k f = = s