Abstract
In this paper we consider the l 1-compressive sensing problem. We propose an algorithm specifically designed to take advantage of shared memory, vectorized, parallel and many-core microprocessors such as the Cell processor, new generation Graphics Processing Units (GPUs) and standard vectorized multi-core processors (e.g. quad-core CPUs). Besides its implementation is easy. We also give evidence of the efficiency of our approach and compare the algorithm on the three platforms, thus exhibiting pros and cons for each of them.
Original language | English (US) |
---|---|
Pages (from-to) | 1-20 |
Number of pages | 20 |
Journal | Journal of Signal Processing Systems |
Volume | 71 |
Issue number | 1 |
DOIs | |
State | Published - Apr 2013 |
Externally published | Yes |
Bibliographical note
Funding Information:Acknowledgements The research of A. Borghi on this work has been done while being at the mathematics department of UCLA and being supported by the ONR grant N000140710810. The research of J. Darbon and S. Osher was supported by ONR grant N000140710810. The research of T. Chan was supported by DMS-0610079 and ONR N00014-06-1-0345. This works has been supported in part by French National Research Agency (ANR) through COSINUS program project (MIDAS no. ANR-09-COSI-009).
Keywords
- Compressed sensing
- Optimization algorithm
- Parallel architecture
- Vectorized architecture
ASJC Scopus subject areas
- Control and Systems Engineering
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Modeling and Simulation
- Hardware and Architecture