# How can the order of a transfer function be derived from its equivalent state space representation?

Suppose I have a discrete state space model:

\begin{align} \theta[k+1] &= A \theta[k] + B u[k]\\ y[k] &= C \theta[k] \end{align}

I know that the equivalent transfer function can be found by solving

$$Y(z) = C (zI-A)^{-1} B U(z)$$

But is there a quick way to determine the order of the transfer function for each input? I.e., the degree of its numerator and denominators, assuming that the dimensions of $A$ will be $n\times n$, $B$'s will be $n \times m$ and $C$'s will be $1 \times n$? (Assuming here there is only one variable being observed.)

• This is probably superfluous but the recursion structure should be directly obvious from the Eigenvalue/Eigenvector values. – rrogers Sep 2 '15 at 14:05
• if $m \ne 1$ then you have multiple transfer functions (all with the same denominator). the order will be $n$ unless you have pole-zero cancellation, but that pole-zero cancellation only hides a state inside. there could be an unstable pole cancelled by a zero (both outside the unit circle) and your system could be going to hell on the inside and you wouldn't know it on the outside until numerical limits are reached. – robert bristow-johnson Nov 29 '15 at 17:52

The question of "determine the order of the transfer function for each input" seems odd, to me. If the system is minimal (it can't be represented by a smaller order system), then you need it as-is. Pulling out one of the $m\times 1$ systems on its own may be of interest, but you can't reduce it without destroying the overall system.
Can you give more information about why you want to examine just one of the $m$ transfer functions?