An Efficient SDP Based Design for Prototype Filters of M-Channel Cosine-Modulated Filter Banks

The paper presents an efficient semidefinite programming (SDP) based design for prototype filters of cosine-modulated filter banks (CMFBs). We consider a class of near-perfect reconstruction CMFBs with the linear phase prototype filter, which structurally eliminates the amplitude overall distortion. The prototype filter design problem is then formulated into a convex semi-infinite programming problem. Furthermore, to handle the semi-infinite constraints, we use the linear matrix inequality (LMI) characterization of positive trigonometric polynomials to cast the semi-infinite programming problem into SDP one. Finally, convex duality is applied to transform the SDP into another SDP with the minimal number of additional variables, which is efficiently solved. An additional advantage of the proposed method is that we can precisely control the filter specifications.