Combinatorial rules for some useful transformations

Author

Jury, Eliahu I. ; Chan, O. W c

Volume

Issue

fYear

1973

fDate

9/1/1973 12:00:00 AM

Firstpage

476

Lastpage

480

Abstract

The various transformations involved in transforming the polynomial $F(z) = \\Sigma _{k=0}^{n}a_{k}z^{k}$ into the polynomial $G(s) = \\Sigma _{k=0}^{n} b_{k}s^{k}$ are discussed. In particular, the entries of the $Q$ -matrix of the matrix transformation $b] = Qa]$ are generated in easily obtained combinatorial rules. The various applications of the transformations in the stability study of discrete systems in aperiodicity conditions in evaluation of total square integrals and in digital-filter design are enumerated.

Keywords

Bilinear transformations; Discrete-time linear systems; General theory; Laplace transforms; Matrix methods; Polynomials; Stability; Z transforms; Data systems; Discrete transforms; Intersymbol interference; Polynomials; Power generation; Stability; System testing;

fLanguage

English

Journal_Title

Circuit Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9324

Type

jour

DOI

10.1109/TCT.1973.1083716

Filename

1083716

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1172671