Efficient polynomial transformation algorithms for multidimensional systems formulated in {s,z,/spl gamma/} variables

Discrete-time systems using /spl delta/-operator instead of shift operator are being studied vigorously in view of the many numerical advantages they provide. In the design of discrete-time filters, polynomial transformations from continuous-time systems play an important role. This paper would present efficient tabular algorithms to perform polynomial transformation between continuous-time {s-variable}, /spl delta/-DT {/spl gamma/-variable} and q-DT {z-variable} systems. Both 1-D and 2-D cases are considered.