Robust envelope-constrained filter with orthonormal bases and semi-definite and semi-infinite programming

摘要

In this paper, the equivalence relation between a semi-infinite quadratically constrained convex quadratic programming problem and a combined semi-definite and semi-infinite programming problem is considered. Then, an efficient and reliable discretization algorithm for solving a general class of combined semi-definite and semi-infinite programming problems is developed. Both the continuous-time envelope-constrained optimal equalization filter and the corresponding robust envelope-constrained filter for a communication channel are solved by using the proposed algorithm.