A VLSI-architecture for fast wavelet computations
M. Sauer, Jürgen Götze · 2003
A VLSI architecture for fast wavelet computations, i.e., for the construction of wavelet bases of arbitrary order and for the fast wavelet transform (FWT) using this basis, is presented. For the construction of the wavelet bases, an algebraic approach requiring only orthogonal matrix decompositions of the moment matrices and matrix-matrix multiplications is used. The FWT is executed on a dyadic tree of shuffle-like interconnections between the computational stages. These types of computation can be executed on a linear array of processors containing only adders and multipliers supported by a permutation network suited to VLSI and functioning as a shared memory.>