Testing a polynomial for zeros inside the unit-circle over the ring of Gaussian integers

Yuval Bistritz*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The paper considers a Gaussian-integer preserving (GIP) form for the author's method to test whether a polynomial with complex coefficients has its zeros inside the unit-circle (is 'stable'). The GIP property describes the fact that for a polynomial with Gaussian integer (i.e. "complex integer") coefficients, the test is carried out completely over Gaussian integers. The proposed algorithm has linear growth of the size of coefficients and an implied low binary complexity. This property is advantageous for deriving simpler stability constraints on designable parameters. It can also be exploited to reduce obstruction of decision about stability that can be introduced by numerical inaccuracy when testing ill-conditioned or high degree polynomials.

Original languageEnglish
Title of host publicationISCAS 2006
Subtitle of host publication2006 IEEE International Symposium on Circuits and Systems, Proceedings
Pages4256-4260
Number of pages5
StatePublished - 2006
EventISCAS 2006: 2006 IEEE International Symposium on Circuits and Systems - Kos, Greece
Duration: 21 May 200624 May 2006

Publication series

NameProceedings - IEEE International Symposium on Circuits and Systems
ISSN (Print)0271-4310

Conference

ConferenceISCAS 2006: 2006 IEEE International Symposium on Circuits and Systems
Country/TerritoryGreece
CityKos
Period21/05/0624/05/06

Fingerprint

Dive into the research topics of 'Testing a polynomial for zeros inside the unit-circle over the ring of Gaussian integers'. Together they form a unique fingerprint.

Cite this