A DFT-Based Algorithm for n-Order Singular State Space Systems

Research output: Contribution to journalArticle

Abstract

The discrete Fourier transform (DFT) is used for determining the coefficients of a transfer function for n-order singular linear systems, Ex (n) = Σi=1 n Aix (n+1) + Bu, where E may be singular. The algorithm is straight forward and easily can be implemented. Three step-by-step examples illustrating the application of the algorithm are presented.

Original languageEnglish
Pages (from-to)421-430
Number of pages10
JournalInformatica
Volume14
Issue number4
StatePublished - 1 Jan 2003

Fingerprint

Discrete Fourier transform
Discrete Fourier transforms
State Space
Singular Linear Systems
Transfer Function
Straight
Transfer functions
Linear systems
Coefficient

Keywords

  • Fourier transform
  • Generalized systems
  • n-order singular systems
  • State space
  • Transfer function

Cite this

@article{f7e5f4ca11f0496f98f16d6c479b61d1,
title = "A DFT-Based Algorithm for n-Order Singular State Space Systems",
abstract = "The discrete Fourier transform (DFT) is used for determining the coefficients of a transfer function for n-order singular linear systems, Ex (n) = Σi=1 n Aix (n+1) + Bu, where E may be singular. The algorithm is straight forward and easily can be implemented. Three step-by-step examples illustrating the application of the algorithm are presented.",
keywords = "Fourier transform, Generalized systems, n-order singular systems, State space, Transfer function",
author = "George Antoniou",
year = "2003",
month = "1",
day = "1",
language = "English",
volume = "14",
pages = "421--430",
journal = "Informatica",
issn = "0868-4952",
publisher = "IOS Press",
number = "4",

}

A DFT-Based Algorithm for n-Order Singular State Space Systems. / Antoniou, George.

In: Informatica, Vol. 14, No. 4, 01.01.2003, p. 421-430.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A DFT-Based Algorithm for n-Order Singular State Space Systems

AU - Antoniou, George

PY - 2003/1/1

Y1 - 2003/1/1

N2 - The discrete Fourier transform (DFT) is used for determining the coefficients of a transfer function for n-order singular linear systems, Ex (n) = Σi=1 n Aix (n+1) + Bu, where E may be singular. The algorithm is straight forward and easily can be implemented. Three step-by-step examples illustrating the application of the algorithm are presented.

AB - The discrete Fourier transform (DFT) is used for determining the coefficients of a transfer function for n-order singular linear systems, Ex (n) = Σi=1 n Aix (n+1) + Bu, where E may be singular. The algorithm is straight forward and easily can be implemented. Three step-by-step examples illustrating the application of the algorithm are presented.

KW - Fourier transform

KW - Generalized systems

KW - n-order singular systems

KW - State space

KW - Transfer function

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

M3 - Article

AN - SCOPUS:0742323873

VL - 14

SP - 421

EP - 430

JO - Informatica

JF - Informatica

SN - 0868-4952

IS - 4

ER -