<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article"><front><journal-meta><journal-id journal-id-type="publisher-id">INFORMATICA</journal-id><journal-title-group><journal-title>Informatica</journal-title></journal-title-group><issn pub-type="epub">0868-4952</issn><issn pub-type="ppub">0868-4952</issn><publisher><publisher-name>VU</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">inf14401</article-id><article-id pub-id-type="doi">10.15388/Informatica.2003.031</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research article</subject></subj-group></article-categories><title-group><article-title>A DFT‐Based Algorithm for n‐Order Singular State Space Systems<xref ref-type="fn" rid="fn1"><sup>✩</sup></xref></article-title></title-group><contrib-group><contrib contrib-type="Author"><name><surname>Antoniou</surname><given-names>George E.</given-names></name><email xlink:href="mailto:george.antoniou@montclair.edu">george.antoniou@montclair.edu</email><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/></contrib><aff id="j_INFORMATICA_aff_000">Image Processing and Systems Laboratory, Department of Computer Science, Montclair State University, Montclair, N.J 07043 USA</aff></contrib-group><author-notes><fn id="fn1"><label><sup>✩</sup></label><p>Research supported by Margaret and Herman Sokol Faculty Fellow Award and MSU2002 FSIP.</p></fn></author-notes><pub-date pub-type="epub"><day>01</day><month>01</month><year>2003</year></pub-date><volume>14</volume><issue>4</issue><fpage>421</fpage><lpage>430</lpage><history><date date-type="received"><day>01</day><month>07</month><year>2003</year></date></history><abstract><p>The discrete Fourier transform (DFT) is used for determining the coefficients of a transfer function for n‐order singular linear systems, Ex<sup>(n)</sup>=Σ<inf>i=1</inf><sup>n</sup>A<inf>i</inf>x<sup>(n−1)</sup>+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.</p></abstract><kwd-group><label>Keywords</label><kwd>n‐order singular systems</kwd><kwd>generalized systems</kwd><kwd>state space</kwd><kwd>transfer function</kwd><kwd>Fourier transform</kwd></kwd-group></article-meta></front></article>