10/08 - Mechanics of Convolution & Fourier Transform: Difference between revisions
Jump to navigation
Jump to search
Line 66: | Line 66: | ||
===Example 2=== |
===Example 2=== |
||
<math> \overbrace{[u(t)-u(t-1)]}^{x(t)}*\overbrace{[u(t-1)-u(t-3)]}^{h(t)} = |
<math> \overbrace{[u(t)-u(t-1)]}^{x(t)}*\overbrace{[u(t-1)-u(t-3)]}^{h(t)} = |
||
\begin{cases} |
|||
\begin{cases} n/2, & \mbox{if }n\mbox{ is even} \\ 3n+1, & \mbox{if }n\mbox{ is odd} \end{cases} |
|||
0, & t \le 1 \\ |
|||
</math> |
|||
\int_{0}^{t-1} 1 \cdot 2 \,d\lambda, & 1 \le t \le 2\\ |
|||
\int_{}^{3} , & \\ |
|||
\int_{}^{} , & \\ |
|||
0, & t > 4 \\ |
|||
\end{cases}</math> |
|||
*If <math> u(t) \,\!</math> isn't involved, then you can plug n chug with the integral. The u(t) will change the limits, which can be impractical to evaulate if you have more than 2. |
*If <math> u(t) \,\!</math> isn't involved, then you can plug n chug with the integral. The u(t) will change the limits, which can be impractical to evaulate if you have more than 2. |
||
[[Image:Oct8.PNG]] |
[[Image:Oct8.PNG]] |
Revision as of 01:08, 17 November 2008
Mechanics of the Convolution
Remember from the game:
Input | LTI System | Output | Reason |
Given | |||
Time Invarience | |||
Proportionality | |||
Superposition |
We will also denote the convolution as
Communative Property
Let thus | ||
The order of integration switched due to changing from | ||
Example 1
Example 2
- If isn't involved, then you can plug n chug with the integral. The u(t) will change the limits, which can be impractical to evaulate if you have more than 2.
Convolution: A visual approach
- Flip: Flip one about the dependant axis
- Shift: The initial flipped function is at . Shift this function for the multiply & integrate
- Multiply: Multiply the two functions
- Add/Integrate: You may need to make multiple equations for different intersections