Signal processing with the Matching Pursuit algorithm requires a parallel, scalable and well balanced implementation in order to be effective. Starting from a careful analysis of execution times, a scalable parallelization, based on explicit message passing, is presented. It is based on a regular scattered decomposition of the dictionary, which allows workload balancing. An experimental implementation is discussed and related timings are presented.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
Titolo: | A Scalable Parallel Algorithm for Matching Pursuit Signal Decomposition |
Autori: | |
Data di pubblicazione: | 1998 |
Rivista: | |
Abstract: | Signal processing with the Matching Pursuit algorithm requires a parallel, scalable and well balanced implementation in order to be effective. Starting from a careful analysis of execution times, a scalable parallelization, based on explicit message passing, is presented. It is based on a regular scattered decomposition of the dictionary, which allows workload balancing. An experimental implementation is discussed and related timings are presented. |
Handle: | http://hdl.handle.net/11567/195203 |
Appare nelle tipologie: | 01.01 - Articolo su rivista |
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.