For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Successive Computation of Transformation Matrices for Arbitrary Polynomial Transformation
Younseok CHOO Gin Kyu CHOI
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2009/04/01
Online ISSN: 1745-1337
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Digital Signal Processing
polynomial transformation, bilinear transformation, biquadratic transformation, transformation matrix,
Full Text: PDF>>
In many engineering problems it is required to convert a polynomial into another polynomial through a transformation. Due to its wide range of applications, the polynomial transformation has received much attention and many techniques have been developed to compute the coefficients of a transformed polynomial from those of an original polynomial. In this letter a new result is presented concerning the transformation matrix for arbitrary polynomial transformation. A simple algorithm is obtained which enables one to successively compute transformation matrices of various order.