By Topic

Fast Haar Transform Algorithms

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

2 Author(s)
P. R. Roeser ; Department of Systems Design, Faculty of Engineering, University of Waterloo ; M. E. Jernigan

In this correspondence the implementations of fast Haar transforms are examined. Previous algorithms are described and compared to a new implementation called the in place algorithm. By performing the transform in place and limiting the amount of data movement, the algorithm attains greater memory efficiency and speed than other known algorithms. Index Terms-Efficient algorithm, Haar transform, in place algorithms, orthogonal transforms.

Published in:

IEEE Transactions on Computers  (Volume:C-31 ,  Issue: 2 )