Real-polynomial based immittance-type tabular stability test for two-dimensional discrete systems

Yuval Bistritz*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

The paper proposes a new stability test for two-dimensional (2D) discrete systems. It is a tabular test; that is, it builds for the tested bivariate polynomial of degree (n1, n2) a sequence of n2 (or n1) bivariate polynomials or matrices (the "2D table") of increasing row and decreasing column sizes. It is an immittance-type test, which means that it uses a three-term recurrence relation to obtain a sequence of matrices with certain symmetry. It differs from some recent immittance tabular tests in that it is derived from the author's stability test for real polynomials instead of complex-coefficient polynomials. In comparison with related 2D stability tests developed before by Karan and Sarisvastava and by Premaratne, it simplifies the number of stability conditions and reduces the overall cost of computation from an exponential to a polynomial order of complexity.

Original languageEnglish
Pages (from-to)255-276
Number of pages22
JournalCircuits, Systems, and Signal Processing
Volume22
Issue number3
DOIs
StatePublished - 2003

Keywords

  • Discrete-time systems
  • Immittance algorithms
  • Stability testing
  • Two-dimensional systems

Fingerprint

Dive into the research topics of 'Real-polynomial based immittance-type tabular stability test for two-dimensional discrete systems'. Together they form a unique fingerprint.

Cite this