Title :
On the optimality of the classical stability criteria for 1-D and 2-D digital recursive filters
Author :
Barret, M. ; Benidir, M.
Author_Institution :
Supelec, Metz, France
Abstract :
A bound for the complexity of any algebraic criterion, giving necessary and sufficient conditions for the stability of digital recursive filters, is proposed in the 1-D and 2-D cases. It is shown that the set of the 1-D Schur polynomials with a degree not greater than n, in the (n+1)-dimensional space of the polynomial coefficients, is convex and its boundary is a hypersurface which has an irreducible equation.<>
Keywords :
computational complexity; digital filters; polynomials; stability criteria; Schur polynomials; classical stability criteria; complexity; digital recursive filters; hypersurface; irreducible equation;
Conference_Titel :
Acoustics, Speech, and Signal Processing, 1993. ICASSP-93., 1993 IEEE International Conference on
Conference_Location :
Minneapolis, MN, USA
Print_ISBN :
0-7803-7402-9
DOI :
10.1109/ICASSP.1993.319436
