Prime Coset Sum: A Systematic Method for Designing Multi-D Wavelet Filter Banks with Fast Algorithms

Youngmi Hur, Fang Zheng

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)


As constructing multi-D wavelets remains a challenging problem, we propose a new method called prime coset sum to construct multi-D wavelets. Our method provides a systematic way to construct multi-D non-separable wavelet filter banks from two 1-D lowpass filters, with one of which being interpolatory. Our method has many important features including the following: 1) it works for any spatial dimension, and any prime scalar dilation, 2) the vanishing moments of the multi-D wavelet filter banks are guaranteed by certain properties of the initial 1-D lowpass filters, and furthermore, 3) the resulting multi-D wavelet filter banks are associated with fast algorithms that are faster than the existing fast tensor product algorithms.

Original languageEnglish
Article number7565569
JournalIEEE Transactions on Information Theory
Issue number99
Publication statusPublished - 2016

Bibliographical note

Funding Information:
This research was supported in part by Yonsei New Faculty Research Seed Money Grant, National Research Foundation of Korea (NRF) Grants 20151003262 and 20151009350, and NSF Grant DMS-1115870.

Publisher Copyright:
© 2016 IEEE.

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


Dive into the research topics of 'Prime Coset Sum: A Systematic Method for Designing Multi-D Wavelet Filter Banks with Fast Algorithms'. Together they form a unique fingerprint.

Cite this