The design of weighted minimax quadrature mirror filters

A technique for converting the constrained nonlinear optimization problem encountered in the design of weighted minimax quadrature mirror filters into an iterative unconstrained nonlinear optimization problem is presented. This renders the design of weighted minimax quadrature mirror filters possible. The technique is very efficient, typically taking about seven iterations to converge. A rapidly converging iterative procedure for solving the above nonlinear unconstrained optimization problem is also presented. This procedure typically requires less than five iterations to converge.<
>