A convex optimization method to solve a filter design problem

Authors:
Thanh Hieu Le;Marc Van Barel
Affiliations:
-;-
Venue:
Journal of Computational and Applied Mathematics
Year:
2014

Citing 4
Cited 0

Barrier functions in interior point methods

Mathematics of Operations Research
Optimization Problems over Positive Pseudopolynomial Matrices

SIAM Journal on Matrix Analysis and Applications
Convex Optimization

Convex Optimization
Linear matrix inequality formulation of spectral mask constraints with applications to FIR filter design

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	7.29

Visualization

Abstract

In this paper, we formulate the feasibility problem corresponding to a filter design problem as a convex optimization problem. Combined with a bisection rule, this leads to an algorithm for minimizing the design parameter in the filter design problem. A safety margin is introduced to solve the numerical difficulties when solving this type of problem numerically. Numerical experiments illustrate the validity of this approach for larger degrees of the filter as compared to similar previous algorithms.