Paper Info
Title
Design of FIR Filters with Discrete Coefficients via Polynomial Programming: Towards the Global Solution
Abstract
Polynomial programming (PP) deals with a class of optimization problems where both the objective function and constraint functions are multivariable polynomials. PP covers several popular classes of convex optimization problems such as linear, convex quadratic, semidefinite, and second-order cone programming problems, it also includes a good many non-convex problems that are encountered in engineering analysis and design. This paper describes a preliminary attempt to apply a recently developed PP algorithm to the design of FIR digital filters with discrete coefficients. Computer simulations are presented to demonstrate the efficiency of the PP-based algorithm and its ability to provide globally or near-globally optimal designs.
Year
DOI
Venue
2007
10.1109/ISCAS.2007.378500
ISCAS
Keywords
Field
DocType
polynomial programming,fir digital filters,multivariable polynomials,discrete coefficients,polynomial approximation,fir filters,convex optimization problems,convex optimization,design optimization,linear programming,computer simulation,fir filter,finite impulse response filter,algorithm design and analysis,quadratic programming,optimization problem,constraint optimization,objective function,digital filters,functional programming,global optimization,polynomials
Second-order cone programming,Mathematical optimization,Computer science,Control theory,Linear programming,Quadratic programming,Conic optimization,Optimization problem,Convex optimization,Semidefinite programming,Constrained optimization
Conference
ISSN
ISBN
Citations 
0271-4302
1-4244-0921-7
5
PageRank 
References 
Authors
0.54
12
2
Name
Order
Citations
PageRank
Wu-Sheng Lu132949.40
Takao Hinamoto215850.09