By Topic

Scalability of 2-D wavelet transform algorithms: analytical and experimental results on MPPs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Patel, J.N. ; Intel Archit. Product Div., Oracle Corp., Redwood Shores, CA, USA ; Khokhar, A.A. ; Jamieson, L.H.

This paper studies the scalability of two-dimensional (2-D) discrete wavelet transform (DWT) algorithms on massively parallel processors (MPPs). The principal operation in the 2-D DWT is the filtering operation used to implement the filter banks of the 2-D subband decomposition. This filtering operation can be implemented as a convolution in the time domain or as a multiplication in the frequency domain. We demonstrate that there exist combinations of machine size, image size, and wavelet kernel size for which the time-domain algorithms outperform the frequency domain algorithms and vice-versa. We therefore demonstrate that a hybrid approach that combines time- and frequency-domain approaches can yield linear scalability for a broad range of problem and machine sizes. Furthermore, we show the effect of processor speed versus communication overhead and the use of separable versus nonseparable wavelets on the crossover points between the algorithm approaches.

Published in:

Signal Processing, IEEE Transactions on  (Volume:48 ,  Issue: 12 )