Deterministic Compressed Sensing Matrices from Additive Character Sequences

Details Deterministic Compressed Sensing Matrices from Additive Character Sequences Deterministic Compressed Sensing Matrices from Additive Character Sequences

2010-09-30

arxiv.org/abs/1010.0011v1

Computer Science

Information Theory

Scientific paper

Compressed sensing is a novel technique where one can recover sparse signals from the undersampled measurements. In this correspondence, a $K \times N$ measurement matrix for compressed sensing is deterministically constructed via additive character sequences. The Weil bound is then used to show that the matrix has asymptotically optimal coherence for $N=K^2$, and to present a sufficient condition on the sparsity level for unique sparse recovery. Also, the restricted isometry property (RIP) is statistically studied for the deterministic matrix. Using additive character sequences with small alphabets, the compressed sensing matrix can be efficiently implemented by linear feedback shift registers. Numerical results show that the deterministic compressed sensing matrix guarantees reliable matching pursuit recovery performance for both noiseless and noisy measurements.

Affiliated with

Also associated with

No associations

Rating

Deterministic Compressed Sensing Matrices from Additive Character Sequences 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 Deterministic Compressed Sensing Matrices from Additive Character Sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deterministic Compressed Sensing Matrices from Additive Character Sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-326942