On the design of 1D IIR digital filters with coefficients of finite word length
N. Papamarkos, George Vachtsevanos · International Journal of Circuit Theory and Applications · 1991
Abstract This paper presents new linear programming techniques for the design of optimal 1D IIR digital filters. the first method is based on a linear minimax criterion and leads to a linear programming approximation problem whose optimal solution is attained by a new fast algorithm. Next, the linear minimax approximation problem is extended and formulated as two linear integer programming problems which permit the design of 1D IIR digital filters with coefficients of finite word length. the first of these methods is formulated as a 0‐1 integer linear programming problem and its optimal solution is attained rapidly by a new algorithm. This method appears to be suitable for the design of high‐order digital filters. the second method is more general and is formulated as a mixed integer linear programming problem. to solve the design problem efficiently, a new integer tree search algorithm is introduced. the feasibility of the proposed algorithms is illustrated with detailed solutions or numerical examples.