File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: The design of digital all-pass filters using second-order cone programming (SOCP)

TitleThe design of digital all-pass filters using second-order cone programming (SOCP)
Authors
KeywordsAll-pass digital filter
Bisection
Rouche's theorem
Second-order cone programming (SOCP)
Issue Date2005
PublisherIEEE.
Citation
Ieee Transactions On Circuits And Systems Ii: Express Briefs, 2005, v. 52 n. 2, p. 66-70 How to Cite?
AbstractThis brief proposes a new method for designing digital all-pass filters with a minimax design criterion using second-order cone programming (SOCP). Unlike other all-pass filter design methods, additional linear constraints can be readily incorporated. The overall design problem can be solved through a series of linear programming subproblems and the bisection search algorithm. The convergence of the algorithm is guaranteed. Nonlinear constraints such as the pole radius constraint of the filters can be formulated as additional SOCP constraints using Rouche's theorem. It was found that the pole radius constraint allows an additional tradeoff between the approximation error and the stability margin. The effectiveness of the proposed method is demonstrated by several design examples and comparison with conventional methods. © 2005 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/44720
ISSN
2006 Impact Factor: 0.922
2007 SCImago Journal Rankings: 1.092
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorChan, SCen_HK
dc.contributor.authorChen, HHen_HK
dc.contributor.authorPun, CKSen_HK
dc.date.accessioned2007-10-30T06:08:42Z-
dc.date.available2007-10-30T06:08:42Z-
dc.date.issued2005en_HK
dc.identifier.citationIeee Transactions On Circuits And Systems Ii: Express Briefs, 2005, v. 52 n. 2, p. 66-70en_HK
dc.identifier.issn1057-7130en_HK
dc.identifier.urihttp://hdl.handle.net/10722/44720-
dc.description.abstractThis brief proposes a new method for designing digital all-pass filters with a minimax design criterion using second-order cone programming (SOCP). Unlike other all-pass filter design methods, additional linear constraints can be readily incorporated. The overall design problem can be solved through a series of linear programming subproblems and the bisection search algorithm. The convergence of the algorithm is guaranteed. Nonlinear constraints such as the pole radius constraint of the filters can be formulated as additional SOCP constraints using Rouche's theorem. It was found that the pole radius constraint allows an additional tradeoff between the approximation error and the stability margin. The effectiveness of the proposed method is demonstrated by several design examples and comparison with conventional methods. © 2005 IEEE.en_HK
dc.format.extent306321 bytes-
dc.format.extent27162 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartofIEEE Transactions on Circuits and Systems II: Express Briefsen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2005 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.subjectAll-pass digital filteren_HK
dc.subjectBisectionen_HK
dc.subjectRouche's theoremen_HK
dc.subjectSecond-order cone programming (SOCP)en_HK
dc.titleThe design of digital all-pass filters using second-order cone programming (SOCP)en_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1549-7747&volume=52&issue=2&spage=66&epage=70&date=2005&atitle=The+design+of+digital+all-pass+filters+using+second-order+cone+programming+(SOCP)en_HK
dc.identifier.emailChan, SC:scchan@eee.hku.hken_HK
dc.identifier.authorityChan, SC=rp00094en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/TCSII.2004.840285en_HK
dc.identifier.scopuseid_2-s2.0-14744274474en_HK
dc.identifier.hkuros102826-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-14744274474&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume52en_HK
dc.identifier.issue2en_HK
dc.identifier.spage66en_HK
dc.identifier.epage70en_HK
dc.identifier.isiWOS:000226942700002-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridChan, SC=13310287100en_HK
dc.identifier.scopusauthoridChen, HH=35188516400en_HK
dc.identifier.scopusauthoridPun, CKS=7003931849en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats