DocumentCode
1217994
Title
Algorithm for positive realization of transfer functions
Author
Nagy, Béla ; Matolcsi, M.
Author_Institution
Math. Dept., Tech. Univ., Budapest, Hungary
Volume
50
Issue
5
fYear
2003
fDate
5/1/2003 12:00:00 AM
Firstpage
699
Lastpage
702
Abstract
The aim of this brief is to present a finite-step algorithm for the positive realization of a rational transfer function H(z). In comparison with previously described algorithms we emphasize that we do not make an a priori assumption on (but, instead, include a finite step procedure for checking) the nonnegativity of the impulse-response sequence of H(z). For primitive transfer functions a new method for reducing the pole order of the dominant pole is also proposed.
Keywords
discrete time systems; linear systems; pole assignment; rational functions; transfer functions; transient response; discrete time-invariant linear system; dominant pole; finite step procedure; impulse-response sequence; nonnegativity; pole order reduction; positive linear systems; positive realization; primitive transfer functions; rational transfer function; Chemicals; Circuits; Linear systems; Mathematics; Observability; Routing; State-space methods; Transfer functions;
fLanguage
English
Journal_Title
Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on
Publisher
ieee
ISSN
1057-7122
Type
jour
DOI
10.1109/TCSI.2003.811014
Filename
1203832
Link To Document