Multidimensional Filter Banks and Wavelets 1997
DOI: 10.1007/978-1-4757-5922-8_8
|View full text |Cite
|
Sign up to set email alerts
|

On the Scalability of 2-D Discrete Wavelet Transform Algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
17
0

Year Published

1999
1999
2006
2006

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(17 citation statements)
references
References 13 publications
0
17
0
Order By: Relevance
“…A significant amount of work has been done for MIMD parallelization [12,20,8] and old SIMD arrays [15,1,7]. The use of SIMD extensions of modern general purpose processors for wavelet transforms is investigated in [19,2] together with extensive cache optimizations.…”
Section: Introductionmentioning
confidence: 99%
“…A significant amount of work has been done for MIMD parallelization [12,20,8] and old SIMD arrays [15,1,7]. The use of SIMD extensions of modern general purpose processors for wavelet transforms is investigated in [19,2] together with extensive cache optimizations.…”
Section: Introductionmentioning
confidence: 99%
“…For parallelizing the 2D a`trous algorithm we choose the Stripped-partitioning scheme because it has been shown to be the most suitable one for implementations using the message passing paradigm (see [26] for a corresponding investigation for the FWT -the alternative Checkerboard-partitioning, scheme requires a higher amount of smaller messages to be sent).…”
Section: Message Passing Paradigmmentioning
confidence: 99%
“…A significant amount of work has been done for MIMD parallelization [2,3,4] and old SIMD arrays [5,6,7]. The use of SIMD extensions of modern general purpose processors for wavelet transforms is investigated for the 2-D case in [8,9].…”
Section: Introductionmentioning
confidence: 99%