Fast GPU Implementation of Sparse Signal Recovery from Random Projections

Details Fast GPU Implementation of Sparse Signal Recovery from Random Projections Fast GPU Implementation of Sparse Signal Recovery from Random Projections

2008-09-10

arxiv.org/abs/0809.1833v2

Biology

Quantitative Biology

Quantitative Methods

accepted for publication in Engineering Letters, 8 pages, code included, references added

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Fast GPU Implementation of Sparse Signal Recovery from Random Projections does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast GPU Implementation of Sparse Signal Recovery from Random Projections, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast GPU Implementation of Sparse Signal Recovery from Random Projections will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-161855