The state-space realization of ann-dimensional transfer function (original) (raw)
Related papers
Standard controllable realizations for nD separable transfer matrices
2011
A class of nD discrete-time systems is considered and its state- space and frequency-domain representations are provided. By using the multidimensional (nD) Z-transformation, it is shown that the transfer ma- trices for these systems are proper rational functions in n indeterminates with separable denominators. A realization problem for these systems is stated and an algorithm is proposed to construct standard controllable realizations for transfer matrices with separable denominators. A Matlab program is given for the provided algorithm and two examples illustrate the advantages of the proposed method.
A new general formulation of a transfer-function matrices of 2D digital systems
Australian Journal of Electrical and Electronics Engineering, 2019
The contribution of our paper is a new simple method for transfer-function matrices derivation in two-dimensional digital systems from Roesser's model is given. The main idea of this method is changing the form of the transfer-function, from state space to a fraction with a polynomial numerator and denominator. Then by identity, we can derive matrices of numerator and denominator. Numerical examples are given to prove the effectiveness and the simplicity of the proposed method.
An Algorithm for the Computation of the Transfer Function Matrix of Two- dimensional Systems
An algorithm is developed for the computation of the transfer function matrix of a two-dimensional system, which is given in its state-space form, without inverting a polynomial matrix. A new transformation has been considered so that the well known Fadeeva's algorithm for regular systems can be used as the basisfor the derivation of the present algorithm. The above transformation can be generally used in the reduction of many two-dimensional problems to the corresponding one-dimensional ones. The algorithm presented is well-suited for computer use.
Applied Mathematics and Computer Science, 2009
We review the realization theory of polynomial (transfer function) matrices via "pure" generalized state space system models. The concept of an irreducible-at-infinity generalized state space realization of a polynomial matrix is defined and the mechanism of the "cancellations" of "decoupling zeros at infinity" is closely examined. The difference between the concepts of irreducibility and minimality of generalized state space realizations of polynomial (transfer function) matrices is pointed out and the associated concepts of dynamic and non-dynamic variables appearing in generalized state space realizations are also examined.
Computation of transfer function matrices of linear multivariable systems
Automatica, 1987
This paper is concerned with the computation of transfer function matrices of linear multivariable systems described by their state-space equations. The algorithm proposed here performs orthogonal similarity transformations to find the minimal order subsystem corresponding to each input-output pair and uses some determinant identities to determine the elements of the transfer function matrices. Numerical examples are included to illustrate the performance of the proposed algorithm.
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.
New algorithm for computing transfer function from state equation
Applied Mathematical Sciences, 2013
This paper presents a new algorithm for computing the transfer function from state equations for linear system. This algorithm employs an approximation method, which uses Krylov subspace techniques for linear system. We have focused on the Lanczos-based using the properties of Schur complemnts. This approach reduces the computation of transfer function from state equation for linear system.