Fast Algorithms for Wavelet Transform Computation
Olivier Rioul, Pierre Duhamel · 2007
this paper have regular structures, a criterion based on complexity is fairly instructive for comparing the various DWT algorithms. We have chosen the total number of operations (multiplications + additions) as the criterion. With today's technology, this criterion is generally more useful than the sole number of multiplications [14], at least for general purpose computers (another choice would have been to count the number of multiplication-accumulations, for implementations on Digital Signal Processors). From the operation counts above (44), it is clear that if all elementary cells require the same complexity, then a filter bank implementation of the DWT requires 2(1 \\Gamma 2