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

George E. Antoniou

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

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

The discrete Fourier transform (DFT) is used for determining the coefficients of a transfer function for n-order singular linear systems, Ex ⁽ⁿ⁾ = Σ_i=1 ⁿ A_ix ⁽ⁿ⁺¹⁾ + 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 language	English
Pages (from-to)	421-430
Number of pages	10
Journal	Informatica
Volume	14
Issue number	4
State	Published - 1 Jan 2003

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 = "Antoniou, {George E.}",

year = "2003",

month = jan,

day = "1",

language = "English",

volume = "14",

pages = "421--430",

journal = "Informatica",

issn = "0868-4952",

publisher = "IOS Press",

number = "4",

}

TY - JOUR

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

AU - Antoniou, George E.

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

SN - 0868-4952

VL - 14

SP - 421

EP - 430

JO - Informatica

JF - Informatica

IS - 4

ER -

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

Abstract

Keywords

Other files and links

Fingerprint

Cite this