EE3160 FALL 2010 USEFUL FORMULAS

rect(t) tri(t)
Height = 1 1 Height = 1 1
sin(πx) Area = 1 Area = 1
Definitions: sinc(x) =
πx Width = 1
t
Width = 2
t
−0.5 0.5 −1 1
Z
Signal Energy E= x2 (t) dt for three pulse shapes x(t) shown below

Rectangular Half-Cycle Triangular

A Pulse A Sinusoid A Pulse
E = A2 b E = A 2b / 2 E = A2 b / 3
b b b
Z ∞ Z ∞ Z ∞
Sifting Integral: x(t)δ(t−α) dt = x(α) Convolution: y(t) = x(τ )h(t−τ ) dτ = x(t−τ )h(τ ) dτ
−∞ −∞ −∞

δ(t) ? x(t) = x(t) u(t) ? u(t) = r(t) rect(t) ? rect(t) = tri(t) e−αt u(t) ? e−αt u(t) = te−αt u(t)

Z ∞ Z ∞
−j2πf t
FOURIER TRANSFORM: x(t) ⇐ ft ⇒ X(f ) X(f ) = x(t)e dt x(t) = X(f )ej2πf t df
−∞ −∞

δ (t) rect(t)
1
(1) e −α t 1
1 sinc (f)
α + j 2π f
t t t
-0.5 0.5

1
sinc2 (t) ⇐ ft ⇒ tri(f ) tri(t) ⇐ ft ⇒ sinc2 (f ) te−αt ⇐ ft ⇒
(α + j2πf )2

1
FT Properties Scale: x(αt) ⇐ ft ⇒ X(f /α) Shift: x(t − α) ⇐ ft ⇒ X(f )e−j2πf α
|α|

X(f + f0 ) + X(f − f0 )
Derivative: x0 (t) ⇐ ft ⇒ j2πf X(f ) Modulation: x(t) cos(2πf0 t) ⇐ ft ⇒
2

Convolution: x(t) ? h(t) ⇐ ft ⇒ X(f )H(f ) Multiplication: x1 (t)x2 (t) ⇐ ft ⇒ X1 (f ) ? X2 (f )

Z ∞ Z ∞
¯ ¯
Central Ordinates: x(t)¯t=0 = x(0) = X(f ) df X(f )¯f =0 = X(0) = x(t) dt
−∞ −∞

Z ∞ Z ∞
2
Signal Energy = x (t) dt = |X(f )|2 df (|X(f )| is magnitude spectrum)
−∞ −∞

∞
X ∞
X
FOURIER SERIES: xp (t) = Dk ej2πkf0 t = D0 + 2|Dk | cos(2πkf0 t+θk ) (where Dk = |Dk |ejθk )
k=−∞ k=1

1 ¯
FS Coefficients: X[k] = Dk = X1 (f )¯f =kf0 (where X1 (f ) is the Fourier transform of one period)
T
The k-th harmonic of xp (t) is 2|Dk | cos(2πkf0 t + θk ) or 2|X[k]| cos(2πkf0 t + θk ).
Z X∞ ∞
X
1 T 2
Signal Power = xp (t) dt = |Dk |2 = |X[k]|2 (|..|2 means magnitude squared)
T 0
k=−∞ k=−∞

c
°Ashok Ambardar, Fall 2010 1
 LAPLACE TRANSFORMS and PROPERTIES
1 1 1
δ(t) ⇐ lt ⇒ 1 u(t) ⇐ lt ⇒ tu(t) ⇐ lt ⇒ e−αt u(t) ⇐ lt ⇒
s s2 s+α
1 s ω
te−αt u(t) ⇐ lt ⇒ cos(ωt)u(t) ⇐ lt ⇒ sin(ωt)u(t) ⇐ lt ⇒
(s + α)2 s2 + ω 2 s2 + ω 2
dX(s)
y(t − α) ⇐⇒ e−αs Y (s) e−αt y(t) ⇐⇒ Y (s + α) tx(t) ⇐⇒ − y 0 (t) ⇐⇒ sY (s) − y(0)
ds
Kejθ Ke−jθ
Inverse LT (complex roots): 2Ke−αt cos(βt − θ)u(t) ⇐ lt ⇒ +
s + α + jβ s + α − jβ

STATE EQUATIONS
P
Pk ∆k
Mason’s Gain Formula: Transfer Function =
∆
Here, ∆ is the graph determinant and
∆ = 1 − (sum of all loop gains)
+ (sum of loop-gain products for all nontouching loop pairs)
− (sum of loop-gain products for all nontouching loop triples) etc.
Pk = gain of kth forward path
∆k = determinant after removing nodes in the kth forward path.

State equations in matrix form:

q̇ = Aq + Bx
y = Cq + Dx

Matrix solution for the states (Note: Φ(s) = (sI − A)−1 is the State Transition Matrix):

Q(s) = (sI − A)−1 q(0) + (sI − A)−1 BX(s) = Φ(s)q(0) + Φ(s)BX(s)

Matrix solution for the outputs:

Y(s) = CQ(s) + DX(s)

Matrix solution of DISCRETE state equations by Forward Euler algorithm:

q(k + 1) = (I + AT )q(k) + T Bx(k) where T is the time-step

Matrix solution of DISCRETE state equations by Backward Euler algorithm:

· ¸
−1
q(k + 1) = (I − AT ) T Bx(k + 1) + q(k) where T is the time-step

USEFUL DEFINITE INTEGRALS

Z ∞ Z ∞ Z K ³ Kβ ´
1 1 1
e−αx dx = sinc(x) dx = 1 2 2 2
dx = tan−1
0 α −∞ 0 α +β x αβ α

2 c
°Ashok Ambardar, Fall 2010