Recursive algorithms for polynomial transformations
William N. Waggener · IEEE Circuits and Systems Magazine · 1980
Recursive algorithms are presented for computing the coefficients of a polynomial transformed by several commonly used transformations. The algorithms for performing the bilinear transformation and the geometric lowpass-to-bandpass transformation are particularly useful and can be readily implemented on small, programmable calculators and computers.