1/14
Looks like no tags are added yet.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai | Chat |
|---|
No analytics yet
Send a link to your students to track their progress
cos²(t) = ?
cos2(t)=21+cos(2t)
Steps to find impulse response of LCCDifferenceE
Write in advance form
Get constants bN and aN from x[n] and y[n] respectively
Find roots using characteristic equation of homogeneous part
Construct yh[n] with Cs
Write in delay form
solve for y[n] on its own on the left
Find y[0], y[1], etc (until n = N - 1) using x[n] = δ[n] and y[n] = h[n] and initial rest
Determine C values with determined initial conditions on the homogenous solution
plug everything into formula for h[n]
Steps to find impulse response of LCCDifferentialE
Find bN IF N = M
Write in terms of Q(D) and P(D)
Calculate roots from Q(D) characteristic equation
construct y_{h}\left(t\righ)using roots and unknown C_ivalues</p></li><li><p>Usestandardinitialrestconditionsofy[0]=1OR0for1stor2ndorderand\frac{dy(0)}{\differentialD t}=1forsecondorderappliedtothehomogeneoussolutiontodetermineC_ivalues</p></li><li><p>plugvaluesofb_N,y_h(t)$$ , and P(D) into formula
What to write for memory/memoryless?
Memoryless means the output at time t depends only on the input at the same instant, t, and not on any input at a time before the current time
What to show to determine if a system is bounded?
Show that if the absolute value of the input is bounded (∣x(t)∣<B) then the output is also bounded (∣y(t)∣<1+B)
steps to show linearity
Define inputs x1(t) , x2(t) , and x3(t)=ax1(t)+bx2(t)
Plug all three inputs into y(t) to get y1(t),y2(t),y3(t)
Check for y3(t)=ay1(t)+by2(t)
True = Linear
False = Not Linear
Steps to show time-invariance
Time delay the input - x(t)⟶x(t−t0)
i.e. replace only the t in x(t) with t−t0
Time delay the original output - y(t)⟶y(t−t0)
i.e. replace all t⟶t−t0
Compare to each other
if equal, time invariant
if not equal, not time invariant
What to write for causal?
The output at time t depends only on inputs at or before time t, and not on inputs at times after t (future times)
What is convolution? (description)
Convolution is a mathematical method for determining the output of a system by taking the integral or sum of the input combined with the system’s impulse response. It essentially breaks down a complex input into many shifted and scaled impulses to determine the output with any arbitrary input (not just delta impulse as the input).
The system must be:
linear
time invariant
causal
How to show if is system is invertible?
solve for x[n] explicitly
verify that the solution holds for ALL n
How to perform CT convolution of two functions with GRAPHICAL METHOD
graph both functions separately
choose one for t⟶τ and one for t⟶−τ+t
graph new functions with respect to Tau
combine the two into one graph by sliding the xi(t−τ) function across x(τ)
use the definition of convolution to find the solutions for all significant intervals by integration of the multiplication of the two function with respect to Tau
The definition being x1(t)∗x2(t)=∫0∞x1(τ)⋅x2(t−τ)dτ
How to perform CT convolution with the table
Use properties of convolution to organize the convolution of the two functions in a form that is on the table
linearity allows for convolution distribution
time shifting of the functions is allowed
Substitute the solution from the table into the x1(t)∗x2(t) equation
How to perform CT convolution with just the definition
Identify one function as x(t)⟶x(τ) and one as x2(t)⟶x(t−τ)
Multiply the functions and perform the integration as the definition of convolution describes
How to perform DT convolution with the graphical method
plot both functions
set one function to be x[k] and one to be h[k]
flip h[k] ==> h[-k]
shift h[-k] by n ==> h[n - k]
plot the new functions in terms of k
multiply overlapping values
sum overlapping values to get y[n]
repeat for each relevant value of n
plot the final y[n]
How to perform DT convolution with the definition
set one function to be x[k] and one to be h[k]
flip h[k] ==> h[-k]
shift h[-k] by n ==> h[n - k]
substitute the two functions into the definition of DT convolution
identify relevant interval of k for which the product of both functions is non-zero, ignore the rest of sum over k
sum the product of the functions over k
repeat for each relevant value of n