Set of Decimators for Tree Structure Filter Banks

  • Wing-kuen Ling
  • Peter Kwong-Shun Tam
Conference paper

DOI: 10.1007/3-540-45333-4_42

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2251)
Cite this paper as:
Ling W., Tam P.KS. (2001) Set of Decimators for Tree Structure Filter Banks. In: Tang Y.Y., Yuen P.C., Li C., Wickerhauser V. (eds) Wavelet Analysis and Its Applications. Lecture Notes in Computer Science, vol 2251. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Wing-kuen Ling
    • 1
  • Peter Kwong-Shun Tam
    • 1
  1. 1.Department of Electronic and Information EngineeringThe Hong Kong Polytechnic UniversityHung Hom, KowloonHong Kong Hong Kong Special Administrative Region, China

Personalised recommendations