2-D wavelet packet decomposition on multicomputers

In this work we describe and analyze algorithms for 2-D wavelet packet decomposition for MIMD distributed memory architectures. The main goal is the generalization of former parallel WP algorithms which are constrained to a number of processor elements equal to a power of 4. We discuss several optimizations and generalizations of data parallel message passing algorithms and finally compare the results obtained on a Cray T3D.