## With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

No credit card required

## 10.2. The Schur-Cohn criterion

In this section, we will present an algorithm that helps us learn, in a finite number of steps, if the following complex polynomial:

has all its zeros inside the unit disk; that is, in the subset:

For that, we introduce the polynomials and P*(z) represented as follows:

obtained by conjugating3 the coefficients of P(z) without conjugating the variable and

obtained by conjugating and inversing the order of the coefficients of P(z). The polynomial P*(z) is then called the reciprocal polynomial of P(z).

EXAMPLE 10.4.- the polynomial P(z) = (2 + j)z3 + 3z admits, for reciprocal polynomial P*(z) = 3z2 + (2 − j).

COMMENT 10.1.- the reciprocal polynomials P*(z) and satisfy the following equality:

Now, from the polynomial PN(z) = P(z), we construct a family of

## With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

No credit card required