Heuristic Searching Algorithm for Design Structurally Perfect Reconstruction Low Complex Filter Banks

  • Zhe Liu
  • Guangming Shi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4222)


Filter banks are found many applications for images and signal processing. A lower complex filter banks are desired for their effective implementation. In this paper, we address a problem how to design low complex filter banks. A perfect restructure (PR) filter banks can be factorized by lifting steps and the procedure of factorization are described as multi-fork tree-structure. A heuristic-searching algorithm was proposed for finding the optimization PR filter banks with low dynamical coefficients. The given examples show the proposed method is effective.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chan, S.C., et al.: Multiplierless perfect reconstruction modulated filter banks with sum-of-powers-of-two coefficients. IEEE SP Letters 8(6), 163–166 (2001)CrossRefGoogle Scholar
  2. 2.
    Ying-Jui, C., et al.: Theory and factorization for a class of structurally regular biorthogonal filter banks. IEEE Trans. on SP 54(2), 691–700 (2006)CrossRefGoogle Scholar
  3. 3.
    Daubechies, I.C., et al.: Factoring Wavelet transform into lifting steps. J. Fourier Analy Application, 247–269 (1998)Google Scholar
  4. 4.
    Shi, G.M., et al.: Design of structurally PR two-channel FIR filter banks with linear phase. Chinese Journal of Electronics 11(2), 1–4 (2002)Google Scholar
  5. 5.
    Vaidyanathan, P.P.: Multirate systems and filter banks. Prentice-Hall, Englewood Cliffs (1993)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Zhe Liu
    • 1
  • Guangming Shi
    • 2
  1. 1.School of ScienceNorthwestern Polytechnical UniversityXi’anChina
  2. 2.School of Electronic EngineeringXidian UniversityXi’anChina

Personalised recommendations