By Topic

Performance comparison of DWT scheduling alternatives on programmable platforms

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

6 Author(s)
Zervas, N.D. ; Dept. of Electr. & Comput. Eng., Patras Univ., Greece ; Tagopoulos, I. ; Spiliotopoulos, V. ; Anagnostopoulos, G.P.
more authors

The Discrete Wavelet Transformations (DWT) are data intensive algorithms. Energy dissipation and execution time of such algorithms heavily depends on data memory hierarchy performance when programmable platforms are considered. Existing filtering operations scheduling alternatives for the 1D-DWT, employ different levels of data access locality. However locality of data references, usually comes at the expense of complex control and addressing. In this paper, the two main scheduling alternatives for the 1D-DWT are compared in terms of energy and speed. Additionally, we describe and evaluate the effect of an in-place mapping scheme, which minimizes memory requirements and improves locality of data reference, for the 1D-DWT. As execution platform, two commercially available general purpose processors are used

Published in:

Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on  (Volume:2 )

Date of Conference:

6-9 May 2001