Improvements of a complex FIR filter design algorithm
Signal Processing
The design of FIR filters in the complex plane by convex optimization
Signal Processing
A Multiple-Exchange Algorithm for Complex Chebyshev Approximation by Polynomials on the Unit Circle
SIAM Journal on Numerical Analysis
Chebyshev digital FIR filter design
Signal Processing
Optimal design of FIR filters with the complex Chebyshev errorcriteria
IEEE Transactions on Signal Processing
Design of high-order Chebyshev FIR filters in the complex domainunder magnitude constraints
IEEE Transactions on Signal Processing
Peak-constrained least-squares optimization
IEEE Transactions on Signal Processing
Complex approximation of FIR digital filters by updating desired responses
IEEE Transactions on Signal Processing - Part I
Optimal design of complex FIR filters with arbitrary magnitude and group delay responses
IEEE Transactions on Signal Processing
Constrained least square design of FIR filters without specifiedtransition bands
IEEE Transactions on Signal Processing
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Minimax design of IIR digital filters using a sequential constrained least-squares method
IEEE Transactions on Signal Processing
A direct optimization method for low group delay FIR filter design
Signal Processing
| Hi-index | 35.69 |
Constrained least-squares design and constrained Chebyshev design of one- and two-dimensional nonlinear-phase FIR filters with prescribed phase error are considered in this paper by a unified semi-infinite positive-definite quadratic programming approach. In order to obtain unique optimal solutions, we propose to impose constraints on the complex approximation error and the phase error. By introducing a sigmoid phase-error constraint bound function, the group-delay error can be greatly reduced. A Goldfarb-Idnani based algorithm is presented to solve the semi-infinite positive-definite quadratic program resulting from the constrained least-squares design problem, and then applied after some modifications to the constrained Chebyshev design problem, which is proved in this paper to be equivalent also to a semi-infinite positive-definite quadratic program. Through design examples, the proposed method is compared with several existing methods. Simulation results demonstrate the effectiveness and efficiency of the proposed method.