Wavelet Packet Decomposition and Best Basis Selection on Massively Parallel Simd Arrays

@inproceedings{UhlDepartment1998WaveletPD,
  title={Wavelet Packet Decomposition and Best Basis Selection on Massively Parallel Simd Arrays},
  author={Andreas UhlDepartment},
  year={1998}
}
  • Andreas UhlDepartment
  • Published 1998
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.