On the unit circle problem: The Schur-Cohn procedure revisited

Signal Processing

Volumn 26, Issue 1, 1992, Pages 95-118

  Stoica, Petre ^a   Moses, Randolph L ^b  

^a UNIVERSITY POLITEHNICA OF BUCHAREST   (Romania)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

discrete time system stability; frequency estimation; polynomial zero distribution; Schur Cohn procedure; spectral estimation; stabilization; wide sense stability

Indexed keywords

COMPUTER PROGRAMMING--ALGORITHMS; SIGNAL PROCESSING; SYSTEMS SCIENCE AND CYBERNETICS--IDENTIFICATION;

SCHUR-COHN PROCEDURE; SYMMETRIC POLYNOMIALS; UNIT CIRCLE;

MATHEMATICAL TECHNIQUES;

EID: 0026679913     PISSN: 01651684     EISSN: None     Source Type: Journal    
DOI: 10.1016/0165-1684(92)90057-4     Document Type: Article

References (35)

1. Further comments on “Elimination of singular cases in Jury's test”
2. Some properties of Hermitian Toeplitz matrices in the singular case
3. Extensions of the stability criterion for ARMA filters
4. Comparisons between some stability criteria of discrete-time filters
5. Zero location with respect to the unit circle of discrete-time linear system polynomials
6. Sequences with positive semi-definite Fourier transforms
7. Stability tests for singular cases of discrete systems
8. On the Routh-Hurwitz-Fujiwara and Schur-Cohn-Fujiwara theorems for the root-seperation problem
9. A solution of the unit circle problem via Schwarz canonical form
10. Pseudo-lossless functions with application to the problem of locating the zeros of a polynomial
11. A generalization of the Levinson algorithm for Hermitian Toeplitz matrices with any rank profile
12. A note on the new 1-D and 2-D stability theorems for discrete systems
13. Linear prediction in the singular case and the stability of eigen models
14. A note on the reduced Schur-Cohn criterion
15. A note on the generalized test for discrete system stability
16. On zero location with respect to the unit circle of discrete-time linear system polynomials
17. Computationally efficient stepup and stepdown procedures for real predictor coefficients
18. A generalized test for discrete system stability
19. Determining the closest stable polynomial to an unstable one
20. On non-negative definiteness of estimated moving average autocovariance sequences
21. An efficient linear method for ARMA spectral estimation
22. A geometric root distribution criterion
23. A simplification of Jury's tabular form
24. Counting zeros of real polynomials within the unit disk
25. A stability theorem for discrete systems
26. Algebraic criteria for positive realness to the unit circle
27. An algorithm for testing stability of discrete systems
28. Some new results on discrete system stability
29. On another approach to the Schur-Cohn criterion
30. On the singular case of Raible's algorithm for determining discrete-system pole distribution