Abstract
This paper presents new recursive procedures for designing optimum envelope-constrained (EC) filters. Using a constraint transcription technique, the inequality constrained quadratic programming problem associated with EC filtering can be approximated as an unconstrained minimization problem. Two types of optimization methods are developed to solve this unconstrained problem in a recursive adjusting manner. Simulations of the proposed recursive procedures are presented which support the theoretical predictions.
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.
