Sampling zeros and the Euler-Frobenius polynomials

We show that the zeros of sampled-data systems resulting from rapid sampling of continuous-time systems preceded by a zero-order hold (ZOH) are the roots of the Euler-Frobenius polynomials. Using known properties of these polynomials, we prove two conjectures of Hagiwara et al. (1993), the first of...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on automatic control 2001-02, Vol.46 (2), p.340-343
Main Authors: Weller, S.R., Moran, W., Ninness, B., Pollington, A.D.
Format: Article
Language:English
Subjects:
Australia Council
Automatic control
Extrapolation
Logarithms
Mathematics
Poles and zeros
Polynomials
Roots
Sampling
Sampling methods
Statistics
Transfer functions
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We show that the zeros of sampled-data systems resulting from rapid sampling of continuous-time systems preceded by a zero-order hold (ZOH) are the roots of the Euler-Frobenius polynomials. Using known properties of these polynomials, we prove two conjectures of Hagiwara et al. (1993), the first of which concerns the simplicity, negative realness, and interlacing properties of the sampling zeros of ZOH- and first-order hold (FOH-) sampled systems. To prove the second conjecture, we show that in the fast sampling limit, and as the continuous-time relative degree increases, the largest sampling zero for FOH-sampled systems approaches 1/e, where e is the base of the natural logarithm.
ISSN:0018-9286
1558-2523
DOI:10.1109/9.905706