Parallel Algorithms for the Two-Dimensional Discrete Wavelet Transform

We present in this paper two parallel algorithms for the two-dimensional discrete wavelet transform. A mathematical model for the computation vs. communication tradeoff for these algorithms is presented and the scalability of the algorithms is analyzed. The wormhole routing model was used to model the communication costs involved. The algorithms were implemented on the Connection Machine-5 (CM-5^{a}). The theoretical results obtained were validated by the simulations on the CM-5.