Notes on minimal realizations of multidimensional systems (original) (raw)
2014, Multidimensional Systems and Signal Processing
In this paper, we formalize two related but different notions for state-space realization of multidimensional (nD) single-input-single-output discrete systems in nD Roesser model, namely the "absolutely minimal realization" and the "minimal realization". We then focus our study mainly on first-degree 2D and 3D causal systems. A necessary and sufficient condition for absolutely minimal realizations is given for first-degree 2D systems. It is then shown that first-degree 2D systems that do not admit absolutely minimal realizations always admit minimal realizations of order 3. A Gröbner basis approach is also proposed which leads to a sufficient condition for the absolutely minimal realizations of some higher-degree 2D systems. We then present a symbolic method that gives simple necessary conditions for the existence of absolutely minimal realizations for first-degree 3D systems. A two-step approach to absolutely minimal realizations for first-degree 3D systems is then presented, followed by techniques for minimal realizations of first-degree 3D systems. Throughout the paper, several non-trivial examples are illustrated with the aim of helping the reader to apply the realization methods proposed in this paper.
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Sign up for access to the world's latest research
Related papers
Minimal realization algorithm for multidimensional hybrid systems
2009
A class of multidimensional time-invariant hybrid systems is studied, which depends on q continuous-time variables and on r discrete-time ones. The formula of the input-output map of these systems is given. A multiple (q, r)-hybrid Laplace transformation is defined and it is used to determine the transfer matrices of the considered systems. The minimal realization problem is analysed and an algorithm is given which provides minimal realizations.
An a priori nonminimal state-space realization of n-D systems
Linear Algebra and its Applications, 1991
In investigations on n-D systems it is very important to know how to realize any multivariable rational transfer function. A minimal realization is most useful, but in general we do not know existence conditions for such a realization or methods for obtaining it. Therefore, we construct an cl priori nonminimal realization which always exists for any causal transfer function, independently of the number of variables and their degrees. To simplify the notation, a description in terms of multiway matrices is used. 1.
State Space Realization and Inversion of 2-D Systems by
1978
Send correspondence and/or proofs to above address. In this paper the state space realization results of [ 1] for causal 2-D systems are generalized to a much larger class of 2-D systems. We introduce a generalized notion of a state space realization for which the state can still be recursively evaluated. The results include a realization method for a class of NSHP filters. In the second part we introduce inverse 2-D systems with inherent delay. Some results concerning existence of an inverse with inherent delay for a 2-D system will be given. It will be shown that, in general, a causal 2-D system cannot have a causal inverse (with inherent delay). Furthermore it will be shown that a causal 2-D system always has an inverse with inherent delay in the larger class of 2-D systems mentioned above,;.- 2-1.
IEEE Access, 2021
This paper considers systems theoretic properties of linear systems defined in terms of spatial and temporal indeterminates. These include physical applications where one of the indeterminates is of finite duration. In some cases, a singular Roesser state-space model representation of the dynamics has found use in characterizing systems theoretic properties. The representation of the dynamics of many linear systems is obtained in terms of transform variables and a polynomial system matrix representation. This paper develops a direct method for constructing the singular Roesser state-space realization from the system matrix description for 3D systems such that relevant properties are retained. Since this method developed relies on basic linear algebra operations, it may be highly effective from the computational standpoint. In particular, spatially interconnected systems of the form of the ladder circuits are considered as the example. This application confirms the usefulness and effectiveness of the proposed method independently of the system spatial order. INDEX TERMS nD systems, polynomial system matrix, Roesser model, spatio-temporal dynamics.
Computation of minimal-order realizations of generalized state-space systems
Circuits, Systems, and Signal Processing, 1989
In this paper we consider the problem of obtaining minimal-order representations of generalized state-space systems described by equations of the form Ei~(t) = Ax(t) + Bu(t), y(t) = Cx(t) + D u(t) with E singular and det(sE-A) # 0. The underlying principle is that of removal of impulsive and exponential uncontrollable and unobservable modes. When this is followed by the removal of the remaining impulsive modes, we get a minimal-order generalized or standard state-space representation. Simple reduction procedures and numerical algorithms based on these principles are developed and illustrated by means of two numerical examples.
Minimal state space realization, static output feedback and matrix completion of families of systems
We here characterize the minimality of realization of arbitrary linear time-invariant dynamical systems through (i) intersection of the spectra of the realization matrix and of the corresponding state submatrix and (ii) moving the poles by applying static output feedback. In passing, we introduce, for a given square matrix A, a parameterization of all matrices B for which the pairs (A, B) are controllable. In particular, the minimal rank of such B turns to be equal to the smallest geometric multiplicity among the eigenvalues of A. Finally, we show that the use of a (not necessarily square) realization matrix L to examine minimality of realization, is equivalent to the study of a smaller dimensions, square realization matrix L_sq, which in turn is linked to realization matrices obtained as polynomials in L_sq. Namely a whole family of systems.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.