A numerical algorithm for stability testing 2-D recursive digital filters
Authors:
- G. GuGGG. Gu
- E.B. LeeELE.B. Lee
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems
- Vol. 37 (1) , 135-138
Abstract
A simple numerical algorithm is proposed for stability testing of 2-D recursive digital filters. It consists of a Cholesky factorization and a discrete cosine transform program as well as a table method for testing zero locations (with respect to the unit circle) of 1-D polynomials. Under the assumption of no essential singularities of the second kind, the stability of a given 2-D recursive digital filter can be determined in a finite number of steps. An example is worked out to illustrate the technique. It is shown that the algorithm compares very favorably with other stability testing methodsKeywords
This publication has 6 references indexed in Scilit:
- Zero location with respect to the unit circle of discrete-time linear system polynomialsProceedings of the IEEE, 1984
- A generalization of the zero location theorem of Schur and CohnIEEE Transactions on Automatic Control, 1980
- Stability of multidimensional scalar and matrix polynomialsProceedings of the IEEE, 1978
- A Fast Computational Algorithm for the Discrete Cosine TransformIEEE Transactions on Communications, 1977
- A correct proof of Huang's theorem on stabilityIEEE Transactions on Acoustics, Speech, and Signal Processing, 1976
- Stability of two-dimensional recursive filtersIEEE Transactions on Audio and Electroacoustics, 1972