# Control Systems/Digital State Space

| The Wikibook of: Control Systems and Control Engineering | Table of Contents | All Versions | PDF Version |
| The Wikibook of: Control Systems and Control Engineering | ← Time Variant System Solutions | Eigenvalues and Eigenvectors → | Glossary |

## Digital Systems

Digital systems, expressed previously as difference equations or Z-Transform transfer functions, can also be used with the state-space representation. All the same techniques for dealing with analog systems can be applied to digital systems with only minor changes.

## Digital Systems

For digital systems, we can write similar equations using discrete data sets:
    $x[k+1]=Ax[k]+Bu[k]$
    $y[k]=Cx[k]+Du[k]$

### Zero-Order Hold Derivation

If we have a continuous-time state equation:
    $x'(t)=Ax(t)+Bu(t)$
We can derive the digital version of this equation that we discussed above. We take the Laplace transform of our equation:
    $X(s)=(sI-A)^{-1}Bu(s)+(sI-A)^{-1}x(0)$
Now, taking the inverse Laplace transform gives us our time-domain system, keeping in mind that the inverse Laplace transform of the (sI - A) term is our state-transition matrix, Φ:
    $x(t)={\mathcal {L}}^{-1}(X(s))=\Phi (t-t_{0})x(0)+\int _{t_{0}}^{t}\Phi (t-\tau )Bu(\tau )d\tau$
Now, we apply a zero-order hold on our input, to make the system digital. Notice that we set our start time t$_0$ = kT, because we are only interested in the behavior of our system during a single sample period:
    $u(t)=u(kT),kT\leq t\leq (k+1)T$
    $x(t)=\Phi (t,kT)x(kT)+\int _{kT}^{t}\Phi (t,\tau )Bd\tau u(kT)$
We were able to remove u(kT) from the integral because it did not rely on τ. We now define a new function, Γ, as follows:
    $\Gamma (t,t_{0})=\int _{t_{0}}^{t}\Phi (t,\tau )Bd\tau$
Inserting this new expression into our equation, and setting t = (k + 1)T gives us:
    $x((k+1)T)=\Phi ((k+1)T,kT)x(kT)+\Gamma ((k+1)T,kT)u(kT)$
Now Φ(T) and Γ(T) are constant matrices, and we can give them new names. The d subscript denotes that they are digital versions of the coefficient matrices:
    $A_{d}=\Phi ((k+1)T,kT)$
    $B_{d}=\Gamma ((k+1)T,kT)$
We can use these values in our state equation, converting to our bracket notation instead:
    $x[k+1]=A_{d}x[k]+B_{d}u[k]$

## Relating Continuous and Discrete Systems

Continuous and discrete systems that perform similarly can be related together through a set of relationships. It should come as no surprise that a discrete system and a continuous system will have different characteristics and different coefficient matrices. If we consider that a discrete system is the same as a continuous system, except that it is sampled with a sampling time T, then the relationships below will hold. The process of converting an analog system for use with digital hardware is called discretization. We've given a basic introduction to discretization already, but we will discuss it in more detail here.

### Discrete Coefficient Matrices

Of primary importance in discretization is the computation of the associated coefficient matrices from the continuous-time counterparts. If we have the continuous system (A, B, C, D), we can use the relationship t = kT to transform the state-space solution into a sampled system:
    $x(kT)=e^{AkT}x(0)+\int _{0}^{kT}e^{A(kT-\tau )}Bu(\tau )d\tau$
    $x[k]=e^{AkT}x[0]+\int _{0}^{kT}e^{A(kT-\tau )}Bu(\tau )d\tau$
Now, if we want to analyze the k+1 term, we can solve the equation again:
    $x[k+1]=e^{A(k+1)T}x[0]+\int _{0}^{(k+1)T}e^{A((k+1)T-\tau )}Bu(\tau )d\tau$
Separating out the variables, and breaking the integral into two parts gives us:
    $x[k+1]=e^{AT}e^{AkT}x[0]+\int _{0}^{kT}e^{AT}e^{A(kT-\tau )}Bu(\tau )d\tau +\int _{kT}^{(k+1)T}e^{A(kT+T-\tau )}Bu(\tau )d\tau$
If we substitute in a new variable β = (k + 1)T + τ, and if we see the following relationship:
    $e^{AkT}x[0]=x[k]$
We get our final result:
    $x[k+1]=e^{AT}x[k]+\left(\int _{0}^{T}e^{A\alpha }d\alpha \right)Bu[k]$
Comparing this equation to our regular solution gives us a set of relationships for converting the continuous-time system into a discrete-time system. Here, we will use "d" subscripts to denote the system matrices of a discrete system, and we will use a "c" subscript to denote the system matrices of a continuous system.
Matrix Dimensions: A: p × p B: p × q C: r × p D: r × q
    $A_{d}=e^{A_{c}T}$ $B_{d}=\int _{0}^{T}e^{A_{c}\tau }d\tau B_{c}$ $C_{d}=C_{c}$ $D_{d}=D_{c}$
If the A$_c$ matrix is nonsingular, then we can find its inverse and instead define B$_d$ as:
    $B_{d}=A_{c}^{-1}(A_{d}-I)B_{c}$
The differences in the discrete and continuous matrices are due to the fact that the underlying equations that describe our systems are different. Continuous-time systems are represented by linear differential equations, while the digital systems are described by difference equations. High order terms in a difference equation are delayed copies of the signals, while high order terms in the differential equations are derivatives of the analog signal.
If we have a complicated analog system, and we would like to implement that system in a digital computer, we can use the above transformations to make our matrices conform to the new paradigm.

### Notation

Because the coefficient matrices for the discrete systems are computed differently from the continuous-time coefficient matrices, and because the matrices technically represent different things, it is not uncommon in the literature to denote these matrices with different variables. For instance, the following variables are used in place of A and B frequently:
    $\Omega =A_{d}$
    $R=B_{d}$
These substitutions would give us a system defined by the ordered quadruple (Ω, R, C, D) for representing our equations.
As a matter of notational convenience, we will use the letters A and B to represent these matrices throughout the rest of this book.

## Converting Difference Equations

Now, let's say that we have a 3rd order difference equation, that describes a discrete-time system:
    $y[n+3]+a_{2}y[n+2]+a_{1}y[n+1]+a_{0}y[n]=u[n]$
From here, we can define a set of discrete state variables x in the following manner:
    $x_{1}[n]=y[n]$
    $x_{2}[n]=y[n+1]$
    $x_{3}[n]=y[n+2]$
Which in turn gives us 3 first-order difference equations:
    $x_{1}[n+1]=y[n+1]=x_{2}[n]$
    $x_{2}[n+1]=y[n+2]=x_{3}[n]$
    $x_{3}[n+1]=y[n+3]$
Again, we say that matrix x is a vertical vector of the 3 state variables we have defined, and we can write our state equation in the same form as if it were a continuous-time system:
    $x[n+1]={\begin{bmatrix}0&1&0\\0&0&1\\-a_{0}&-a_{1}&-a_{2}\end{bmatrix}}x[n]+{\begin{bmatrix}0\\0\\1\end{bmatrix}}u[n]$
    $y[n]={\begin{bmatrix}1&0&0\end{bmatrix}}x[n]$

## Solving for x[n]

We can find a general time-invariant solution for the discrete time difference equations. Let us start working up a pattern. We know the discrete state equation:
    $x[n+1]=Ax[n]+Bu[n]$
Starting from time n = 0, we can start to create a pattern:
    $x[1]=Ax[0]+Bu[0]$
    $x[2]=Ax[1]+Bu[1]=A^{2}x[0]+ABu[0]+Bu[1]$
    $x[3]=Ax[2]+Bu[2]=A^{3}x[0]+A^{2}Bu[0]+ABu[1]+Bu[2]$
With a little algebraic trickery, we can reduce this pattern to a single equation:
[General State Equation Solution]
    $x[n]=A^{n}x[n_{0}]+\sum _{m=0}^{n-1}A^{n-1-m}Bu[m]$
Substituting this result into the output equation gives us:
[General Output Equation Solution]
    $y[n]=CA^{n}x[n_{0}]+\sum _{m=0}^{n-1}CA^{n-1-m}Bu[m]+Du[n]$

## Time Variant Solutions

If the system is time-variant, we have a general solution that is similar to the continuous-time case:
    $x[n]=\phi [n,n_{0}]x[n_{0}]+\sum _{m=n_{0}}^{n-1}\phi [n,m+1]B[m]u[m]$
    $y[n]=C[n]\phi [n,n_{0}]x[n_{0}]+C[n]\sum _{m=n_{0}}^{n-1}\phi [n,m+1]B[m]u[m]+D[n]u[n]$
Where φ, the state transition matrix, is defined in a similar manner to the state-transition matrix in the continuous case. However, some of the properties in the discrete time are different. For instance, the inverse of the state-transition matrix does not need to exist, and in many systems it does not exist.

### State Transition Matrix

The discrete time state transition matrix is the unique solution of the equation:
    $\phi [k+1,k_{0}]=A[k]\phi [k,k_{0}]$
Where the following restriction must hold:
    $\phi [k_{0},k_{0}]=I$
From this definition, an obvious way to calculate this state transition matrix presents itself:
    $\phi [k,k_{0}]=A[k-1]A[k-2]A[k-3]\cdots A[k_{0}]$
Or,
    $\phi [k,k_{0}]=\prod _{m=1}^{k-k_{0}}A[k-m]$

## MATLAB Calculations

MATLAB is a computer program, and therefore calculates all systems using digital methods. The MATLAB function lsim is used to simulate a continuous system with a specified input. This function works by calling the c2d, which converts a system (A, B, C, D) into the equivalent discrete system. Once the system model is discretized, the function passes control to the dlsim function, which is used to simulate discrete-time systems with the specified input.
Because of this, simulation programs like MATLAB are subjected to round-off errors associated with the discretization process.
| ← Time Variant System Solutions | Control Systems | Eigenvalues and Eigenvectors → |