Deterministic Compressed Sensing Matrices from Multiplicative Character Sequences

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

2010-11-11

arxiv.org/abs/1011.2740v1

Computer Science

Information Theory

Scientific paper

Compressed sensing is a novel technique where one can recover sparse signals from the undersampled measurements. In this paper, a $K \times N$ measurement matrix for compressed sensing is deterministically constructed via multiplicative character sequences. Precisely, a constant multiple of a cyclic shift of an $M$-ary power residue or Sidelnikov sequence is arranged as a column vector of the matrix, through modulating a primitive $M$-th root of unity. The Weil bound is then used to show that the matrix has asymptotically optimal coherence for large $K$ and $M$, and to present a sufficient condition on the sparsity level for unique sparse solution. Also, the restricted isometry property (RIP) is statistically studied for the deterministic matrix. 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 Multiplicative 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 Multiplicative 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 Multiplicative Character Sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-431573