Fast GPU Implementation of Sparse Signal Recovery from Random Projections
| dc.creator | Andrecut, M. | |
| dc.date | 2008-09-10 | |
| dc.date | 2009-01-25 | |
| dc.date.accessioned | 2026-07-07T12:33:36Z | |
| dc.date.available | 2026-07-07T12:33:36Z | |
| dc.description | We consider the problem of sparse signal recovery from a small number of random projections (measurements). This is a well known NP-hard to solve combinatorial optimization problem. A frequently used approach is based on greedy iterative procedures, such as the Matching Pursuit (MP) algorithm. Here, we discuss a fast GPU implementation of the MP algorithm, based on the recently released NVIDIA CUDA API and CUBLAS library. The results show that the GPU version is substantially faster (up to 31 times) than the highly optimized CPU version based on CBLAS (GNU Scientific Library). | |
| dc.description | accepted for publication in Engineering Letters, 8 pages, code included, references added | |
| dc.identifier | https://arxiv.org/abs/0809.1833 | |
| dc.identifier | http://arxiv.org/abs/0809.1833 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/217184 | |
| dc.subject | Quantitative Methods | |
| dc.subject | Data Analysis, Statistics and Probability | |
| dc.title | Fast GPU Implementation of Sparse Signal Recovery from Random Projections | |
| dc.type | text |