• DocumentCode
    1322336
  • Title

    Balanced realization of Pade approximants of e-sT

  • Author

    Lam, James

  • Author_Institution
    Dept. of Syst. Eng., Australian Nat. Univ., Canberra, ACT, Australia
  • Volume
    36
  • Issue
    9
  • fYear
    1991
  • fDate
    9/1/1991 12:00:00 AM
  • Firstpage
    1096
  • Lastpage
    1100
  • Abstract
    An algorithm to calculate the balanced realization of all-pass Pade approximants of e-sT is presented. The algorithm makes use of a regular C-type continued fraction expansion of e-sT and a properly scaled recurrence formula is used to generate the coefficients of the Pade denominator polynomial. A truncation property of the balanced realization is discussed
  • Keywords
    approximation theory; polynomials; Pade denominator polynomial; all-pass Pade approximants; balanced realization; recurrence formula; truncation property; Artificial intelligence; Automatic control; Maximum likelihood estimation; Parameter estimation; Polynomials; Signal processing algorithms; Speech; Statistics; Testing; Time series analysis;
  • fLanguage
    English
  • Journal_Title
    Automatic Control, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9286
  • Type

    jour

  • DOI
    10.1109/9.83547
  • Filename
    83547
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1322336