Title :
Balanced realization of Pade approximants of e-sT
Author_Institution :
Dept. of Syst. Eng., Australian Nat. Univ., Canberra, ACT, Australia
fDate :
9/1/1991 12:00:00 AM
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;
Journal_Title :
Automatic Control, IEEE Transactions on
