Minimal realization of two-dimensional systems via a state space cyclic model
P.N. Paraskevopoulos, G.E. Antoniou
Abstract
P.N. Paraskevopoulos, G.E. Antoniou
Abstract
The problem of minimal state space realization of two-dimensional systems is considered. The approach followed is, initially, to derive a circuit realization of the given transfer function involving a minimum number of delay elements. To facilitate this realization, the transfer function is expanded into a continued fraction. Using this circuit realization, an algorithm is proposed which readily provides the matrices of the state space model. The simplicity in deriving this model is due to a novel state space model introduced, which is of cyclic structure. Several examples are presented to illustrate ihe proposed algorithm.
OpenAlex reports 28 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The problem of minimal state space realization of two-dimensional systems is considered. The approach followed is, initially, to derive a circuit realization of the given transfer function involving a minimum number of delay elements. To facilitate this realization, the transfer function is expanded into a continued fraction. Using this circuit realization, an algorithm is proposed which readily provides the matrices of the state space model. The simplicity in deriving this model is due to a novel state space model introduced, which is of cyclic structure. Several examples are presented to illustrate ihe proposed algorithm.
Key concepts: Realization (probability), Minimal realization, State space, Transfer function, State (computer science), Simplicity, State-space representation, Mathematics