Algorithm for positive realization of transfer functions

Béla Nagy, M. Matolcsi

Research output: Contribution to journalArticle

9 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)699-702
Number of pages4
JournalIEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
Volume50
Issue number5
DOIs
Publication statusPublished - May 2003

Fingerprint

Transfer functions
Poles
Rational functions
Impulse response

Keywords

  • Impulse-response sequence
  • Positive linear systems
  • Positive realization

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Algorithm for positive realization of transfer functions. / Nagy, Béla; Matolcsi, M.

In: IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, Vol. 50, No. 5, 05.2003, p. 699-702.

Research output: Contribution to journalArticle

@article{e93ddf6eab584c96877b914d28ea471a,
title = "Algorithm for positive realization of transfer functions",
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 = "Impulse-response sequence, Positive linear systems, Positive realization",
author = "B{\'e}la Nagy and M. Matolcsi",
year = "2003",
month = "5",
doi = "10.1109/TCSI.2003.811014",
language = "English",
volume = "50",
pages = "699--702",
journal = "IEEE Transactions on Circuits and Systems II: Express Briefs",
issn = "1057-7122",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Algorithm for positive realization of transfer functions

AU - Nagy, Béla

AU - Matolcsi, M.

PY - 2003/5

Y1 - 2003/5

N2 - 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.

AB - 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.

KW - Impulse-response sequence

KW - Positive linear systems

KW - Positive realization

UR - http://www.scopus.com/inward/record.url?scp=0038508858&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0038508858&partnerID=8YFLogxK

U2 - 10.1109/TCSI.2003.811014

DO - 10.1109/TCSI.2003.811014

M3 - Article

VL - 50

SP - 699

EP - 702

JO - IEEE Transactions on Circuits and Systems II: Express Briefs

JF - IEEE Transactions on Circuits and Systems II: Express Briefs

SN - 1057-7122

IS - 5

ER -