Fast Haar Transform Algorithms
- 1 February 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-31 (2) , 175-177
- https://doi.org/10.1109/tc.1982.1675965
Abstract
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.Keywords
This publication has 4 references indexed in Scilit:
- Orthogonal Transforms for Digital Signal ProcessingPublished by Springer Nature ,1975
- On the Application of Haar FunctionsIEEE Transactions on Communications, 1973
- Transmission of Information by Orthogonal FunctionsPublished by Springer Nature ,1969
- Zur Theorie der orthogonalen FunktionensystemeMathematische Annalen, 1910