Realization (systems)

From testwiki
Jump to navigation Jump to search

In systems theory, a realization of a state space model is an implementation of a given input-output behavior. That is, given an input-output relationship, a realization is a quadruple of (time-varying) matrices [A(t),B(t),C(t),D(t)] such that

๐ฑห™(t)=A(t)๐ฑ(t)+B(t)๐ฎ(t)
๐ฒ(t)=C(t)๐ฑ(t)+D(t)๐ฎ(t)

with (u(t),y(t)) describing the input and output of the system at time t.

LTI System

For a linear time-invariant system specified by a transfer matrix, H(s), a realization is any quadruple of matrices (A,B,C,D) such that H(s)=C(sIโˆ’A)โˆ’1B+D.

Canonical realizations

Any given transfer function which is strictly proper can easily be transferred into state-space by the following approach (this example is for a 4-dimensional, single-input, single-output system)):

Given a transfer function, expand it to reveal all coefficients in both the numerator and denominator. This should result in the following form:

H(s)=n3s3+n2s2+n1s+n0s4+d3s3+d2s2+d1s+d0.

The coefficients can now be inserted directly into the state-space model by the following approach:

๐ฑห™(t)=[โˆ’d3โˆ’d2โˆ’d1โˆ’d0100001000010]๐ฑ(t)+[1000]๐ฎ(t)
๐ฒ(t)=[n3n2n1n0]๐ฑ(t).

This state-space realization is called controllable canonical form (also known as phase variable canonical form) because the resulting model is guaranteed to be controllable (i.e., because the control enters a chain of integrators, it has the ability to move every state).

The transfer function coefficients can also be used to construct another type of canonical form

๐ฑห™(t)=[โˆ’d3100โˆ’d2010โˆ’d1001โˆ’d0000]๐ฑ(t)+[n3n2n1n0]๐ฎ(t)
๐ฒ(t)=[1000]๐ฑ(t).

This state-space realization is called observable canonical form because the resulting model is guaranteed to be observable (i.e., because the output exits from a chain of integrators, every state has an effect on the output).

General System

D = 0

If we have an input u(t), an output y(t), and a weighting pattern T(t,ฯƒ) then a realization is any triple of matrices [A(t),B(t),C(t)] such that T(t,ฯƒ)=C(t)ฯ•(t,ฯƒ)B(ฯƒ) where ฯ• is the state-transition matrix associated with the realization.[1]

System identification

Template:Main System identification techniques take the experimental data from a system and output a realization. Such techniques can utilize both input and output data (e.g. eigensystem realization algorithm) or can only include the output data (e.g. frequency domain decomposition). Typically an input-output technique would be more accurate, but the input data is not always available.

See also

Template:Portal

References

Template:Reflist