This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 3. The following system can be described with both a recursive and non recursive difference equation. a. [ ] 0.25( [ ] [ 1] [ 2] [ 3]) y k u k u k u k u k = +++b. [ ] [ 1] 0.25( [ ] [ 4]) y k y k u k u k =+Which equation is recursive? a or b Which equation is the best to use? a or b Why? What condition must hold for a discretetime system in order for the system to be described by a difference equation? 4. Given F(s), find f ( t ) using the Laplace transform table. 5. Find y ( t ) using graphical convolution of u ( t) and h ( t ). Flip h ( t ). 6. Find y [ k ] using graphical convolution of u [ k ] and h [ k ]. Flip h [ k ]. 7. Use the sdomain to compute the transfer function of the circuit shown below. 8. Plot the poles of H(s) and sketch general behavior of the time response for each pole....
View
Full Document
 Fall '08
 ARAVENA
 Laplace, recursive difference equation, recursive difference equation.

Click to edit the document details