New Linear-Programming-Based Filter Design

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
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2010003575OK.pdf268.84 kB
Adobe PDF
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: