Abstract
Many filter design problems in signal processing can be formulated as a quadratic programming problem with linear inequality constraints. The authors present new recursive procedures for solving this kind of problem. Using a constraint transcription technique, this inequality constrained quadratic programming problem can be approximated as an unconstrained minimisation problem. Two types of optimisation methods are developed to solve this unconstrained problem in a recursive adjusting manner. Analysis and simulation results on the proposed recursive procedures applied to the design of envelope-constrained filters are presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEE Proceedings - Vision, Image, and Signal Processing
Disclaimer: 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.