Efficient design of cosine-modulated filter banks via convex optimization

Publication Type:
Journal Article
Citation:
IEEE Transactions on Signal Processing, 2009, 57 (3), pp. 966 - 976
Issue Date:
2009-03-10
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2010003561OK.pdf921.53 kB
Adobe PDF
This paper presents efficient approaches for designing cosine-modulated filter banks with linear phase prototype filter. First, we show that the design problem of the prototype filter being a spectral factor of 2M th-band filter is a nonconvex optimization problem with low degree of nonconvexity. As a result, the nonconvex optimization problem can be cast into a semi-definite programming (SDP) problem by a convex relaxation technique. Then the reconstruction error is further minimized by an efficient iterative algorithm in which the closed-form expression is given in each iteration. Several examples are given to illustrate the effectiveness of the proposed method over the existing ones. © 2009 IEEE.
Please use this identifier to cite or link to this item: