Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.


Algorithm for constructing symmetric dual framelet filter banks
HTML articles powered by AMS MathViewer

by Bin Han PDF
Math. Comp. 84 (2015), 767-801 Request permission


Dual wavelet frames and their associated dual framelet filter banks are often constructed using the oblique extension principle. In comparison with the construction of tight wavelet frames and tight framelet filter banks, it is indeed quite easy to obtain some particular examples of dual framelet filter banks with or without symmetry from any given pair of low-pass filters. However, such constructed dual framelet filter banks are often too particular to have some desirable properties such as balanced filter supports between primal and dual filters. From the point of view of both theory and application, it is important and interesting to have an algorithm which is capable of finding all possible dual framelet filter banks with symmetry and with the shortest possible filter supports from any given pair of low-pass filters with symmetry. However, to our best knowledge, this issue has not been resolved yet in the literature and one often has to solve systems of nonlinear equations to obtain nontrivial dual framelet filter banks. Given the fact that the construction of dual framelet filter banks is widely believed to be very flexible, the lack of a systematic algorithm for constructing all dual framelet filter banks in the literature is a little bit surprising to us. In this paper, by solving only small systems of linear equations, we shall completely settle this problem by introducing a step-by-step efficient algorithm to construct all possible dual framelet filter banks with or without symmetry and with the shortest possible filter supports. As a byproduct, our algorithm leads to a simple algorithm for constructing all symmetric tight framelet filter banks with two high-pass filters from a given low-pass filter with symmetry. Examples will be provided to illustrate our algorithm. To explain and to understand better our algorithm and dual framelet filter banks, we shall also discuss some properties of our algorithms and dual framelet filter banks in this paper.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2010): 42C40, 42C15
  • Retrieve articles in all journals with MSC (2010): 42C40, 42C15
Additional Information
  • Bin Han
  • Affiliation: Department of Mathematical and Statistical Sciences, University of Alberta, Edmonton, Alberta, Canada T6G 2G1
  • MR Author ID: 610426
  • Email:
  • Received by editor(s): July 23, 2013
  • Published electronically: August 5, 2014
  • Additional Notes: This research was supported in part by the Natural Sciences and Engineering Research Council of Canada (NSERC Canada) under Grant RGP 228051.
  • © Copyright 2014 American Mathematical Society
    The copyright for this article reverts to public domain 28 years after publication.
  • Journal: Math. Comp. 84 (2015), 767-801
  • MSC (2010): Primary 42C40, 42C15
  • DOI:
  • MathSciNet review: 3290963