By Topic

Algebraic theory of optimal filterbanks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jahromi, O.S. ; Dept. of Electr. & Comput. Eng., Univ. of Toronto, Ont., Canada ; Francis, B.A. ; Kwong, R.H.

We introduce an optimality theory for finite impulse response (FIR) filterbanks using a general algebraic point of view. We consider an admissible set L of FIR filterbanks and use scalability as the main notion based on which performance of the elements in Lare compared. We show that quantification of scalability leads naturally to a partial ordering on the set L. An optimal solution is, therefore, represented by the greatest element in L. It turns out that a greatest element does not necessarily exist in L. Hence, one has to settle with one of the maximal elements that exist in L. We provide a systematic way of finding a maximal element by embedding the partial ordering at hand in a total ordering. This is done by using a special class of order-preserving functions known as Schur-convex. There is, however, a price to pay for achieving a total ordering: there are infinitely many possible choices for Schur-convex functions, and the optimal solution specified in L depends on this (subjective) choice. An interesting aspect of the presented algebraic theory is that the connection between several concepts, namely, principal component filterbanks (PCFBs), filterbanks with maximum coding gain, and filterbanks with good scalability, is clearly revealed. We show that these are simply associated with different extremal elements of the partial ordering induced on L by scalability.

Published in:

Signal Processing, IEEE Transactions on  (Volume:51 ,  Issue: 2 )