A simplified method for the bilinear s-z transformation

Author

Scott, Dan M.

Author_Institution

Dept. of Ind. & Manage. Syst. Eng., Nebraska Univ., Lincoln, NE, USA

Volume

37

Issue

3

fYear

1994

fDate

8/1/1994 12:00:00 AM

Firstpage

289

Lastpage

292

Abstract

A new technique for performing the bilinear transformation of polynomials is presented. The technique is both simple to understand as well as efficient in its computer implementation. The key to the method is the may in which the successive derivatives of a particular polynomial are computed. A simple recursion formula is used which can be done either by hand, if desired, or by computer. The order of complexity of the algorithm is found to be O(n²), while storage requirements are O(n), where n is the degree of the polynomial. The new method will handle completely general bilinear transformations. A computer implementation is presented which was found to be satisfactory for both precision and speed

Keywords

computational complexity; mathematics computing; polynomials; recursive functions; transforms; algorithm; bilinear s-z transformation; complexity; computer implementation; derivatives; polynomials; precision; recursion formula; speed; Capacitors; Closed-form solution; Computational complexity; Computational efficiency; Continuous time systems; Control systems; Discrete time systems; Filters; Helium; Polynomials;

fLanguage

English

Journal_Title

Education, IEEE Transactions on

Publisher

ieee

ISSN

0018-9359

Type

jour

DOI

10.1109/13.312140

Filename

312140