An efficient linear programming solver for optimal filter synthesis
DOI10.1002/NLA.547zbMATH Open1199.65209OpenAlexW2122266675WikidataQ114852898 ScholiaQ114852898MaRDI QIDQ3392865FDOQ3392865
Authors: Jihong Ren, Chen Greif, Mark R. Greenstreet 
Publication date: 17 August 2009
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.547
Recommendations
- Efficient special purpose linear programming for FIR filter design
- Linear Programming Algorithms for Sparse Filter Design
- Design of optimal linear phase FIR filters by a semi-infinite programming technique
- A convex optimization method to solve a filter design problem
- Exact and Approximate Algorithms for the Filter Design Optimization Problem
- Optimal design of FIR linear phase digital filters via convex quadratic programming method
- Filter design: a finite dimensional convex optimization approach
- Semi-infinite linear programming: A unified approach to digital filter design with time- and frequency-domain specifications
- A Filter algorithm for solving mathematical programming with linear complementarity constraints
- Improved robust filter synthesis combining linear matrix inequalities and heuristic algorithms
linear programmingnumerical experimentsiterationfilter designintegrated circuitshigh data-rate communicationhigh-speed digital interconnectMehrotra's interior-point approachoptimal deconvolutionoptimal filter synthesis
Numerical mathematical programming methods (65K05) Linear programming (90C05) Applications of mathematical programming (90C90) Interior-point methods (90C51) Communication theory (94A05) Iterative numerical methods for linear systems (65F10) Analytic circuit theory (94C05)
Cites Work
Uses Software
This page was built for publication: An efficient linear programming solver for optimal filter synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392865)
