Algorithm for positive realization of transfer functions

The aim of this brief is to present a finite-step algorithm for the positive realization of a rational transfer function H (z). In comparison with previously described algorithms we emphasize that we do not make an a priori assumption on (but, instead, include a finite step procedure for checking) the nonnegativity of the impulse-response sequence of H(z). For primitive transfer functions a new method for reducing the pole order of the dominant pole is also proposed.