The Computer Implementation of Bilinear s-z Transformation Using New Continued Fraction Algorithms

Mohammed Ismail, Hamid Vakilzadian

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

The application of continued fractions to the bilinear transformation of polynomials is introduced. The operations to perform the transformation are continued fraction expansion in the s domain and continued fraction inversion in the z domain. Novel algorithms and computer programs to implement the expansion and the inversion are presented. In particular, the expansion algorithm provides closed forms for the continued fraction quotients in terms of the corresponding rational function coefficients. It is shown that the computer implementation of this algorithm iteratively results in a simple procedure for evaluating the quotients by hand and saves considerable computation time. It is especially noted that the algorithmic character of continued fractions leads to simple systematic computation scheme. The proposed method of bilinear transformation capitalizes on the knowledge gained in continuous-time stability theory and introduces the more recent topic of z-domain continued fractions and their applications. Numerical examples and computer data are provided. The paper brings together contributions in the modern areas of s- and z-domain system theory, as well as algorithm development for computer implementation, and attempts to close the gaps between new research results and their introduction in a classroom environment.

Original languageEnglish (US)
Pages (from-to)270-279
Number of pages10
JournalIEEE Transactions on Education
Volume32
Issue number3
DOIs
StatePublished - Aug 1989

Fingerprint

stability theory
Rational functions
System theory
data processing program
system theory
research results
Computer program listings
Sand
Polynomials
classroom
time

ASJC Scopus subject areas

  • Education
  • Electrical and Electronic Engineering

Cite this

The Computer Implementation of Bilinear s-z Transformation Using New Continued Fraction Algorithms. / Ismail, Mohammed; Vakilzadian, Hamid.

In: IEEE Transactions on Education, Vol. 32, No. 3, 08.1989, p. 270-279.

Research output: Contribution to journalArticle

@article{da98f41038544935b40b0948766f4772,
title = "The Computer Implementation of Bilinear s-z Transformation Using New Continued Fraction Algorithms",
abstract = "The application of continued fractions to the bilinear transformation of polynomials is introduced. The operations to perform the transformation are continued fraction expansion in the s domain and continued fraction inversion in the z domain. Novel algorithms and computer programs to implement the expansion and the inversion are presented. In particular, the expansion algorithm provides closed forms for the continued fraction quotients in terms of the corresponding rational function coefficients. It is shown that the computer implementation of this algorithm iteratively results in a simple procedure for evaluating the quotients by hand and saves considerable computation time. It is especially noted that the algorithmic character of continued fractions leads to simple systematic computation scheme. The proposed method of bilinear transformation capitalizes on the knowledge gained in continuous-time stability theory and introduces the more recent topic of z-domain continued fractions and their applications. Numerical examples and computer data are provided. The paper brings together contributions in the modern areas of s- and z-domain system theory, as well as algorithm development for computer implementation, and attempts to close the gaps between new research results and their introduction in a classroom environment.",
author = "Mohammed Ismail and Hamid Vakilzadian",
year = "1989",
month = "8",
doi = "10.1109/13.34159",
language = "English (US)",
volume = "32",
pages = "270--279",
journal = "IEEE Transactions on Education",
issn = "0018-9359",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - The Computer Implementation of Bilinear s-z Transformation Using New Continued Fraction Algorithms

AU - Ismail, Mohammed

AU - Vakilzadian, Hamid

PY - 1989/8

Y1 - 1989/8

N2 - The application of continued fractions to the bilinear transformation of polynomials is introduced. The operations to perform the transformation are continued fraction expansion in the s domain and continued fraction inversion in the z domain. Novel algorithms and computer programs to implement the expansion and the inversion are presented. In particular, the expansion algorithm provides closed forms for the continued fraction quotients in terms of the corresponding rational function coefficients. It is shown that the computer implementation of this algorithm iteratively results in a simple procedure for evaluating the quotients by hand and saves considerable computation time. It is especially noted that the algorithmic character of continued fractions leads to simple systematic computation scheme. The proposed method of bilinear transformation capitalizes on the knowledge gained in continuous-time stability theory and introduces the more recent topic of z-domain continued fractions and their applications. Numerical examples and computer data are provided. The paper brings together contributions in the modern areas of s- and z-domain system theory, as well as algorithm development for computer implementation, and attempts to close the gaps between new research results and their introduction in a classroom environment.

AB - The application of continued fractions to the bilinear transformation of polynomials is introduced. The operations to perform the transformation are continued fraction expansion in the s domain and continued fraction inversion in the z domain. Novel algorithms and computer programs to implement the expansion and the inversion are presented. In particular, the expansion algorithm provides closed forms for the continued fraction quotients in terms of the corresponding rational function coefficients. It is shown that the computer implementation of this algorithm iteratively results in a simple procedure for evaluating the quotients by hand and saves considerable computation time. It is especially noted that the algorithmic character of continued fractions leads to simple systematic computation scheme. The proposed method of bilinear transformation capitalizes on the knowledge gained in continuous-time stability theory and introduces the more recent topic of z-domain continued fractions and their applications. Numerical examples and computer data are provided. The paper brings together contributions in the modern areas of s- and z-domain system theory, as well as algorithm development for computer implementation, and attempts to close the gaps between new research results and their introduction in a classroom environment.

UR - http://www.scopus.com/inward/record.url?scp=0024719101&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024719101&partnerID=8YFLogxK

U2 - 10.1109/13.34159

DO - 10.1109/13.34159

M3 - Article

AN - SCOPUS:0024719101

VL - 32

SP - 270

EP - 279

JO - IEEE Transactions on Education

JF - IEEE Transactions on Education

SN - 0018-9359

IS - 3

ER -