Efficient polynomial transformation algorithms for multidimensional systems formulated in {s,z,γ} variables

Hari C. Reddy, I. Hung Khoo, George S. Moschytz, Allen R. Stubberud

Research output: Contribution to journalConference articlepeer-review

1 Scopus citations

Abstract

Discrete-time systems using δ-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}, δ-DT {γ-variable} and q-DT {z-variable} systems. Both 1-D and 2-D cases are considered.

Original languageEnglish
Pages (from-to)209-212
Number of pages4
JournalProceedings - IEEE International Symposium on Circuits and Systems
Volume2
StatePublished - 1996
Externally publishedYes
EventProceedings of the 1996 IEEE International Symposium on Circuits and Systems, ISCAS. Part 1 (of 4) - Atlanta, GA, USA
Duration: 12 May 199615 May 1996

Fingerprint

Dive into the research topics of 'Efficient polynomial transformation algorithms for multidimensional systems formulated in {s,z,γ} variables'. Together they form a unique fingerprint.

Cite this