On the design of pole-zero approximations using a logarithmic error measure

For obtaining a pole-zero approximation of a linear, discrete-time system, a new method is presented which minimizes the squared difference between the log-magnitude spectrum of the system and that of the approximation. Using an iterative procedure, a locally optimal solution is found for the poles and zeros of the system approximation.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>