A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

State-Space to Transfer Function Conversion

Research Depth 129 in the knowledge graph ☐ I know this ☆ Set as goal
14topics build on this
856prerequisites beneath it
See this on the map →
State-Space RepresentationTransfer Functions and System Modeling→→State-Space Canonical Forms: Controllable and Observable Forms
state-space transfer-function canonical-forms minimal-realization controllable-canonical-form observable-canonical-form

Core Idea

State-space models (ẋ = Ax + Bu, y = Cx + Du) and transfer functions G(s) = C(sI − A)⁻¹B + D are two representations of the same linear time-invariant system, and converting between them reveals important structural properties. The transfer function is obtained from the state-space model by G(s) = C·adj(sI − A)·B/det(sI − A) + D, where det(sI − A) gives the characteristic polynomial. Canonical forms provide standardized state-space representations: controllable canonical form places the characteristic polynomial coefficients directly in the last row of A with a specific B and C structure, making controllability transparent; observable canonical form is its dual, making observability transparent. A state-space realization is minimal if and only if it is both controllable and observable, meaning no pole-zero cancellations occur and the state dimension equals the transfer function's McMillan degree. Non-minimal realizations have a higher state dimension than necessary because hidden modes (uncontrollable or unobservable states) create pole-zero cancellations that disappear from the transfer function. Converting from transfer function to state-space always yields a minimal realization when using standard canonical forms, but converting a non-minimal state-space model to a transfer function and back loses the hidden modes permanently.

How It's Best Learned

Start with a third-order state-space model and compute the transfer function by hand using the formula G(s) = C(sI − A)⁻¹B + D, verifying with MATLAB's tf(ss(A,B,C,D)) or Python's control.ss2tf(). Then construct the controllable and observable canonical forms for the same transfer function and confirm they have identical input-output behavior but different internal state variables. Finally, take a fourth-order state-space model with an uncontrollable mode, convert to transfer function, and observe the pole-zero cancellation that reduces the order — illustrating why minimality matters.

Common Misconceptions

Explainer

You already know two ways to describe a linear time-invariant system: the state-space model (ẋ = Ax + Bu, y = Cx + Du), which tracks the internal state evolving moment to moment, and the transfer function G(s), which compresses everything down to an input-output ratio in the s-domain. These are two windows onto the same underlying dynamics, and understanding how to convert between them reveals structure that neither view makes obvious on its own.

The conversion formula G(s) = C(sI − A)⁻¹B + D is more informative than it first appears. The matrix (sI − A)⁻¹ is the resolvent of A — it captures how the system responds at each frequency s. Its denominator is det(sI − A), the characteristic polynomial, whose roots are the system's poles. This is the same characteristic equation you solve to find eigenvalues of A, so the poles of the transfer function are exactly the eigenvalues of A. The numerator picks out how the input B drives the states and how the output matrix C observes them. The D term is the direct feedthrough that bypasses the dynamics entirely.

Canonical forms are standardized state-space structures designed to make a specific property obvious by construction. In controllable canonical form, the characteristic polynomial coefficients appear directly in the last row of A, and B has a simple structure (zeros except for a 1 in the last entry). This form guarantees controllability — every state can be driven from the input — and is the natural starting point for state feedback pole placement because the feedback gains directly modify those last-row coefficients. Observable canonical form is its transpose dual: it guarantees observability and is the natural basis for observer design. The insight is that these two forms share the same transfer function but have completely different internal representations; any invertible transformation T relating two realizations via x̃ = Tx gives another valid but structurally different model.

The deepest concept here is minimality. A realization is minimal if and only if it is both controllable and observable, meaning its state dimension equals the McMillan degree of the transfer function. When a system has an uncontrollable or unobservable mode, that mode cancels as a pole-zero pair when you compute the transfer function — it simply disappears from the input-output description. This is dangerous: a cancelled mode is not gone from the physical system, it is merely hidden. If that hidden mode is unstable, the internal state will diverge even while the output looks perfectly well-behaved. A system with a right-half-plane pole hidden by a zero cancellation can fail catastrophically while every output measurement appears nominal.

One practical implication to remember: the round-trip conversion loses information. Converting a state-space model to a transfer function and back always returns a minimal realization — the hidden modes are permanently discarded. Infinitely many state-space realizations share the same transfer function, all related by similarity transformations. This means that when you design a controller using a transfer function, you are implicitly assuming minimality. When you implement that controller on the actual system, any non-minimal modes in the physical plant remain present and must be accounted for in the stability analysis.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Dividing Integers → Unit Rates → Proportions → Percent Concept → Converting Between Fractions, Decimals, and Percents → Operations with Rational Numbers → Two-Step Equations → Solving Multi-Step Equations → Equations with Variables on Both Sides → Angle Pairs: Complementary, Supplementary, and Vertical → Parallel Lines and Transversals → Corresponding Angles → Alternate Interior Angles → Triangle Angle Sum Theorem → Exterior Angle Theorem → Triangle Inequality Theorem → Similar Triangles: AA Similarity → Similar Triangles: SSS and SAS Similarity → Proportions in Similar Triangles → Right Triangle Trigonometry Introduction → Sine, Cosine, and Tangent Ratios → Trigonometric Ratios Review → Radian Measure → Converting Between Degrees and Radians → The Unit Circle → Graphing Sine and Cosine → Graphing Tangent and Reciprocal Trigonometric Functions → Derivatives of Trigonometric Functions → Antiderivatives → Indefinite Integrals → Basic Integration Rules → Riemann Sums → Definite Integral Definition → Double Integrals: Definition and Setup → Iterated Integrals and Fubini's Theorem → Double Integrals over Rectangular Regions → Double Integrals over General Regions → Applications of Double Integrals: Area, Mass, and Moments → Triple Integrals in Cartesian Coordinates → Triple Integrals in Cylindrical and Spherical Coordinates → Change of Variables and the Jacobian Determinant → Applications of Triple Integrals: Volume and Mass → Vector Fields and Their Representations → Line Integrals of Vector Fields → Work and Circulation → Line Integrals of Scalar and Vector Functions → Fundamental Theorem for Line Integrals → Conservative Vector Fields → Conservative Vector Fields and Potential Functions → Curl and Divergence of Vector Fields → Curl and Divergence → Divergence Theorem → Electric Flux and Divergence Theorem → Gauss's Law: Integral Form and Meaning → Solving Problems with Gauss's Law → Conductors in Electrostatic Equilibrium → Capacitance and Capacitors → Dielectrics → Dielectric Constant and Relative Permittivity → Electric Field Inside Dielectric Materials → Dielectric Materials and Polarization → Dielectric Susceptibility and Permittivity → Energy Density in Electric Fields → Electric Current and Current Density → Electrical Resistance and Resistivity → Ohm's Law and Circuit Elements → Electromotive Force (EMF) and Batteries → Kirchhoff's Circuit Laws: Voltage and Current → DC Circuit Network Analysis Methods → Transient Response in RC Circuits → RC Circuits → First-Order Transient Circuit Response → Second-Order Transient Circuit Response → Feedback Control Fundamentals → Laplace Transform Methods for Control → Transfer Functions and System Modeling → State-Space Representation → State-Space to Transfer Function Conversion

Longest path: 130 steps · 856 total prerequisite topics

Prerequisites (2)

Leads To (1)