Control Systems/Realizations

RealizationEdit

Realization is the process of taking a mathematical model of a system (either in the Laplace domain or the State-Space domain), and creating a physical system. Some systems are not realizable.

An important point to keep in mind is that the Laplace domain representation, and the state-space representations are equivalent, and both representations describe the same physical systems. We want, therefore, a way to convert between the two representations, because each one is well suited for particular methods of analysis.

The state-space representation, for instance, is preferable when it comes time to move the system design from the drawing board to a constructed physical device. For that reason, we call the process of converting a system from the Laplace representation to the state-space representation "realization".

Realization ConditionsEdit

Note:
Discrete systems G(z) are also realizable if these conditions are satisfied.
• A transfer function G(s) is realizable if and only if the system can be described by a finite-dimensional state-space equation.
• (A B C D), an ordered set of the four system matrices, is called a realization of the system G(s). If the system can be expressed as such an ordered quadruple, the system is realizable.
• A system G is realizable if and only if the transfer matrix G(s) is a proper rational matrix. In other words, every entry in the matrix G(s) (only 1 for SISO systems) is a rational polynomial, and if the degree of the denominator is higher or equal to the degree of the numerator.

We've already covered the method for realizing a SISO system, the remainder of this chapter will talk about the general method of realizing a MIMO system.

Realizing the Transfer MatrixEdit

We can decompose a transfer matrix G(s) into a strictly proper transfer matrix:

${\displaystyle {\mathbf {G}}(s)={\mathbf {G}}(\infty )+{\mathbf {G}}_{sp}(s)}$

Where Gsp(s) is a strictly proper transfer matrix. Also, we can use this to find the value of our D matrix:

${\displaystyle D={\mathbf {G}}(\infty )}$

We can define d(s) to be the lowest common denominator polynomial of all the entries in G(s):

Remember, q is the number of inputs, p is the number of internal system states, and r is the number of outputs.
${\displaystyle d(s)=s^{r}+a_{1}s^{r-1}+\cdots +a_{r-1}s+a_{r}}$

Then we can define Gsp as:

${\displaystyle {\mathbf {G}}_{sp}(s)={\frac {1}{d(s)}}N(s)}$

Where

${\displaystyle N(s)=N_{1}s^{r-1}+\cdots +N_{r-1}s+N_{r}}$

And the Ni are p × q constant matrices.

If we remember our method for converting a transfer function to a state-space equation, we can follow the same general method, except that the new matrix A will be a block matrix, where each block is the size of the transfer matrix:

${\displaystyle A={\begin{bmatrix}-a_{1}I_{p}&-a_{2}I_{p}&\cdots &-a_{r-1}I_{p}&-a_{r}I_{p}\\I_{p}&0&\cdots &0&0\\0&I_{p}&\cdots &0&0\\\vdots &\vdots &\ddots &\vdots &\vdots \\0&0&\cdots &I_{p}&0\end{bmatrix}}}$
${\displaystyle B={\begin{bmatrix}I_{p}\\0\\0\\\vdots \\0\end{bmatrix}}}$
${\displaystyle C={\begin{bmatrix}I_{p}&0&0&\cdots &0\end{bmatrix}}}$