n-Order linear state space systems: Computing the transfer function using the DFT

George E. Antoniou

doi:10.1016/j.amc.2005.01.005

n-Order linear state space systems: Computing the transfer function using the DFT

George E. Antoniou

Computer Science

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

Abstract

The discrete Fourier transform is used to determine the coefficients of a transfer function for n-order linear systems: x(n)=∑i=1nAix(n-i)+Bu. The algorithm is fast, straight forward and easily can be implemented. Two step-by-step examples, illustrating the application of the algorithm, are presented.

Original language	English
Pages (from-to)	1077-1084
Number of pages	8
Journal	Applied Mathematics and Computation
Volume	170
Issue number	2
DOIs	https://doi.org/10.1016/j.amc.2005.01.005
State	Published - 15 Nov 2005

Keywords

Fourier transform
Transfer function
n-order systems

Access to Document

10.1016/j.amc.2005.01.005

Cite this

@article{6cbfc1ec1d6d49c19017e00936feb307,

title = "n-Order linear state space systems: Computing the transfer function using the DFT",

abstract = "The discrete Fourier transform is used to determine the coefficients of a transfer function for n-order linear systems: x(n)=∑i=1nAix(n-i)+Bu. The algorithm is fast, straight forward and easily can be implemented. Two step-by-step examples, illustrating the application of the algorithm, are presented.",

keywords = "Fourier transform, Transfer function, n-order systems",

author = "Antoniou, {George E.}",

year = "2005",

month = nov,

day = "15",

doi = "10.1016/j.amc.2005.01.005",

language = "English",

volume = "170",

pages = "1077--1084",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

publisher = "Elsevier Inc.",

number = "2",

}

TY - JOUR

T1 - n-Order linear state space systems

T2 - Computing the transfer function using the DFT

AU - Antoniou, George E.

PY - 2005/11/15

Y1 - 2005/11/15

N2 - The discrete Fourier transform is used to determine the coefficients of a transfer function for n-order linear systems: x(n)=∑i=1nAix(n-i)+Bu. The algorithm is fast, straight forward and easily can be implemented. Two step-by-step examples, illustrating the application of the algorithm, are presented.

AB - The discrete Fourier transform is used to determine the coefficients of a transfer function for n-order linear systems: x(n)=∑i=1nAix(n-i)+Bu. The algorithm is fast, straight forward and easily can be implemented. Two step-by-step examples, illustrating the application of the algorithm, are presented.

KW - Fourier transform

KW - Transfer function

KW - n-order systems

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

U2 - 10.1016/j.amc.2005.01.005

DO - 10.1016/j.amc.2005.01.005

M3 - Article

AN - SCOPUS:27144508397

SN - 0096-3003

VL - 170

SP - 1077

EP - 1084

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

IS - 2

ER -

n-Order linear state space systems: Computing the transfer function using the DFT

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this