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 language | English |
|---|---|
| Pages (from-to) | 209-212 |
| Number of pages | 4 |
| Journal | Proceedings - IEEE International Symposium on Circuits and Systems |
| Volume | 2 |
| State | Published - 1996 |
| Externally published | Yes |
| Event | Proceedings of the 1996 IEEE International Symposium on Circuits and Systems, ISCAS. Part 1 (of 4) - Atlanta, GA, USA Duration: 12 May 1996 → 15 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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver