New Linear-Programming-Based Filter Design

Tuan, HD; Son, TT; Tuy, H; Nguyen, T

New Linear-Programming-Based Filter Design

Tuan, HD

Son, TT Tuy, H Nguyen, T

Permalink

Publication Type:: Journal Article
Citation:: IEEE Transactions on Circuits and Systems II: Express Briefs, 2005, 52 (5), pp. 276 - 281
Issue Date:: 2005-05-05

Closed Access

	Filename	Description	Size
	2010003575OK.pdf		268.84 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Tuan, HD https://orcid.org/0000-0003-0292-6061	en_US
dc.contributor.author	Son, TT	en_US
dc.contributor.author	Tuy, H	en_US
dc.contributor.author	Nguyen, T	en_US
dc.date.issued	2005-05-05	en_US
dc.identifier.citation	IEEE Transactions on Circuits and Systems II: Express Briefs, 2005, 52 (5), pp. 276 - 281	en_US
dc.identifier.issn	1549-7747	en_US
dc.identifier.uri	http://hdl.handle.net/10453/15461
dc.description.abstract	It is well known that the filter-design problem with mask constraints can be formulated as a semi-infinite program. There are two approaches toward the solution of this semi-infinite program. The first griding approach relaxes the semi-infinite constraint by refining it in the finite griding domain so it does not always guarantee global optimal and feasible solution. The second semi-definite programming (SDP)-based approach does guarantee the global optimal solution and excellently handles positive real constraints. However, the magnitude constraints are still persistent and not yet handled by SDP tool in an efficient manner. In this brief, a new tight polyhedral approximation for semi-infinite constrained domain is proposed. Based on it, we present a new linear-programming-based solution method for filter design, which unlike the griding approach yields global solution and unlike SDP based approach is practical for even long-tap filters. Simulation results confirm the viability of the proposed method. © 2005, The Institute of Electrical and Electronics Engineers, Inc. All rights reserved.	en_US
dc.relation.ispartof	IEEE Transactions on Circuits and Systems II: Express Briefs	en_US
dc.relation.isbasedon	10.1109/TCSII.2005.846880	en_US
dc.subject.classification	Electrical & Electronic Engineering	en_US
dc.title	New Linear-Programming-Based Filter Design	en_US
dc.type	Journal Article
utslib.citation.volume	5	en_US
utslib.citation.volume	52	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
dc.location.activity	ISI:000229356100010	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
utslib.copyright.status	closed_access
pubs.issue	5	en_US
pubs.publication-status	Published	en_US
pubs.volume	52	en_US

Abstract:

It is well known that the filter-design problem with mask constraints can be formulated as a semi-infinite program. There are two approaches toward the solution of this semi-infinite program. The first griding approach relaxes the semi-infinite constraint by refining it in the finite griding domain so it does not always guarantee global optimal and feasible solution. The second semi-definite programming (SDP)-based approach does guarantee the global optimal solution and excellently handles positive real constraints. However, the magnitude constraints are still persistent and not yet handled by SDP tool in an efficient manner. In this brief, a new tight polyhedral approximation for semi-infinite constrained domain is proposed. Based on it, we present a new linear-programming-based solution method for filter design, which unlike the griding approach yields global solution and unlike SDP based approach is practical for even long-tap filters. Simulation results confirm the viability of the proposed method. © 2005, The Institute of Electrical and Electronics Engineers, Inc. All rights reserved.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/15461