TRANSMISSION ZERO ASSIGNMENT USING SEMISTATE DESCRIPTIONS

In this note the problem of finite / infinite transmission zero assign ment is examined by squaring a system from the outputs to the inputs. In particular, we study this problem in two cases, state-accessible sy stems and partially state-accessible systems. We show that the problem of transmission zero assignment for state-accessible state-variable s ystems is equivalent to a pole-placement problem with state feedback f or a generalized system, which always has a solution. In the case of p artially state-accessible systems, we show that the transmission zero assignment problem is equivalent to a pole-placement problem with outp ut feedback for a generalized system. In both cases we exploit the blo ck Hessenberg form of the system and the extended lower triangular Hes senberg form in order to formulate this problem.