Abstract
The quadrature mirror filter (QMF) bank with multicriterion constraints such as minimal aliasing and/or minimal error coding is among the most important problems in filterbank design, for solving which linear algebra-based methods are still heuristic and do not always work, especially for large filter length. It is shown in this paper that this problem can be reduced either to convex linear matrix inequality (LMI) optimization (when filters are of nonlinear phase) or to semi-infinite linear (SIP) programming (when filters are of linear phase), which can be very efficiently solved either by the standard LMI solvers or our previously developed SIP solver. The proposed computationally tractable optimization formulations are confirmed by several simulations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
