By Topic

The computer implementation of bilinear s-z transformation using new continued fraction algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ismail, M. ; Dept. of Electr. Eng., Ohio State Univ., Columbus, OH, USA ; Vakilzadian, H.

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 a simple systematic computation scheme. The proposed method of bilinear transformation capitalizes on the knowledge gained in continuous-time stability theory and introduces the topic of z-domain continued fractions and their applications. Numerical examples and computer data are provided

Published in:

Education, IEEE Transactions on  (Volume:32 ,  Issue: 3 )