Transfer function computation for 3-D discrete systems

Research output: Contribution to journalArticleResearchpeer-review

Abstract

A theoretically attractive and computationally fast algorithm is presented for the determination of the coefficients of the determinantal polynomial and the coefficients of the adjoint polynomial matrix of a given three-dimensional (3-D) state space model of Fornasini-Marchesini type. The algorithm uses the discrete Fourier transform (DFT) and can be easily implemented on a digital computer.

Original languageEnglish
Pages (from-to)539-547
Number of pages9
JournalKybernetika
Volume36
Issue number5
StatePublished - 1 Dec 2000

Fingerprint

Transfer functions
Polynomials
Digital computers
Discrete Fourier transforms

Cite this

@article{942cc480bedd45db9d205bd1c7adbd7a,
title = "Transfer function computation for 3-D discrete systems",
abstract = "A theoretically attractive and computationally fast algorithm is presented for the determination of the coefficients of the determinantal polynomial and the coefficients of the adjoint polynomial matrix of a given three-dimensional (3-D) state space model of Fornasini-Marchesini type. The algorithm uses the discrete Fourier transform (DFT) and can be easily implemented on a digital computer.",
author = "George Antoniou",
year = "2000",
month = "12",
day = "1",
language = "English",
volume = "36",
pages = "539--547",
journal = "Kybernetika",
issn = "0023-5954",
publisher = "Academy of Sciences of the Czech Republic",
number = "5",

}

Transfer function computation for 3-D discrete systems. / Antoniou, George.

In: Kybernetika, Vol. 36, No. 5, 01.12.2000, p. 539-547.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Transfer function computation for 3-D discrete systems

AU - Antoniou, George

PY - 2000/12/1

Y1 - 2000/12/1

N2 - A theoretically attractive and computationally fast algorithm is presented for the determination of the coefficients of the determinantal polynomial and the coefficients of the adjoint polynomial matrix of a given three-dimensional (3-D) state space model of Fornasini-Marchesini type. The algorithm uses the discrete Fourier transform (DFT) and can be easily implemented on a digital computer.

AB - A theoretically attractive and computationally fast algorithm is presented for the determination of the coefficients of the determinantal polynomial and the coefficients of the adjoint polynomial matrix of a given three-dimensional (3-D) state space model of Fornasini-Marchesini type. The algorithm uses the discrete Fourier transform (DFT) and can be easily implemented on a digital computer.

UR - http://www.scopus.com/inward/record.url?scp=0034360642&partnerID=8YFLogxK

M3 - Article

VL - 36

SP - 539

EP - 547

JO - Kybernetika

JF - Kybernetika

SN - 0023-5954

IS - 5

ER -