Quadraturemirror filter(QMF)bank with multi-criterion constraints suchas minimal aliasing and/or minimal error coding is amongthe most important problems in filter bank design, for solving which linear algebra-based methods are still heuristic and do not always work, especiallyfor large filterlength. It is shownin this paper that when filters are of nonlinear phase this problem can be reduced to convex linear matrix inequality (LMI) optimization, which can be very efficiently solved either by the standard LMI solvers or our previously developed solver. The proposed computationally tractable optimization formulations are confirmed by several simulations.
H. D. Tuan, L. H. Nam, H. Tuy, T. Q. Nguyen