The design of FIR filters in the complex plane by convex optimization

DOI10.1016/0165-1684(95)00077-QzbMath0875.93531OpenAlexW2086398734WikidataQ127124551 ScholiaQ127124551MaRDI QIDQ1350308

Rembert Reemtsen, Alexander W. Potchinkov

Publication date: 27 February 1997

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0165-1684(95)00077-q

zbMATH Keywords

OptimizationFIR filterSemi-infinite programmingFilter designConstrained Chebyshev approximation

Mathematics Subject Classification ID

Filtering in stochastic control theory (93E11) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (10)

Corrected sequential linear programming for sparse minimax optimization ⋮ THE SIMULTANEOUS APPROXIMATION OF MAGNITUDE AND PHASE BY FIR DIGITAL FILTERS. I: A NEW APPROACH ⋮ Feasible Method for Semi-Infinite Programs ⋮ Applications of second-order cone programming ⋮ FIR filter design problems of simultaneous approximation of magnitude and phase and magnitude and group delay ⋮ A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods ⋮ Relative entropy optimization and its applications ⋮ A cutting plane method for solving minimax problems in the complex plane ⋮ Design approximation problems for linear-phase nonrecursive digital filters ⋮ Unnamed Item

Uses Software

• COCA

This page was built for publication: The design of FIR filters in the complex plane by convex optimization