Publication result detail

Algorithmic utilization of LDI transform for discrete-time filter design

BIOLKOVÁ, V.; KOLKA, Z.; BIOLEK, D.

Original Title

Algorithmic utilization of LDI transform for discrete-time filter design

English Title

Algorithmic utilization of LDI transform for discrete-time filter design

Type

Paper in proceedings (conference paper)

Original Abstract

The LDI matrix is introduced in its full and shortened forms. As an analogy of the Pascal matrix for the bilinear transform, the LDI matrix serves to transform the coefficients of the transfer functions of continuous- and discrete-time linear circuits which are connected by the LDI (Lossless Discrete Integration) transform. The basic properties of the LDI matrix are presented and a procedure of its algorithmic compilation is proposed.

English abstract

The LDI matrix is introduced in its full and shortened forms. As an analogy of the Pascal matrix for the bilinear transform, the LDI matrix serves to transform the coefficients of the transfer functions of continuous- and discrete-time linear circuits which are connected by the LDI (Lossless Discrete Integration) transform. The basic properties of the LDI matrix are presented and a procedure of its algorithmic compilation is proposed.

Keywords

LDI matrix, s-z transform

Key words in English

LDI matrix, s-z transform

Authors

BIOLKOVÁ, V.; KOLKA, Z.; BIOLEK, D.

RIV year

2013

Released

16.09.2008

Publisher

Mosharaka

Location

Jordan

ISBN

978-1-4244-4850-0

Book

Mosharaka International Conference on Communications, Signals and Coding

Pages from

68

Pages to

73

Pages count

6

Full text in the Digital Library

http://hdl.handle.net/

BibTex

@inproceedings{BUT27617,
  author="Viera {Biolková} and Zdeněk {Kolka} and Dalibor {Biolek}",
  title="Algorithmic utilization of LDI transform for discrete-time filter design",
  booktitle="Mosharaka International Conference on Communications, Signals and Coding",
  year="2008",
  pages="68--73",
  publisher="Mosharaka",
  address="Jordan",
  isbn="978-1-4244-4850-0"
}