Name
Abstract | ||
|---|---|---|
A scalable realisation of a two dimensional (2D) fast wavelet transform (FWT) is presented and compared to an earlier implementation of discrete wavelet transform (DWT), which uses matrix multiplication method. Parallelisation and mapping possibilities are analysed. The main emphasis is in minimising communication requirements and utilising local communication. Measured performance figures verify good performance and illustrate the benefits of parallel computation in Wavelet transform. The computation time of the FWT is only a fraction of the computation time of the previous implementation. |
Year | Venue | Keywords |
|---|---|---|
2000 | EUSIPCO | digital signal processing chips,discrete wavelet transforms,image coding,matrix multiplication,parallel processing,2d fwt,dsp realization,dwt,communication requirement,computation time,discrete wavelet transform,mapping possibility,matrix multiplication method,parallel computation,parallelisation possibility,two dimensional fast wavelet transform,filtering |
Field | DocType | ISBN |
Harmonic wavelet transform,Lifting scheme,Computer science,Parallel computing,Algorithm,Second-generation wavelet transform,Discrete wavelet transform,Stationary wavelet transform,Wavelet packet decomposition,Wavelet,Wavelet transform | Conference | 978-952-1504-43-3 |
Citations | PageRank | References |
1 | 0.40 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Haapala, K. | 1 | 1 | 0.40 |
| Kolinummi, P. | 2 | 1 | 0.40 |
| Timo Hämäläinen | 3 | 1603 | 194.30 |
| Jukka Saarinen | 4 | 264 | 46.21 |