0% found this document useful (0 votes)
26 views

Monday: System Classification Z-Transform

This document discusses concepts related to discrete-time signals and digital control systems. It explains that discrete-time signals are represented by an index k representing the number of sampling periods, as opposed to continuous-time signals. Difference equations are used to model digital control systems, and can be solved recursively using information about the input and initial conditions. The document provides an example of solving for the zero-input and zero-state solutions of a difference equation, and combining them to find the complete solution.

Uploaded by

Sreenivas GS
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
26 views

Monday: System Classification Z-Transform

This document discusses concepts related to discrete-time signals and digital control systems. It explains that discrete-time signals are represented by an index k representing the number of sampling periods, as opposed to continuous-time signals. Difference equations are used to model digital control systems, and can be solved recursively using information about the input and initial conditions. The document provides an example of solving for the zero-input and zero-state solutions of a difference equation, and combining them to find the complete solution.

Uploaded by

Sreenivas GS
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

EE 784 Friday, January 25, 2013

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:

y(k+1) - a y(k) = b u(k)

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:

System classification Z-transform

You might also like