Publication detail

Algorithmic s-z Transformations for Continuous-Time to Discrete-Time Filter Conversion

BIOLEK, D. BIOLKOVÁ, V.

Original Title

Algorithmic s-z Transformations for Continuous-Time to Discrete-Time Filter Conversion

English Title

Algorithmic s-z Transformations for Continuous-Time to Discrete-Time Filter Conversion

Type

conference paper

Language

en

Original Abstract

This contribution introduces a so-called generalized Pascal matrix. Using this matrix, the coefficients of transfer functions of the continuous-time and discrete-time linear circuits can be converted on the assumption that both circuits are related by a general first-order s-z transformation. We explain the effective numerical procedure of computing all matrix elements for arbitrary first-order s-z transformation.

English abstract

This contribution introduces a so-called generalized Pascal matrix. Using this matrix, the coefficients of transfer functions of the continuous-time and discrete-time linear circuits can be converted on the assumption that both circuits are related by a general first-order s-z transformation. We explain the effective numerical procedure of computing all matrix elements for arbitrary first-order s-z transformation.

Keywords

s-z transformation, bilinear transformation, Pascal matrix, generalized Pascal matrix, FFT

RIV year

2001

Released

01.01.2001

Publisher

IEEE

Location

Sydney, Australia

ISBN

0-7803-6687-5

Book

Proceedings of the IEEE International Symposium on Circuits and SystemsISCAS'01

Edition number

1

Pages from

588

Pages to

590

Pages count

3

BibTex


@inproceedings{BUT6860,
  author="Dalibor {Biolek} and Viera {Biolková}",
  title="Algorithmic s-z Transformations for Continuous-Time to Discrete-Time Filter Conversion",
  annote="This contribution introduces a so-called generalized Pascal matrix. Using this matrix, the coefficients of transfer functions of the continuous-time and discrete-time linear circuits can be converted on the assumption that both circuits are related by a general first-order s-z transformation. We explain the effective numerical procedure of computing all matrix elements for arbitrary first-order s-z transformation.",
  address="IEEE",
  booktitle="Proceedings of the IEEE International Symposium on Circuits and SystemsISCAS'01",
  chapter="6860",
  institution="IEEE",
  year="2001",
  month="january",
  pages="588",
  publisher="IEEE",
  type="conference paper"
}