Scheduled System Maintenance:
On May 6th, system maintenance will take place from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). During this time, there may be intermittent impact on performance. We apologize for the inconvenience.
By Topic

Number theoretic fast algorithms for bilinear and other generalized transformations

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
1 Author(s)
Yagle, A.E. ; Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA

Fast algorithms based on the Mersenne and Fermat number-theoretic transforms are used to perform the bilinear transformation of a continuous transfer function to a discrete equivalent. The computations are carried out in finite precision arithmetic, require no multiplications, and can be implemented in parallel using very simple processors. Although the bilinear transform is presently emphasized, similar algorithms are easily derived for any transformation from the s-plane to the z-plane involving the ratio of two polynomials with integer coefficients

Published in:

Automatic Control, IEEE Transactions on  (Volume:35 ,  Issue: 11 )