The parallel row-column method and the parallel polynomial transform algorithm are discussed. The algorithms are analyzed with the LogP model. After detailed analysis of the structure of one-and two-dimensional discrete wavelet transform, the paper proposes parallel algorithms for them. The algorithms need relatively small amount of communication time and are suitable for MPP or workstation clusters. Programs are made for them. Experiments on MPPs show that the algorithms are correct and high speedups are achieved. The methods can also be used for any kind of pyramid a Algorithm in signal processing.