By Topic

BOT's based on nonuniform filter banks

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
$33 $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

1 Author(s)
A. Makur ; Dept. of Electr. Commun. Eng., Indian Inst. of Sci., Bangalore, India

Parallels between orthogonal transforms and filter banks have been drawn before. Block orthogonal transform (BOT) is a special case of orthogonal transform where a nonoverlapping window is used. We relate BOTs to filter banks. Specifically, we show that any BOT can be shown as a perfect reconstruction filter bank, and any tree-structured perfect reconstruction filter bank or any orthonormal filter bank for which no filter length exceeds its decimation factor can be shown as a BOT. We then show that all conventional BOTs map to uniform filter banks. A construction method to design a BOT from any nonuniform filter bank is presented, and finding an optimal tree structure (in the sense of transform coding gain) for a given source is also discussed. The results show that the optimal, nonuniform BOT outperforms uniform BOTs having either the same number of bands or the same size in most cases

Published in:

IEEE Transactions on Signal Processing  (Volume:44 ,  Issue: 8 )