Fixed-Point Blockset    

State-Space Realization

This section presents a fixed-point state-space realization. The difference equation, block parameters, and model design are discussed.

The FixPt State-Space Realization block is a masked subsystem that implements the system described by

where k is the current time step, k + 1 is the next time step, u(k) is the current input, x(k) is the current state, x(k + 1) is the state from the next time step, y(k) is the current output, and A, B, C, and D are all coefficient matrices. The realization is shown below.

Parameters and Dialog Box

The dialog box and parameter descriptions for the state-space realization are given below.

A
An n-by-n matrix where n is the number of states
B
An n-by-m matrix where m is the number of inputs
C
An r-by-n matrix where r is the number of outputs
D
An r-by-m matrix
Initial conditions
The initial values for all times preceding the current time
Sample time
The time interval, Ts, between samples
Base data type
The processor's base data type
Accumulator data type
The processor's accumulator data type

The advantage of using the state-space realization is that you can build high order systems quickly. The disadvantage is that you can't individually scale the elements on vector signal lines. For example, even if the i-th state, xi, is large and the j-th state, xj, is small, you must use the same scaling for both. Matrix gain coefficients can be individually scaled but this may not suffice.

The solution to this problem is to use a new realization with more blocks and fewer elements on each signal line. For maximum control of scaling, you should use a diagram that has only scalars on each line.

Model Design Review

A brief review of the model design is given below. The design criteria reflect the rules presented in Design Rules.


 Lead Filter or Lag Filter Realization Reference