An algorithm is presented for calculating the 2D wavelet transform of a Toe
plitz matrix. The algorithm exploits the special form of the Toeplitz matri
x in order to reduce the number of operations required. More specifically,
it is shown that the number of 1D wavelet transformations that are necessar
y to carry out a sub-band decomposition can be reduced to eight.