Fast and Efficient Compressive Sensing using Structurally Random Matrices

Details Fast and Efficient Compressive Sensing using Structurally Random Matrices Fast and Efficient Compressive Sensing using Structurally Random Matrices

2011-06-24

arxiv.org/abs/1106.5037v1

Computer Science

Information Theory

Scientific paper

This paper introduces a new framework of fast and efficient sensing matrices for practical compressive sensing, called Structurally Random Matrix (SRM). In the proposed framework, we pre-randomize a sensing signal by scrambling its samples or flipping its sample signs and then fast-transform the randomized samples and finally, subsample the transform coefficients as the final sensing measurements. SRM is highly relevant for large-scale, real-time compressive sensing applications as it has fast computation and supports block-based processing. In addition, we can show that SRM has theoretical sensing performance comparable with that of completely random sensing matrices. Numerical simulation results verify the validity of the theory as well as illustrate the promising potentials of the proposed sensing framework.

Affiliated with

Also associated with

No associations

Rating

Fast and Efficient Compressive Sensing using Structurally Random Matrices 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 and Efficient Compressive Sensing using Structurally Random Matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast and Efficient Compressive Sensing using Structurally Random Matrices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-394533