A new algorithm to test the stability of 2-D digital recursive filters
| Autor: | Michel Barret, Messaoud Benidir |
|---|---|
| Rok vydání: | 1994 |
| Předmět: |
Polynomial
Rank (linear algebra) Stability criterion Stability (learning theory) Control and Systems Engineering Signal Processing Computer Vision and Pattern Recognition Electrical and Electronic Engineering Infinite impulse response Digital filter Algorithm Software Variable (mathematics) Mathematics Numerical stability |
| Zdroj: | Signal Processing. 37:255-264 |
| ISSN: | 0165-1684 |
| Popis: | Any algorithm for testing the stability of 2-D digital recursive filters has to process a 2-D polynomial of degree n and m with respect to each variable. The number of computations needed by the algorithm can be expressed as a polynomial of the variables n and m . The total degree of this polynomial defines the complexity order of the algorithm. In this paper we establish that the matrix associated with Bezout's resultant appearing in the stability test of causal or semicausal recursive filters has 2 as its displacement rank. This permits us to apply the generalized Levinson-Szego algorithm to derive a new algorithm for testing the 2-D digital filters' stability. This algorithm is proposed for quarter-plane or nonsymmetric half-plane recursive filters with real coefficients and without nonessential singularities of the second kind. Its complexity order is equal to 4. Note that the complexity order of the fastest existing algorithms is equal to 5. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|