DocumentCode :
1345494
Title :
Arbitrary polynomial transformations
Author :
Dyer, Stephen A. ; Dyer, Justin S.
Volume :
3
Issue :
2
fYear :
2000
fDate :
6/1/2000 12:00:00 AM
Firstpage :
38
Lastpage :
40
Abstract :
Previously, we looked at several polynomial transformations-the classical lowpass-to-highpass, lowpass-to-bandpass, and lowpass-to-bandstop transformations, and the special case of the bilinear transformation. We presented specific algorithms for accomplishing the transformations numerically. In this article, we end our preoccupation with polynomial transformations by presenting a straightforward algorithm derived from Heinen and Siddique [1988] for performing arbitrary polynomial transformations numerically, and, which is, in fact, based on Waggener´s method [1980]. However, we do not implement Heinen and Siddique´s algorithm directly. Instead, we rely on functions written to find sum-polynomials and product-polynomials. Our approach is quite as efficient, but it should prove easier to follow and code
Keywords :
polynomials; rational functions; Waggener´s method; arbitrary polynomial transformations; product-polynomials; rational function; recursive algorithms; sum-polynomials; Arithmetic; Instruments; Polynomials;
fLanguage :
English
Journal_Title :
Instrumentation & Measurement Magazine, IEEE
Publisher :
ieee
ISSN :
1094-6969
Type :
jour
DOI :
10.1109/5289.846262
Filename :
846262
Link To Document :
بازگشت