The design of FIR filters in the complex plane by convex optimization
- 1 October 1995
- journal article
- Published by Elsevier in Signal Processing
- Vol. 46 (2) , 127-146
- https://doi.org/10.1016/0165-1684(95)00077-q
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- An algorithm for complex linear approximation based on semi-infinite programmingNumerical Algorithms, 1993
- Design and characterization of optimal FIR filters with arbitrary phaseIEEE Transactions on Signal Processing, 1993
- Complex Chebyshev approximation for FIR digital filtersIEEE Transactions on Signal Processing, 1991
- Design of FIR filters in the complex domainIEEE Transactions on Acoustics, Speech, and Signal Processing, 1987
- A numerically stable dual method for solving strictly convex quadratic programsMathematical Programming, 1983
- Design of linear or minimum-phase fir filters by constrained chebyshev approximationSignal Processing, 1983
- A new method for Chebyshev approximation of complex-valued functionsMathematics of Computation, 1981
- Iterative technique for designing non-recursive digital filter non-linear phase characteristicsRadio and Electronic Engineer, 1976
- Optimizing non-recursive digital filters to non-liner phase characteristicsRadio and Electronic Engineer, 1974
- Newton's method for convex programming and Tchebycheff approximationNumerische Mathematik, 1959