Implementation of 2D discrete wavelet transform by number theoretic transform and 2D overlap-save method

4Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

To reduce the computation complexity of wavelet transform, this paper presents a novel approach to be implemented. It consists of two key techniques: (1) fast number theoretic transform(FNTT) In the FNTT, linear convolution is replaced by the circular one. It can speed up the computation of 2D discrete wavelet transform. (2) In two-dimensional overlap-save method directly calculating the FNTT to the whole input sequence may meet two difficulties; namely, a big modulo obstructs the effective implementation of the FNTT and a long input sequence slows the computation of the FNTT down. To fight with such deficiencies, a new technique which is referred to as 2D overlap-save method is developed. Experiments have been conducted. The fast number theoretic transform and 2D overlap-method have been used to implement the dyadic wavelet transform and applied to contour extraction in pattern recognition. © 2014 Lina Yang et al.

Cite

CITATION STYLE

APA

Yang, L., Tang, Y. Y., & Sun, Q. (2014). Implementation of 2D discrete wavelet transform by number theoretic transform and 2D overlap-save method. Mathematical Problems in Engineering, 2014. https://doi.org/10.1155/2014/532979

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free