The Community for Technology Leaders
Green Image
ABSTRACT
The widespread usage of the discrete wavelet transform (DWT) has motivated the development of fast DWT algorithms and their tuning on all sorts of computer systems. Several studies have compared the performance of the most popular schemes, known as filter bank scheme (FBS) and lifting scheme (LS), and have always concluded that LS is the most efficient option. However, there is no such study on streaming processors such as modern Graphics Processing Units (GPUs). Current trends have transformed these devices into powerful stream processors with enough flexibility to perform intensive and complex floating-point calculations. The opportunities opened up by these platforms, as well as the growing popularity of the DWT within the computer graphics field, make a new performance comparison of great practical interest. Our study indicates that FBS outperforms LS in current-generation GPUs. In our experiments, the actual FBS gains range between 10 percent and 140 percent, depending on the problem size and the type and length of the wavelet filter. Moreover, design trends suggest higher gains in future-generation GPUs.
INDEX TERMS
Discrete wavelet transforms, Filter bank, Computer graphics, Arithmetic, Computer architecture, Streaming media, Application software, Computer Society, Parallel processing, Parallel algorithms,Optimization, Graphics processors, Parallelprocessing, Parallel algorithms, Paralleland vector implementations, Wavelets and fractals, SIMD processors
CITATION
"Parallel Implementation of the 2D Discrete Wavelet Transform on Graphics Processing Units: Filter Bank versus Lifting", IEEE Transactions on Parallel & Distributed Systems, vol. 19, no. , pp. 299-310, March 2008, doi:10.1109/TPDS.2007.70716
99 ms
(Ver 3.3 (11022016))