Paper Info
Title
Design of FIR digital filters with discrete coefficients via convex relaxation
Abstract
Digital filters with discrete coefficients that can be expressed as sums of power of two (SP2) are of practical use because they admit fast implementations that do not require multiplications. In this paper, a new method for the design of finite-impulse-response (FIR) digital filters with SP2 coefficients by convex relaxation is proposed. The major difference of the proposed method from the semidefinite programming relaxation (SDPR) method proposed in the literature is that a sequential convex quadratic programming relaxation (QPR) in conjunction with a low-bit descent search technique replaces SDPR, yielding much reduced algorithmic complexity. Design examples are presented to illustrate the proposed algorithm and to demonstrate its near optimal performance against a weight least squares error measure.
Year
DOI
Venue
2005
10.1109/ISCAS.2005.1464966
ISCAS (2)
Keywords
Field
DocType
finite-impulse-response digital filters,fir digital filters,sp2 coefficients,quadratic programming,low-bit descent search technique,discrete coefficients,sequential convex quadratic programming relaxation,relaxation theory,near optimal performance,convex programming,reduced algorithmic complexity,search problems,sums of power of two,fir filters,polynomials,linear programming,finite impulse response,frequency response,finite impulse response filter,least squares approximation,algorithm design and analysis,digital filters,digital filter,design methodology
Least squares,Mathematical optimization,Algorithm design,Digital filter,Polynomial,Computer science,Control theory,Algorithm,Linear programming,Quadratic programming,Finite impulse response,Convex optimization
Conference
ISSN
ISBN
Citations 
0271-4302
0-7803-8834-8
4
PageRank 
References 
Authors
0.57
2
1
Name
Order
Citations
PageRank
Wu-Sheng Lu129624.90