Accuracy and stability of discrete-time filters generated by higher-order s-to-z mapping functions

Author

Schneider, Alan M. ; Anuskiewicz, James A. ; Barghouti, Ihab S.

Author_Institution

Dept. of Appl. Mech. & Eng. Sci., California Univ., San Diego, La Jolla, CA, USA

Volume

39

Issue

2

fYear

1994

fDate

2/1/1994 12:00:00 AM

Firstpage

435

Lastpage

441

Abstract

This note compares several different approaches to selecting an s-to-z mapping function for the purpose of converting a continuous-time transfer function F(s) to an “equivalent” discrete-time transfer function F_D(z). The primary bases of comparison are stability and accuracy. Secondary bases of comparison include: 1) the amount of computation needed to process one input to produce one output, 2) the ease with which the coefficients of F_D(z) can be determined, in particular, as the sampling period T is varied, 3) the ease of determining stability, in particular, the maximum value of T for stability, 4) the self-starting capability, and 5) compatibility with decomposition in the s-domain

Keywords

computational complexity; filtering and prediction theory; stability; transfer functions; computational requirements; continuous-time transfer function; discrete-time filters; discrete-time transfer function; high-order s-to-z mapping functions; s-domain decomposition compatibility; sampling period; self-starting capability; stability; Control systems; Digital control; Digital simulation; Feedback; Filters; Nonlinear control systems; Robot control; Sampling methods; Stability; Transfer functions;

fLanguage

English

Journal_Title

Automatic Control, IEEE Transactions on

Publisher

ieee

ISSN

0018-9286

Type

jour

DOI

10.1109/9.272353

Filename

272353