???ENUM_LANGUAGE_JA???
 
???mainMenu_lnkPrivacyPolicy??? ???mainMenu_lnkPolicy???

???ViewItemPage???


???ENUM_STATE_RELEASED???

???ENUM_GENRE_REPORT???

A parallel algorithm for the discrete orthogonal wavelet transform

???ViewItemOverview_lblSpecificAuthorsSection???

Uhlmann,  M.
Potsdam Institute for Climate Impact Research and Cooperation Partners;

???ViewItemOverview_lblExternalResourceSection???

https://www.pik-potsdam.de/en/output/publications/pikreports
(???ENUM_CONTENTCATEGORY_publisher-version???)

???ViewItemOverview_lblRestrictedFulltextSection???
???ViewItemOverview_noRestrictedFullTextsAvailable???
???ViewItemOverview_lblFulltextSection???

pr68.pdf
(???ENUM_CONTENTCATEGORY_any-fulltext???), 2???ViewItemMedium_lblFileSizeMB???

???ViewItemOverview_lblSupplementaryMaterialSection???
???ViewItemOverview_noSupplementaryMaterialAvailable???
???ViewItemOverview_lblCitationSection???

Uhlmann, M. (2000): A parallel algorithm for the discrete orthogonal wavelet transform, (PIK Report ; 68), Potsdam : Potsdam-Institut für Klimafolgenforschung, 26 p.


???ViewItemOverview_lblCiteAs???: https://publications.pik-potsdam.de/pubman/item/item_13331
???ViewItemOverview_lblAbstractSection???
We recall the basics of discrete orthogonal wavelet bases and show how a fast algorithm for the transform of n-dimensional data can be constructed and implemented on distributed memory machines. For this purpose, we use a ’slice’ representation of data across processors and restrict to the case of a power-of-two number of processors for simplicity. Some examples of the transform and filtering of two- and three-dimensional data are given. It is found that our parallel data-model leads to a satisfactory scalability of the algorithm.