Symbolic computation techniques are used to obtain a canonical form for polynomial matrices arising from discrete 2D linear\nstate-space systems. The canonical form can be regarded as an extension of the companion form often encountered in the theory\nof 1D linear systems. Using previous results obtained by Boudellioua and Quadrat (2010) on the reduction by equivalence to Smith\nform, the exact connection between the original polynomial matrix and the reduced canonical form is set out. An example is given\nto illustrate the computational aspects involved.
Loading....