Abstract
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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
