A scalable parallel algorithm for matching pursuit signal decomposition

A scalable parallel algorithm for matching pursuit signal decomposition

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 sc...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Dodero, G., Gianuzzi, V., Moscati, M., Corvi, M.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Applied sciences
Data scattering
Exact sciences and technology
Information, signal and communications theory
Load Balancing
Matching Pursuit
Miscellaneous
Scalability
Signal Processing
Telecommunications and information theory
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0302-9743
1611-3349
DOI:10.1007/BFb0037173