Fast algorithms for wide sense stability of ARMA filters

The computational aspects of the algorithms for testing the strict sense and wise sense stability of discrete-time systems are studied. These algorithms are based on the computation of the reflection coefficients for a given real polynomial. The algorithms presented require one-half the number of multiplications and the same number of additions as compared to previously known similar algorithms.<<ETX>>

[1]  Philippe Delsarte,et al.  The split Levinson algorithm , 1986, IEEE Trans. Acoust. Speech Signal Process..

[2]  S.M. Kay,et al.  Spectrum analysis—A modern perspective , 1981, Proceedings of the IEEE.

[3]  Y. Bistritz.  Zero location with respect to the unit circle of discrete-time linear system polynomials , 1984 .

[4]  Messaoud Benidir,et al.  Extensions of the stability criterion for ARMA filters , 1987, IEEE Trans. Acoust. Speech Signal Process..

[5]  W. Rogosinski,et al.  The Geometry of the Zeros of a Polynomial in a Complex Variable , 1950, The Mathematical Gazette.