Chapter

Wavelet Analysis and Its Applications

Volume 2251 of the series Lecture Notes in Computer Science pp 336-340

Date:

Set of Decimators for Tree Structure Filter Banks

  • Wing-kuen LingAffiliated withDepartment of Electronic and Information Engineering, The Hong Kong Polytechnic University
  • , Peter Kwong-Shun TamAffiliated withDepartment of Electronic and Information Engineering, The Hong Kong Polytechnic University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

In this paper, we propose a novel method to test if a set of decimators can be generated by a tree structure filter bank. The decimation ratio is first sorted in an ascending order. Then we group the largest decimators with the same decimation ratio together and form a new set of decimators. A set of decimators can be generated by a tree structure filter bank if and only if by repeating the above procedure, all the decimators can be grouped together. Some examples are illustrated to show that the proposed method is simple and easy to implement.