Abstract
In this paper, we consider a globally optimal design of IIR filters. We formulate the design problem as a nonconvex optimization problem with a continuous inequality constraint and a nonconvex constraint. To solve this problem, the constraint transcription method is applied to tackle the continuous inequality constraint. In order to avoid the obtained solution being on the boundary of the feasible set, more than one initial points are used. Moreover, since the objective and the constraints are nonconvex functions, there may be many local minima. To address this problem, the filled function method is applied to escape from the local minima. Some numerical computer simulation results are presented to illustrate the effectiveness and efficiency of the proposed method.
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.
