Deterministic compressed sensing matrices from multiplicative character sequences

Compressed sensing is a novel technique where one can recover sparse signals from the undersampled measurements. In this paper, a K×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 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 solutions. With the orthogonal matching pursuit, numerical results show that the deterministic compressed sensing matrices empirically guarantee sparse signal recovery from noiseless measurements with high probability for the sparsity level of O(K/log N).