Wavelet Packet Decomposition And Best Basis Selection On Massively Parallel SIMD Arrays

In this work we discuss algorithms for 2D wavelet packet decomposition and best basis selection on massively parallel 2D-mesh SIMD arrays. In contrast to the sequential case a complete wavelet packet decomposition shows the same computational complexity as a pyra-midal wavelet decomposition. Experimental results on a MasPar MP-2 connrm this property.

[1]  Hassane Essafi,et al.  Wavelet transform on parallel SIMD architectures , 1993, Defense, Security, and Sensing.

[2]  Jian Lu.  Parallelizing Mallat Algorithm for 2-D Wavelet Transforms , 1993, Inf. Process. Lett..

[3]  Tarek A. El-Ghazawi,et al.  Wavelet decomposition on high-performance computing systems , 1996, Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing.

[4]  Mats Holmström.  Parallelizing the Fast Wavelet Transform , 1995, Parallel Comput..

[5]  Mounir Hamdi.  Parallel architectures for wavelet transforms , 1993, 1993 Computer Architectures for Machine Perception.