Abstract

This paper presents constrained /spl lscr/ /sub 2/ norm and L/sub /spl infin// norm optimal QMF banks designs. Both methods cast the design problems as a linear objective function minimization problem subject to linear matrix inequality (LMI) constraints, which are solved by semidefinite programming. The LMI constraints are shown to be convex. Consequently, the designed QMF banks are globally optimal with respect to the objective function.

Full Text
Published version (Free)

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 call