Title :
The general recurrence relation for arbitrary rational transformation of polynomials
Author :
Erfani, S. ; Ahmadi, M. ; Ramachandran, V.
Author_Institution :
Michigan Univ., Dearborn, MI, USA
fDate :
6/1/1989 12:00:00 AM
Abstract :
A recurrence relation is developed that allows the coefficients of a transformed polynomial under common rational function transformations to be readily computed from the original coefficients. The recursive algorithm is quite general and prescribes a simple scheme for machine implementation as well as manual calculation
Keywords :
polynomials; transfer functions; transforms; coefficients; polynomials; rational function transformations; recurrence relation; recursive algorithm; transfer functions; Circuits and systems; Closed-form solution; Continuous time systems; Digital filters; Frequency; Poles and zeros; Polynomials; Prototypes; System testing; Transfer functions;
Journal_Title :
Circuits and Systems, IEEE Transactions on
