Algorithms and Programming Paradigms for 2-D Wavelet Packet Decomposition on Multicomputers and Multiprocessors

. In this work we describe and analyze algorithms for 2-D wavelet packet decomposition for multicomputers and multiprocessors. In the case of multicomputers we especially focus on the question of handling of the border data among the processing elements (PE). For multiprocessors we discuss several optimizations of data parallel algorithms and finally we compare the results obtained on a multiprocessor employing the message passing and data parallelism paradigm, respectively. 1 Introduction Wavelet packets [9] represent a generalization of the method of multiresolution decomposition and comprise the entire family of subband coded (tree) decompositions. Whereas in the wavelet case the decomposition is applied recursively to the coarse scale approximations (leading to the well known (pyramidal) wavelet decomposition tree), in the wavelet packet decomposition the recursive procedure is applied to all the coarse scale approximations and detail signals, which leads to a complete wavelet pa..