The Haar transform, HT, is defined recursively by:
The following structured, sparse matrix factorization represents a fast algorithm for a HT, size 8, and has been automatically generated (even in the presented Latex format) using the package AREP.
Note that this algorithm requires 8 multiplications and 14 additions and is thus among the best ones known.
O.k., you where not looking for math, but hoping to find good code for this (or other) transforms? No problem, get SPIRAL.