Abstract
This paper compares various software implementations of the 2D binary-tree wavelet decomposition by analyzing the data-related cache penalties in processor-based platforms. Such penalties appear to be the dominant factors that determine performance in this type of application. The comparisons include various image-scanning techniques, from the classical row-column approach to the local wavelet transform and the line-based wavelet transform, which are proposed in the framework of multimedia coding standards. For a conflict-free cache model, a theoretical framework is constructed allowing for predictions of the data-cache penalties that are expected to diminish the system performance. The theoretical results are verified with measurements from simulations and also from a real platform.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
