Issue No.02 - February (1982 vol.31)
P.R. Roeser , Department of Systems Design, Faculty of Engineering, University of Waterloo
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.
P.R. Roeser, "Fast Haar Transform Algorithms", IEEE Transactions on Computers, vol.31, no. 2, pp. 175-177, February 1982, doi:10.1109/TC.1982.1675965