Algorithms and programming paradigms for 2-D wavelet packet decomposition on multicomputers and multiprocessors

8Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this work we describe and analyze algorithms for 2-D wavelet packet decomposition for multicomputers and multiprocessors. In the case of multicomputers we especially focus on the question of handling of the border data among the processing elements. For multiprocessors we discuss several optimizations of data parallel algorithms and finally we compare the results obtained on a multiprocessor employing the message passing and data parallelism paradigm, respectively.

Cite

CITATION STYLE

APA

Feil, M., & Uhl, A. (1999). Algorithms and programming paradigms for 2-D wavelet packet decomposition on multicomputers and multiprocessors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1557, pp. 367–376). Springer Verlag. https://doi.org/10.1007/3-540-49164-3_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free