Referenced Items are not available for this document.
Sequential quadratic programming (SQP) algorithms are widely recognized to be among the most successful algorithms for general constrained optimization. This paper attempts to develop an SQP-based method for equiripple FIR filters with low group delay. We explain how the complimentarily conditions in an SQP design algorithm help reduce the amount of computation required to update the Lagrange multipliers in a significant manner. Design examples are presented to illustrate the algorithm's performance that compares favorably with several existing design methods.
Published in:
Circuits and Systems, 2004. ISCAS '04. Proceedings of the 2004 International Symposium on
(Volume:3
)
Date of Conference: 23-26 May 2004
- Page(s):
- III - 117-20 Vol.3
- Print ISBN:
- 0-7803-8251-X
- INSPEC Accession Number:
- 8066175
- Digital Object Identifier :
- 10.1109/ISCAS.2004.1328697
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
