By Topic

On block architectures for discrete wavelet transform

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
$33 $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)
M. Weeks ; Center for Adv. Comput. Studies, Univ. of Southwestern Louisiana, Lafayette, LA, USA ; J. Limqueco ; M. Bayoumi

Architectures for the discrete wavelet transform (DWT) operate typically on a sequential input. This input consists of a single data value every clock cycle. While this can be efficient for 1-D applications, 2-D ones, such as image processing, suffer from the dimensional direction bottleneck of the separable 2-D filter. The block-based architectures greatly reduce these on-chip memory requirements. Though the block-based architectures may take more computation time, the work can be divided among several processors. This paper demonstrates how a block processing architecture can be achieved, with advantages for the 2-dimensional DWT; less memory and parallel computation. Though the 2-D DWT in particular is discussed, these ideas apply to multi-dimensional cases as well.

Published in:

Signals, Systems & Computers, 1998. Conference Record of the Thirty-Second Asilomar Conference on  (Volume:2 )

Date of Conference:

1-4 Nov. 1998