On Jury's test for 2-D stability of discrete-time systems and its simplification by telepolation

Yuval Bistritz*

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

3 Scopus citations

Abstract

The paper revises and simplifies Jury's tabular stability test for two-dimensional (2-D) discrete-time systems. The tabular test builds for a 2-D polynomial of degree (n1, n2) a `2-D table' - a sequence of n2 matrices or equivalently 2-D polynomials and then examines its last entry - a 1-D polynomial of degree 2n1n2 for no zeros on the unit circle. Analysis of the cost of computation for the test is performed and shows that it is of O(n6) (n1 = n2 = n), compared to previous tabular tests of exponential complexity. Next, we propose a new test based on telepolation - telescoping the last entry of this 2-D table by interpolation. The table's construction is replaced by n1n2+1 stability tests of 1-D polynomials of degree n1 or n2. The resulting new 2-D stability test is shown to require a low O(n4) count of operations.

Original languageEnglish
Pages (from-to)I-567-I-570
JournalProceedings - IEEE International Symposium on Circuits and Systems
Volume1
DOIs
StatePublished - 2000
EventProceedings of the IEEE 2000 International Symposium on Circuits and Systems, ISCAS 2000 - Geneva, Switz, Switzerland
Duration: 28 May 200031 May 2000

Fingerprint

Dive into the research topics of 'On Jury's test for 2-D stability of discrete-time systems and its simplification by telepolation'. Together they form a unique fingerprint.

Cite this