Monday: System Classification Z-Transform
Monday: System Classification Z-Transform
Continuous-time signals: real time Sampled-data signals: periodic measurements. Sampling period, T. Discrete-time: k is an index representing the number of sampling periods. Digital control: efficient computation and implementation. Difference Equations: Solved recursively using information about the forcing function, i.e., system input, u(k) and a sufficient number of boundary conditions. An nth. Order equation requires n boundary (initial) conditions. Linearity: superposition applies. Example:
The solution depends on two things; the input u(k) and the initial condition, ( ) First consider the zero-input solution by setting u(k)= 0. This part of the solution is the result of the initial condition
only. Then, assume the initial condition is zero, ( ) and find the solution based on the input only. This part is known as the zero-state solution. Finally, add the two solutions to obtain the complete solution that would result when both the input and the initial condition are acting together. Zero-input solution: y(k+1) - a y(k) = 0 y(k+1) = a y(k) y(1) = a y(0) y(2) = a y(1) = a2 y(0) y(3) = a y(2) = a3 y(0) . . . y(i) = a y(i-1) = ai y(0) Zero-state solution: Set y(0)=0 y(k+1) = a y(k) + b u(k) y(1) = a y(0) + b u(0)=b u(0) Continue recursively to obtain a formula for the general solution y(i) in terms of u(i), a and b.
Monday: